# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1205016 | radaiosm7 | Balloons (CEOI11_bal) | C++20 | 186 ms | 11432 KiB |
#include <bits/stdc++.h>
using namespace std;
int n;
long double x[200005];
long double r[200005];
long double final_rad[200005];
vector<int> S;
long double nr(int i, int j) {
return (x[i]-x[j])*(x[i]-x[j])/(4.0*final_rad[i]);
}
int main() {
scanf("%d", &n);
for (int i=1; i <= n; ++i) cin >> x[i] >> r[i];
for (int i=1; i <= n; ++i) {
final_rad[i] = r[i];
while (!S.empty()) {
final_rad[i] = min(nr(S.back(), i), final_rad[i]);
if (final_rad[i] > final_rad[S.back()]) S.pop_back();
else break;
}
S.push_back(i);
}
cout << fixed << setprecision(3);
for (int i=1; i <= n; ++i) cout << final_rad[i] << '\n';
return 0;
}
Compilation message (stderr)
# | 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... |