이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define r first
#define x second
int main(){
//freopen("test.in", "r", stdin);
int n;
cin>>n;
stack<pair<long double, long double>> rd;//{radius, x coord}
for(int i = 0; i<n; i++){
int x, r;
cin>>x>>r;
long double cur = r;
while(!rd.empty()&&cur>rd.top().r){
long double dist= (rd.top().x-x)*(rd.top().x-x)/(4*rd.top().r);
cur = min(cur, dist);
rd.pop();
}
if(!rd.empty()){
long double dist= (rd.top().x-x)*(rd.top().x-x)/(4*rd.top().r);
cur = min(cur, dist);
}
rd.push({cur, x});
printf("%.3Lf\n",cur);
}
}
# | 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... |