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;
const int INF = 1000000000;
const ll LINF = (ll) INF * (ll) INF;
const ld DINF = (ld) INF * (ld) INF;
static int MAXN = 200005;
int main() {
int n;
cin >> n;
vector<pair<ld, ld>> arr(MAXN);
for (int i=0; i<n; i++) {
cin >> arr[i].first; //x coord
cin >> arr[i].second; //radius
}
stack<pair<ld, ld>> q;
for (int i=0; i<n; i++) {
while (!q.empty()) {
pair<ld, ld> top = q.top();
ld h = arr[i].first - top.first;
ld r = (h * h)/(4.0 * top.second);
arr[i].second = min(arr[i].second, r);
if (r >= top.second) {
q.pop();
} else {
break;
}
}
q.push(arr[i]);
}
cout << setprecision(20) << endl;
for (int i=0; i<n; i++) {
cout << arr[i].second << endl;
}
}
# | 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... |