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;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<long double> x(n), r(n);
for(int i = 0; i < n; i++) {
cin >> x[i] >> r[i];
}
stack<int> st;
for(int i = 0; i < n; i++) {
long double curr = r[i];
while(!st.empty()) {
int idx = st.top();
curr = min(curr, (long double) ((x[i] - x[idx]) * (x[i] - x[idx])) / (4.00 * r[idx]));
if (r[idx] <= curr) {
st.pop();
}
else {
break;
}
}
r[i] = curr;
st.push(i);
cout << fixed << setprecision(3) << curr << "\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... |