이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(NULL) -> sync_with_stdio(false);
int N;
cin >> N;
stack<pair<ll, long double>> mono;
mono.push({-1e9, 1});
cout << fixed << setprecision(5);
while (N--)
{
ll x;
long double r;
cin >> x >> r;
while (!mono.empty())
{
auto [x1, r1] = mono.top();
long double newR = (x - x1) * (x - x1) / (4 * r1);
r = min(r, newR);
if (r < r1)
break;
mono.pop();
}
cout << r << '\n';
mono.push({x, r});
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |