The forest is a plane with T trees. Luke's position is specified by a pair of coordinates ( xluke , yluke ) within the plane. The Ewok village has coordinates ( xewok , yewok ). You are to find the shortest travel time from Luke's position to the Ewok village.
The first line of input contains the number of test cases followed by a blank line. The first line of each test case contain T, xluke , yluke xewok , yewok . T lines follow; each gives the coordinates and diameter of a tree: xtreei , ytreei , dtreei . T is an integer not exceeding 10; coordinates and diameters are real numbers in miles. Trees do not intersect or touch one another. There is a blank line between each consecutive test case.
For each test case output is a single real number, to two decimal places, giving the minimum
travel time in seconds. Print a blank line
between 2 consecutive data sets.
1 2 0.0 0.0 10.0 0.0 4.0 0.0 1.0 6.0 0.0 1.0
181.13