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;
const int M = 2e5 +7;
int n;
// pair<int,int> baloon[M];
const int pre = 3;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<double> radius(n);
stack<pair<double ,double >> s;
// s.push({baloon[0].first,baloon[0].second});
double max_r;
for (int i = 0; i <n;i++){
double a, x;
cin >> a >> x;
max_r = x;
// max_r= ((a - s.top().first) * (a - s.top().first))/4 * s.top().second;
while(!s.empty()){
double last_r= ((a - s.top().first) * (a - s.top().first))/4 * s.top().second;
max_r = max(last_r,max_r);
if ( max_r > s.top().second){
s.pop();
continue;
}
else {
break;
}
s.push({a,max_r});
radius[i] = max_r;
}
}
cout << fixed << setprecision(pre);
for (double &r: radius) {cout << r << '\n';}
}
# | 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... |