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 <iostream>
#include <iomanip>
using namespace std;
#include <math.h>
#include <vector>
vector <pair<int,long double>> v;
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++){
long double r;
int x;
cin >> x;
cin >> r;
long double fis;
int j = v.size()-1;
long double m = r;
int ind = 0;
bool f = 0;
while (j >= 0){
long double o = x - v[j].first;
fis = o * o / (4 * v[j].second);
if (fis < r){
if (fis < m){
m = fis;
ind = v[j].first;
f = 1;
}
}
j--;
}
if (f){
int p = v.size()-1;
while (v.size() && v[p].first > ind){
v.pop_back();
p--;
}
}
if (v.empty()){
//cout << fixed << setprecision(3) << r << endl;
printf("%.3Lf\n",r);
v.push_back(make_pair(x,r));
}
else{
//cout << fixed << setprecision(3) << m << endl;
printf("%.3Lf\n",m);
v.push_back(make_pair(x,m));
}
}
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... |