HDU 2701 Lampyridae Teleportae （模拟）

Lampyridae Teleportae

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

Problem Description

The discovery of a remarkable new insect, the Lampyridae Teleportae, more commonly known as the teleporting firefly, has sparked a no-less-remarkable number of ways to try to catch them. Rather than flying, the Lampyridae Teleportae teleports from spot to spot by warping space-time. When it stops between teleports, it hovers for a moment and flashes its light in search of a mate. So, even though they only come out after dark, it's easy to observe them, but very difficult to catch them. Fortunately for the Association for Catching Lampyridae (ACL), student members of the Association for Cool Machinery (ACM) recently developed the world's first teleporting tennis shoes. The tennis shoes are efficient enough that, when a
Lampyridae Teleportae is spotted by its flash, there is always time to teleport once before the firefly itself teleports off to another location, but there is never time to teleport twice in a row before the firefly teleports away. The tennis shoes have a maximum teleport range, however, depending on how well their flux capacitor is constructed, so it's not always possible to catch a Lampyridae Teleportae with just a single teleport. The
most efficient catching method is to remain in place until a firefly flashes, and to then teleport in a straight line directly toward it, subject to the limitation of the maximum range of ones tennis shoes, in an attempt to get close enough to catch it. If you don't get close enough, you wait for the next flash, teleport towards it again, and repeat, until you either catch it or it's gone.
For this programming problem you will simulate this procedure for catching teleporting fireflies with a few simplifying assumptions:
(1) We will be chasing only one firefly at a time.
(2) Firefly chasing will take place in two dimensions where all units are considered to be yards.
(3) The firefly is "caught" if the chaser can manage to come within one yard of the firefly.
(4) The chaser's movement toward a firefly is always in a straight line from his or her current location directly toward the flash; if the range of the chaser's tennis shoes prevents getting close enough to catch the firefly, the chaser will always teleport the maximum range possible (thus, although the chaser always starts at integer coordinates, it is possible and likely that any or all of the chaser's locations after the first teleport will be at non-integer coordinates).
The input will consist of several chase scenarios. For each scenario you will be given the maximum range in yards of the chaser's teleporting tennis shoes, the chaser's starting location, and a list of one or more flash
locations for the firefly being chased. For each chase scenario your program will output a single line indicating either the flash location where the firefly was caught, or a message noting that the firefly was never caught.

 

Input

The first line of a chase scenario contains three numbers, delimited by a single space, in the following order: the maximum range in yards of the chaser's teleporting tennis shoes, the starting x-coordinate of the chaser, and the starting y-coordinate of the chaser. The maximum range will be a positive integer from 1 to 1000. The x and y values for the starting coordinates will be integers from 0 to 1000. The remaining lines of
an input scenario contain two integers each, an x-coordinate and a y-coordinate, again delimited by a single space. These are, in order of appearance, the locations where the firefly flashes. All coordinate values range from 0 to 1000. A line specifying a value of -1 for both x and y terminates the list, at which point we consider the firefly to disappear never to be seen again. Note that a firefly might be caught at a flash location prior to end of the list; in this case the rest of the flash locations listed in the input for the current chase scenario should simply be ignored.
The next input scenario begins on the line immediately after the last line of the preceding scenario. An input scenario that specifies 0 (zero) as the maximum range of the chaser will terminate the input.

Output

Every output line will be either:
(1) "Firefly N caught at (x,y)", where N is the input scenario number starting with 1, and (x,y) is the last location the firefly flashed before it was caught; or
(2) "Firefly N not caught".

Sample Input

2 0 03 34 45 56 67 7-1 -12 0 03 35 57 7-1 -110 50 5050 6240 5530 5545 4550 5055 5550 50-1 -10 0 0

Sample Output

Firefly 1 caught at (6,6)Firefly 2 not caughtFirefly 3 caught at (50,50)

Source

2008 Mid-Central USA

Recommend

zty   |   We have carefully selected several similar problems for you:  2702 2703 2707 2706 2705 

题意：英语阅读题？？？！！！。。。吐槽一下。。。

         你有一双可以瞬移的鞋子，你要捕捉一只同样可以瞬移的萤火虫。给出自己每次瞬移的最远距离r和起始坐标（x，y），再依次给出这只萤火虫出现的坐标（不规定个数）直到输入（-1，-1）。每次萤火虫出现，你都向它的坐标瞬移。一旦你和萤火虫虫的距离不超过1，则是捕捉到。问你萤火虫在哪个坐标被捕捉到（或不能被捕捉到）。

           模拟一下即可。

AC代码：

#include<stdio.h>#include<math.h>#include<iostream>int r, x, y ;double dist(double x1, double y1, double x2, double y2){    return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2)) ;}int main (){    int cas = 1 ;    while (~scanf ("%d%d%d", &r, &x, &y))    {     if(r==0&&x==0&&y==0)break;     double sx = x, sy = y, ex, ey, t ;    int flag = 0 ;    while (1)     {       scanf ("%lf%lf", &ex, &ey) ;        if (ex < 0 && ey < 0) break ;         if (flag) continue ;       if (dist(sx, sy, ex, ey) <= r+1.0)        {            printf ("Firefly %d caught at (%.0lf,%.0lf)\n", cas++, ex, ey) ;            flag = 1 ;        }        //即使不到下一个萤火虫，但还是要瞬移。按比例求出瞬移后的x，y坐标即可         t = r*1.0 / dist(sx, sy, ex, ey) ;             sx = sx + (ex-sx)*t;        sy = sy + (ey-sy)*t;    }    if (flag==0) printf ("Firefly %d not caught\n", cas++) ;}     return 0 ;}