#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
using namespace std;
const long double eps = 1e-9;
const long double INF = 1e18;
const int MAXN = (int) 1e6;
struct Point {
long double x, y;
}pts[MAXN + 1];
inline long double dist(Point a, Point b) {
return sqrt(1LL * (a.x - b.x) * (a.x - b.x) + 1LL * (a.y - b.y) * (a.y - b.y));
}
struct Data {
long double l, r;
int id;
};
vector <Data> stk;
inline bool eq(long double a, long double b) {
return fabs(a - b) < eps;
}
long double L;
inline bool ok(long double &l, long double &r, Point b) {
Point a = pts[stk.back().id];
if(eq(a.x, b.x)) {
return 0;
}
long double x = 1.0 * (b.x * b.x + b.y * b.y - a.x * a.x - a.y * a.y) / (2 * (b.x - a.x));
if(x > L) {
return 0;
}
/*if(dist(b, {stk.back().l, 0}) - dist(a, {stk.back().l, 0}) < 0) {
l = stk.back().l;
r = L;
return 1;
}*/
if(x - stk.back().l > 0) {
stk.back().r = x;
l = x;
r = L;
return 0;
}
l = stk.back().l;
r = L;
return 1;
}
int main() {
//ifstream cin("B.in");
//ofstream cout("B.out");
int i, n;
ios::sync_with_stdio(false);
cin >> n >> L;
for(i = 1; i <= n; i++) {
cin >> pts[i].x >> pts[i].y;
}
stk.push_back({0, L, 1});
for(i = 2; i <= n; i++) {
long double l = INF, r = -INF;
while(!stk.empty()) {
if(ok(l, r, pts[i])) {
stk.pop_back();
}
else {
break;
}
}
if(r - l > 0) {
stk.push_back({l, r, i});
}
}
long double ans = 0;
for(auto it : stk) {
ans = max(ans, dist(pts[it.id], {it.l, 0}));
ans = max(ans, dist(pts[it.id], {it.r, 0}));
}
cout << fixed << setprecision(20) << ans;
//cin.close();
//cout.close();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
524 KB |
Output is correct |
4 |
Correct |
2 ms |
624 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
664 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
728 KB |
Output is correct |
2 |
Correct |
5 ms |
900 KB |
Output is correct |
3 |
Correct |
5 ms |
968 KB |
Output is correct |
4 |
Correct |
6 ms |
1028 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
1028 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
1148 KB |
Output is correct |
2 |
Correct |
5 ms |
1204 KB |
Output is correct |
3 |
Correct |
5 ms |
1216 KB |
Output is correct |
4 |
Correct |
6 ms |
1448 KB |
Output is correct |
5 |
Incorrect |
6 ms |
1448 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
49 ms |
4592 KB |
Output is correct |
2 |
Correct |
52 ms |
5488 KB |
Output is correct |
3 |
Correct |
38 ms |
5500 KB |
Output is correct |
4 |
Correct |
55 ms |
7248 KB |
Output is correct |
5 |
Incorrect |
28 ms |
7248 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
45 ms |
8448 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
58 ms |
15684 KB |
Output is correct |
2 |
Correct |
79 ms |
15684 KB |
Output is correct |
3 |
Correct |
73 ms |
15684 KB |
Output is correct |
4 |
Correct |
82 ms |
15684 KB |
Output is correct |
5 |
Correct |
57 ms |
15684 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
72 ms |
16384 KB |
Output is correct |
2 |
Correct |
69 ms |
17768 KB |
Output is correct |
3 |
Correct |
62 ms |
19280 KB |
Output is correct |
4 |
Correct |
77 ms |
20680 KB |
Output is correct |
5 |
Correct |
69 ms |
21952 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
78 ms |
25152 KB |
Output is correct |
2 |
Correct |
68 ms |
25152 KB |
Output is correct |
3 |
Correct |
59 ms |
26616 KB |
Output is correct |
4 |
Correct |
78 ms |
27896 KB |
Output is correct |
5 |
Correct |
64 ms |
29196 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
319 ms |
70744 KB |
Output is correct |
2 |
Correct |
357 ms |
70744 KB |
Output is correct |
3 |
Correct |
327 ms |
70744 KB |
Output is correct |
4 |
Correct |
377 ms |
70744 KB |
Output is correct |
5 |
Correct |
328 ms |
70744 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
360 ms |
70744 KB |
Output is correct |
2 |
Correct |
358 ms |
70744 KB |
Output is correct |
3 |
Correct |
409 ms |
70744 KB |
Output is correct |
4 |
Correct |
404 ms |
70744 KB |
Output is correct |
5 |
Correct |
332 ms |
70744 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
406 ms |
99476 KB |
Output is correct |
2 |
Correct |
418 ms |
99476 KB |
Output is correct |
3 |
Correct |
408 ms |
99476 KB |
Output is correct |
4 |
Correct |
465 ms |
99476 KB |
Output is correct |
5 |
Correct |
441 ms |
99476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
418 ms |
99476 KB |
Output is correct |
2 |
Correct |
408 ms |
99476 KB |
Output is correct |
3 |
Correct |
346 ms |
99476 KB |
Output is correct |
4 |
Correct |
475 ms |
99476 KB |
Output is correct |
5 |
Correct |
397 ms |
99476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
466 ms |
123168 KB |
Output is correct |
2 |
Correct |
516 ms |
123168 KB |
Output is correct |
3 |
Correct |
479 ms |
123168 KB |
Output is correct |
4 |
Correct |
536 ms |
123168 KB |
Output is correct |
5 |
Correct |
436 ms |
123168 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
504 ms |
123168 KB |
Output is correct |
2 |
Correct |
461 ms |
123168 KB |
Output is correct |
3 |
Correct |
418 ms |
123168 KB |
Output is correct |
4 |
Correct |
581 ms |
123168 KB |
Output is correct |
5 |
Correct |
457 ms |
123168 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
615 ms |
132096 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
591 ms |
132096 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
658 ms |
132096 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
767 ms |
132096 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
2 |
Halted |
0 ms |
0 KB |
- |