This is a shortest path finding problem, however, finding the points where one can change to another line is not a pleasant task.
One should calculate line-line, circle-line and circle-circle intersections to find the places (and times) where the bus of a given polygon is closer than R to another polygon.
A handful of teams could solve all ten inputs during the contest.
2.in and 10.in:
