All submissions for this problem are available.
In an Auditorium, there are many people (little far from each other ) out of which some of them are singers while the remaining are just songs' lovers. The singers decided to sing a song even though the audio system of the hall is damaged. A song lover can enjoy the song if he is inside of any of the singer's range (the radius upto which the voice can be reached)
The problem is some of the singers have forgotten the lyrics. But a singer can recollect the lyrics if he/she is inside of any of the singers' range. Finally, all the song lovers should enjoy the song that is sung by the singers.
The first line of the input contains an integer T denoting the number of test cases. The First line of each test case contains two spaced integers : S and N. S denotes the number of singers and N denotes the number of the song lovers. Each of the next S lines contains (x,y) denoting the coordinates of the singers in the 2D plane . Next N lines denote the coordinates of the song lovers.
- The range of every singer is the same.
- Atleast one of the singers knows the lyrics.
- No two people can be in the same location.
Print T lines, each line denoting the minimum range required by the singers rounded off to 6 decimal digits. .
- 1 ≤ T ≤ 5
- 1 <= N,M <= 20
- 0 <= x,y <= 100
Input: 1 1 2 1 1 0 0 0 2 Output: 1.414214
The singer needs to cover two song lovers. So, the range of the singer will be the minimum of distance between (1,1) and (0,0) and the distance between (1,1) and (0,2).
|Time Limit:||1 - 2 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, CLOJ, COB, FS|
Fetching successful submissions