本站作为LDUOnlineJudge的测试版本进行演示,官方网站请访问http://icpc.ldu.edu.cn
[Hidden]

1248. G. Walking in the Sun


Description

Input

There will be multiple test cases in the input file.  The first input line contains a positive integer, indicating the number of test cases.
 
The first line of each test case, s (0 <= S < 50), contains the number of locations of shade on campus for that test case.  Each of the next s lines contains the x-coordinate, y-coordinate, and radius, respectively, of a shade location, separated by spaces.
 
The next line of each test case, q (0 < q < 100), contains the number of distance queries for the test case.  Each of the next q lines will contain four numbers representing two points on campus, in the form x1 y1 x2 y2, where (x1,y1) are the coordinates of the first point, and (x2,y2) are the coordinates of the second point.
 
All x-coordinates, y-coordinates, and radii will be real numbers between -1000 and 1000, inclusive.
 

Output


Samples

Input Copy
2
3
5.2 3.3 4.7
-8.8 -6.1 3.1
18.5 6.1 2.2
6
1.1 20.2 6.1 18.1
1.1 20.2 3.3 -2.5
0.4 -2.7 3.3 -2.5
6.1 18.1 -5.5 -9.2
3.3 -2.5 0.4 -2.7
1.1 20.2 0.4 -2.7
1
0.0 0.0 20.0
1
3.1 2.2 7.7 8.1
Output
Campus #1:
  Path #1: Shortest sun distance is 5.4.
  Path #2: Shortest sun distance is 14.1.
  Path #3: Shortest sun distance is 2.9.
  Path #4: Shortest sun distance is 20.6.
  Path #5: Shortest sun distance is 2.9.
  Path #6: Shortest sun distance is 15.7. 

Campus #2:
  Path #1: Shortest sun distance is 0.0. 

Source

UCF2014 PRACTICE
Problem Information

Time Limit: 1000MS (C/C++,Others×2)
Memory Limit: 128MB (C/C++,Others×2)
Special Judge: No
AC/Submit: 1 / 1
Tags:
Contests involved

1028. UCF 2014 Practice
My history solutions

You didn't submit any solution!
Submit your solution

Login Register