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;
typedef long long ll;
typedef long double ld;
ld resi(ld d, ld r){
return d*d/4/r;
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(3);
cout << fixed;
int n;
cin >> n;
stack <pair <int, ld>> stek;
for(int i=1; i<=n; i++){
int x;
ld r;
cin >> x >> r;
while(!stek.empty()){
int x1 = stek.top().first;
ld r1 = stek.top().second;
int d = x-x1;
r = min(r, resi(d, r1));
if(r >= r1) stek.pop();
else break;
}
cout << r << "\n";
stek.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... |