This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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++){
long double x, r;
cin>>x>>r;
long double cur = r;
while(!rd.empty()){
long double dist= (rd.top().x-x)*(rd.top().x-x)/(4*rd.top().r);
cur = min(cur, dist);
if(cur>rd.top().r){
rd.pop();
}else{
break;
}
}
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... |