#include <bits/stdc++.h>
const int32_t MAX_N = 1e6;
const double EPS = 1e-6;
int32_t n, l;
std::pair< int32_t, int32_t > points[MAX_N + 5];
bool Check(long double r) {
std::vector< std::pair< long double, bool > > events(2 * n);
for(int32_t i = 0; i < n; i++) {
if(r * r < (int64_t) points[i].second * points[i].second) {
events[2 * i] = { -2.0, 0 };
events[2 * i + 1] = { -1.0, 1 };
continue;
}
long double x1 = points[i].first - sqrt(r * r - (int64_t) points[i].second * points[i].second);
long double x2 = points[i].first + sqrt(r * r - (int64_t) points[i].second * points[i].second);
events[2 * i] = { x1, 0 };
events[2 * i + 1] = { x2, 1 };
}
std::sort(events.begin(), events.end());
int32_t currCnt = 0;
for(int32_t i = 0; i < 2 * n; i++) {
if(events[i].first > 0 && currCnt == 0) {
return false;
}
if(events[i].first > l) {
break;
}
if(events[i].second == 0) {
currCnt++;
}
else {
currCnt--;
}
if(!(events[i].first < 0.0) && currCnt == 0) {
return false;
}
}
if(events.back().first < 0) {
return false;
}
return true;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n >> l;
for(int32_t i = 0; i < n; i++) {
std::cin >> points[i].first >> points[i].second;
}
int64_t low = 1, high = 1e12;
long double ans;
while(low <= high) {
int64_t mid = (low + high) / 2;
if(Check(mid / 1000.0)) {
ans = mid / 1000.0;
high = mid - 1;
}
else {
low = mid + 1;
}
}
std::cout << std::fixed << std::setprecision(7);
std::cout << ans << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
392 KB |
Output is correct |
4 |
Correct |
2 ms |
564 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
564 KB |
Output is correct |
2 |
Correct |
3 ms |
564 KB |
Output is correct |
3 |
Correct |
3 ms |
564 KB |
Output is correct |
4 |
Correct |
3 ms |
564 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
756 KB |
Output is correct |
2 |
Correct |
19 ms |
756 KB |
Output is correct |
3 |
Correct |
17 ms |
756 KB |
Output is correct |
4 |
Correct |
17 ms |
772 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
936 KB |
Output is correct |
2 |
Correct |
40 ms |
952 KB |
Output is correct |
3 |
Correct |
43 ms |
992 KB |
Output is correct |
4 |
Correct |
41 ms |
1060 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
1060 KB |
Output is correct |
2 |
Correct |
40 ms |
1060 KB |
Output is correct |
3 |
Correct |
42 ms |
1104 KB |
Output is correct |
4 |
Correct |
41 ms |
1168 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
1168 KB |
Output is correct |
2 |
Correct |
40 ms |
1232 KB |
Output is correct |
3 |
Correct |
42 ms |
1232 KB |
Output is correct |
4 |
Correct |
41 ms |
1252 KB |
Output is correct |
5 |
Correct |
41 ms |
1252 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
708 ms |
6100 KB |
Output is correct |
2 |
Correct |
806 ms |
6232 KB |
Output is correct |
3 |
Correct |
483 ms |
6232 KB |
Output is correct |
4 |
Correct |
746 ms |
6232 KB |
Output is correct |
5 |
Correct |
474 ms |
6232 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
780 ms |
6340 KB |
Output is correct |
2 |
Correct |
704 ms |
6340 KB |
Output is correct |
3 |
Correct |
770 ms |
6596 KB |
Output is correct |
4 |
Correct |
767 ms |
6596 KB |
Output is correct |
5 |
Correct |
825 ms |
6928 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
989 ms |
7028 KB |
Output is correct |
2 |
Correct |
918 ms |
7028 KB |
Output is correct |
3 |
Incorrect |
905 ms |
7028 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1047 ms |
7856 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
787 ms |
7880 KB |
Output is correct |
2 |
Execution timed out |
1059 ms |
7880 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1052 ms |
36044 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1064 ms |
36064 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1065 ms |
43180 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1077 ms |
43180 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1071 ms |
50172 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1010 ms |
50172 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1074 ms |
57260 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1064 ms |
57260 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1052 ms |
71332 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1075 ms |
71332 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |