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 pair<long double, long double> ll;
const int MAX_N = 200000;
int n;
long double x[MAX_N + 1], r[MAX_N + 1];
long double expected_val(long double x1, long double r1, long double x2)
{
return (x1 - x2) * (x1 - x2) / (4 * r1);
}
int main()
{
//freopen("test.in","r",stdin);
//freopen("test.out","w",stdout);
cin>>n;
for(int i = 0; i < n; i++){
cin>>x[i]>>r[i];
}
for(int i = 0; i < n; i++){
long double tmp = 10000000000000.0;
for(int j = 0; j < i; j++){
tmp = min(tmp, expected_val(x[j], r[j], x[i]));
}
printf("%.3Lf\n", min(r[i], tmp));
}
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... |