All submissions for this problem are available.
Lex Luthor has equipped unwitttingly equipped Darkseid's Parademons with bombs. The bombs, after explosion, cover an exact circle with a blast radius of r. Batman knows that they cannot be stopped. However, since he knows the positions of the bombers, if he can find the perimeter of the shortest simple closed curve that covers all the bombers and their blast radiuses, he can send Superman and Wonder Woman along it to prevent collateral damage. Please help him do that.
The first line contains the number of test cases, t.
- For each test case, the first line contains 2 integers, the number of Parademons, n, and the blast radius, r.
- The next n lines contain 2 integers, x and y denoting the co-ordinates of the demons.
For each test case, print the length of the shortest curve.
- n <= 1e5
- sum of n over all test cases is less than 2e5
Input: 1 2 1 0 0 1 0 Output: 8.283185
|Time Limit:||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, SCALA, 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, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions