이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
const ld w = 0.0001;
ld solve(ld x1, ld x2, ld r2){
return ((x2 - x1)*(x2 - x1))/(4*r2) - w;
}
int main(){
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
stack<pair<ld, ld>> q;
for(int i=1; i<=n; i++){
ld x, r; cin >> x >> r;
while(!q.empty()){
r = min(r, solve(x, q.top().first, q.top().second));
if(q.top().second > r) break;
q.pop();
}
cout << fixed << setprecision(3) << r << "\n";
q.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... |