#include <bits/stdc++.h>
using namespace std ;
const int MAX = 1e5 + 10 ;
double x[MAX] , y[MAX] ;
int n ;
double l;
bool check(double radius)
{
double now = 0.00 ;
for(int i = 0 ; i < n ; ++i)
{
double a = sqrt(radius * radius - ((-y[i]) * (-y[i]))) + x[i] ;
double b = -sqrt(radius * radius - ((-y[i]) * (-y[i]))) + x[i] ;
if(a > b)
swap(a , b) ;
if(a <= now)
now = max(now , b) ;
}
return (now >= l) ;
}
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n>>l ;
for(int i = 0 ; i < n ; ++i)
cin>>x[i]>>y[i] ;
double low = 0.000 , high = 1e12 ;
double ans = high ;
for(int i = 0 ; i < 300 ; ++i)
{
double mid = (low + high) / 2.00 ;
if(check(mid))
ans = mid , high = mid ;
else
low = mid ;
}
return cout<<fixed<<setprecision(6)<<ans<<"\n" , 0 ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
376 KB |
Output is correct |
2 |
Correct |
11 ms |
376 KB |
Output is correct |
3 |
Correct |
12 ms |
376 KB |
Output is correct |
4 |
Correct |
10 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
28 ms |
376 KB |
Output is correct |
2 |
Correct |
19 ms |
504 KB |
Output is correct |
3 |
Correct |
20 ms |
504 KB |
Output is correct |
4 |
Correct |
28 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
376 KB |
Output is correct |
2 |
Correct |
19 ms |
528 KB |
Output is correct |
3 |
Correct |
21 ms |
504 KB |
Output is correct |
4 |
Correct |
29 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
376 KB |
Output is correct |
2 |
Correct |
18 ms |
376 KB |
Output is correct |
3 |
Correct |
20 ms |
504 KB |
Output is correct |
4 |
Correct |
28 ms |
428 KB |
Output is correct |
5 |
Correct |
27 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
397 ms |
1556 KB |
Output is correct |
2 |
Correct |
255 ms |
2808 KB |
Output is correct |
3 |
Correct |
202 ms |
1784 KB |
Output is correct |
4 |
Correct |
402 ms |
2828 KB |
Output is correct |
5 |
Correct |
253 ms |
1596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
399 ms |
1608 KB |
Output is correct |
2 |
Correct |
364 ms |
2436 KB |
Output is correct |
3 |
Correct |
424 ms |
2808 KB |
Output is correct |
4 |
Correct |
420 ms |
2936 KB |
Output is correct |
5 |
Correct |
469 ms |
3192 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
275 ms |
1768 KB |
Output is correct |
2 |
Correct |
273 ms |
1788 KB |
Output is correct |
3 |
Correct |
314 ms |
1784 KB |
Output is correct |
4 |
Correct |
542 ms |
3832 KB |
Output is correct |
5 |
Correct |
456 ms |
2824 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
333 ms |
1944 KB |
Output is correct |
2 |
Correct |
338 ms |
1992 KB |
Output is correct |
3 |
Correct |
373 ms |
2040 KB |
Output is correct |
4 |
Correct |
549 ms |
4088 KB |
Output is correct |
5 |
Correct |
521 ms |
3240 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
332 ms |
1944 KB |
Output is correct |
2 |
Correct |
332 ms |
1944 KB |
Output is correct |
3 |
Correct |
371 ms |
2040 KB |
Output is correct |
4 |
Correct |
545 ms |
3960 KB |
Output is correct |
5 |
Correct |
528 ms |
3232 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
52 ms |
3692 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
76 ms |
3760 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
52 ms |
3576 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
76 ms |
3616 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
51 ms |
3688 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
74 ms |
3696 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
51 ms |
3576 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
74 ms |
3804 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
51 ms |
3576 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
74 ms |
3676 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |