Problem:
Problem E: Earth Observation with a Mobile Robot Team A new type of mobile robot has been developed for environmental earth
observation.
It moves around on the ground, acquiring and recording various sorts of
observational data using high precision sensors.
Robots of this type have short range wireless communication devices and can
exchange observational data with ones nearby.
They also have large capacity memory units, on which they record data
observed by themselves and those received from others. Figure 1 illustrates the current positions of three robots A, B, and C and
the geographic coverage of their wireless devices.
Each circle represents the wireless coverage of a robot, with its
center representing the position of the robot.
In this figure, two robots A and B are in the positions where A can
transmit data to B, and vice versa.
In contrast, C cannot communicate with A or B, since it is too remote
from them.
Still, however, once B moves towards C as in Figure 2, B and C can
start communicating with each other.
In this manner, B can relay observational data from A to C.
Figure 3 shows another example, in which data propagate among several robots 
instantaneously.       Figure 1: The initial configuration of three robots          Figure 2: Mobile relaying          Figure 3: Instantaneous relaying among multiple robots    As you may notice from these examples, if a team of robots move
properly, observational data quickly spread over a large number of them.
Your mission is to write a program that simulates how information
spreads among robots.
Suppose that, regardless of data size, the time necessary for
communication is negligible. Input The input consists of multiple datasets, each in the following format.  N  T  R  nickname and travel route of the first robot  nickname and travel route of the second robot ...  nickname and travel route of the N-th robot  The first line contains three integers N , T , and R that are the number of robots, the length of the simulation
period, and the maximum distance wireless signals can reach,
respectively, and satisfy that 1 <= N <= 100, 1 <= T <= 1000, and 1 <= R <= 10. The nickname and travel route of each robot are given in the
following format.  nickname  t 0  x 0  y 0  t 1  vx 1  vy 1  t 2  vx 2  vy 2 ...  t k  vx k  vy k    Nickname is a character string of length between one and eight that
only contains lowercase letters.
No two robots in a dataset may have the same nickname.
Each of the lines following nickname contains three integers,
satisfying the following conditions. 0 = t 0 < t 1 < ... < t k = T -10 <= vx 1 , vy 1 ,  ..., vx k , vy k <= 10  A robot moves around on a two dimensional plane.
( x 0 , y 0 ) is the location of the
robot at time 0.
From time t i -1 to t i (0
< i <= k ), the velocities in the x and y directions are vx i and vy i , respectively.
Therefore, the travel route of a robot is piecewise linear.
Note that it may self-overlap or self-intersect. You may assume that each dataset satisfies the following conditions.  The distance between any two robots at time 0 is not exactly R.  The x - and y -coordinates
of each robot are always between -500 and 500, inclusive. Once any robot approaches within R + 10 -6 of any
other, the distance between them will become smaller than R - 10 -6 while maintaining the velocities. Once any robot moves away up to R - 10 -6 of any
other, the distance between them will become larger than R + 10 -6 while maintaining the velocities. If any pair of robots mutually enter the wireless area of the
opposite ones at time t and any pair, which may share one or
two members with the aforementioned pair, mutually leave the wireless
area of the opposite ones at time t' , the difference between t and t' is no smaller than 10 -6 time unit, that is,
| t - t' | >= 10 -6 . A dataset may include two or more robots that share the same location
at the same time.
However, you should still consider that they can move with the
designated velocities. The end of the input is indicated by a line containing three zeros. Output For each dataset in the input, your program 
should print the nickname of each robot that have got until time T the observational data originally acquired by the first robot
at time 0. 
Each nickname should be written in a separate line in dictionary order
without any superfluous characters such as leading or trailing spaces. Sample Input 3 5 10
red
0 0 0
5 0 0
green
0 5 5
5 6 1
blue
0 40 5
5 0 0
3 10 5
atom
0 47 32
5 -10 -7
10 1 0
pluto
0 0 0
7 0 0
10 3 3
gesicht
0 25 7
5 -7 -2
10 -1 10
4 100 7
impulse
0 -500 0
100 10 1
freedom
0 -491 0
100 9 2
destiny
0 -472 0
100 7 4
strike
0 -482 0
100 8 3
0 0 0 Output for the Sample Input blue
green
red
atom
gesicht
pluto
freedom
impulse
strike

Solution (Python):
from heapq import heappush, heappop
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
    N, T, R = map(int, readline().split())
    if N == T == R == 0:
        return False
    S = [None]*N
    TS = [None]*N
    for i in range(N):
        s = readline().strip()
        S[i] = s
        prv, x0, y0 = map(int, readline().split())
        r = []
        while prv != T:
            t, vx, vy = map(int, readline().split())
            r.append((prv, t, x0, y0, vx, vy))
            x0 += vx*(t - prv); y0 += vy*(t - prv)
            prv = t
        TS[i] = r
    INF = 10**18
    que = [(0, 0)]
    dist = [INF]*N
    dist[0] = 0
    while que:
        cost, v = heappop(que)
        if cost - dist[v] > 1e-6:
            continue
        k0 = 0
        T1 = TS[v]
        while 1:
            t0, t1, x0, y0, vx, vy = T1[k0]
            if t0 <= cost <= t1:
                break
            k0 += 1
        for w in range(N):
            if v == w or dist[w] < cost:
                continue
            k1 = k0
            k2 = 0
            T2 = TS[w]
            while 1:
                t0, t1, x0, y0, vx, vy = T2[k2]
                if t0 <= cost <= t1:
                    break
                k2 += 1
            while 1:
                p0, p1, x0, y0, vx0, vy0 = T1[k1]
                q0, q1, x1, y1, vx1, vy1 = T2[k2]
                t0 = max(p0, q0, cost); t1 = min(p1, q1)
                if dist[w] <= t0:
                    break
                a0 = (vx0 - vx1)
                a1 = (x0 - p0*vx0) - (x1 - q0*vx1)
                b0 = (vy0 - vy1)
                b1 = (y0 - p0*vy0) - (y1 - q0*vy1)
                A = a0**2 + b0**2
                B = 2*(a0*a1 + b0*b1)
                C = a1**2 + b1**2 - R**2
                if A == 0:
                    assert B == 0
                    if C <= 0:
                        e = t0
                        if e < dist[w]:
                            dist[w] = e
                            heappush(que, (e, w))
                        break
                else:
                    D = B**2 - 4*A*C
                    if D >= 0:
                        s0 = (-B - D**.5) / (2*A)
                        s1 = (-B + D**.5) / (2*A)
                        if t0 <= s1 and s0 <= t1:
                            e = max(t0, s0)
                            if e < dist[w]:
                                dist[w] = e
                                heappush(que, (e, w))
                            break
                if p1 < q1:
                    k1 += 1
                elif p1 > q1:
                    k2 += 1
                elif p1 == T:
                    break
                else:
                    k1 += 1; k2 += 1
    ans = []
    for i in range(N):
        if dist[i] < INF:
            ans.append(S[i])
    ans.sort()
    for e in ans:
        write("%s\n" % e)
    return True
while solve():
    ...