| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1281203 | minhphan | Balloons (CEOI11_bal) | C++20 | 178 ms | 5096 KiB |
#include <bits/stdc++.h>
using namespace std;
long double calcRadius(const pair<int, long double> &a, const long double bx) {
const long double dx = bx-a.first;
return dx*dx/(4*a.second);
}
int main() {
int n;
cin >> n;
stack<pair<int, long double>> stack;
vector<long double> finalRadius(n);
for (int i = 0; i<n; i++) {
long double x, r;
cin >> x >> r;
long double maxR = r;
while (!stack.empty()) {
pair<int, long double> last = stack.top();
long double radius = calcRadius(last, x);
maxR = min(maxR, radius);
if (radius >= last.second) {
stack.pop();
continue;
}
break;
}
stack.emplace(x, maxR);
finalRadius[i] = maxR;
}
cout << fixed << setprecision(3);
for (int i = 0; i<n; i++) {
cout << finalRadius[i] << "\n";
}
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... | ||||
