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;
int main(){
cout<<fixed<<setprecision(3);
int n;
cin>>n;
stack<pair<long double, long double>> s;
for(int i=1;i<=n;i++){
int x;
long double r;
cin>>x>>r;
while(s.size()){
int x1= s.top().first;
long double r1= s.top().second;
r=min(r,(long double)pow(x-x1,2)/(4.0*r1));
if(r>=r1){
s.pop();
} else{
break;
}
}
cout<<r<<endl;
s.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... |