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 ll long long
#define ld long double
#define f first
#define s second
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main() {_
int n;
cin>>n;
stack<pair<ld,ld>> s;
for(int i=0;i<n;i++){
ld x,r;
cin>>x>>r;
while(!s.empty()){
ld x1=s.top().f;
ld r1=s.top().s;
r=min(r,(x-x1)*(x-x1)/((4.0)*r1));
if(r>=r1) s.pop();
else break;
}
s.push({x,r});
cout<<fixed<<setprecision(3)<<r<<'\n';
}
return 0;
}
//maybe its multiset not set
# | 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... |