# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145824 | SulA | Balloons (CEOI11_bal) | C++20 | 83 ms | 7612 KiB |
#include <bits/stdc++.h>
#pragma GCC optimize("popcnt")
#define all(a) a.begin(), a.end()
#define popcount __builtin_popcount
using namespace std;
using namespace chrono;
int a[1000][100];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int n; cin>>n;
long long x[n], r[n];
double R[n];
for (int i = 0; i < n; cin >> x[i] >> r[i++]);
vector<pair<long long, double>> st;
for (int j = 0; j < n; j++) {
R[j] = r[j];
while (!st.empty()) {
auto [xi, Ri] = st.back();
auto d = x[j] - xi;
auto t = d*d/(4*Ri);
if (t > R[j]) break;
R[j] = min(R[j], t);
st.pop_back();
}
st.emplace_back(x[j], R[j]);
}
cout<< fixed << setprecision(4);
for (auto rad : R) cout << rad << "\n";
}
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... |