F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Elune¡¯s Arrow

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 839    Accepted Submission(s): 178


Problem Description
In a recent DOTA game, Littlepig picked Priestess of the Moon (also been called as ¡°POM¡±) and wanted to practice his skills. As you may know, POM is famous for her second skill ¡°Elune¡¯s Arrow¡±, which allows POM to fire a fast magic arrow to deal large damage to the enemy unit. In fact, POM¡¯s arrow always flies in a straight line and disappear after hitting an enemy unit.

Littlepig¡¯s POM was hiding in the forest and intended to shoot a certain important target on the lane. There were also several other enemy units nearby. POM¡¯s arrow might fly in a wrong direction and miss the target, or even if the arrow flew straight to the target, it still could be blocked by other enemy units and couldn¡¯t reach the target. So given a flying direction, your job is to determine whether Littlepig¡¯s arrow would hit his target.
 

Input
The input contains several test cases, and each test case is given in the following format:
The first line contains an integer n (0 <n<=5), indicating the number of enemy units in the game.
The second line are two integers (x0,y0) representing the position where POM stands.
The third line gives a vector (dx,dy) describing the flying direction of the arrow.
Then n lines follows, each describing an enemy unit. An enemy unit can be considered as a convex polygon and the polygon is given in the following format in a line:
    m x1 y1 x2 y2¡­xm ym
m is the number of vertices(m<=10), and (x1,y1)¡­(xm,ym) are the vertices coordinates of the polygon, given in counter-clockwise order.
The first enemy unit is the POM¡¯s target.

The input ends with a zero in a separate line (n=0). All input numbers are integers that do not exceed 105 in magnitude. It is guaranteed that polygons do not contact or overlap, and the point (x0,y0) isn¡¯t inside (or on) any polygons.
 

Output
For each test case, output ¡°HIT¡± if the arrow hits its target and ¡°MISS¡± otherwise, in a separate line.
 

Sample Input
1 0 0 0 1 3 2 0 0 2 0 1 1 0 0 -1 -1 3 2 0 0 2 0 1 0
 

Sample Output
HIT MISS
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-26 05:03:24, Gzip enabled