#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 3, mod = 1e9 + 7, inf = 1e9 + 5;
double dist(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
double gimr(double x1, double y1, double x2, double y2)
{
double l = 0, r = y2, mid, ans = 0;
while ((r - l) > 1e-9)
{
mid = (l + r) / 2;
if (dist(x1, y1, x2, mid) >= y1 + mid)
ans = max(ans, mid), l = mid;
else
r = mid;
}
return ans;
}
bool sa7be(double x1, double y1, double x2, double y2)
{
return (y1 + y2 > dist(x1, y1, x2, y2));
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
int n;
cin >> n;
stack<pair<double, double>> st;
for (int i = 0; i < n; i++)
{
double x, r;
cin >> x >> r;
while (true)
{
if (st.size() && sa7be(st.top().first, st.top().second, x, r))
r = min(r, gimr(st.top().first, st.top().second, x, r));
if (st.size() && r > st.top().second)
st.pop();
else
break;
}
cout << fixed << setprecision(3) << r << "\n";
st.push({x, r});
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
10 numbers |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2004 ms |
344 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
505 numbers |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
456 KB |
2000 numbers |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
592 KB |
20000 numbers |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
70 ms |
1052 KB |
50000 numbers |
2 |
Execution timed out |
2089 ms |
344 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
144 ms |
1360 KB |
100000 numbers |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
166 ms |
1540 KB |
115362 numbers |
2 |
Execution timed out |
2039 ms |
344 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
212 ms |
1724 KB |
154271 numbers |
2 |
Execution timed out |
2017 ms |
344 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
265 ms |
2024 KB |
200000 numbers |
2 |
Execution timed out |
2031 ms |
344 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |