# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914658 | NoLove | Balloons (CEOI11_bal) | C++14 | 166 ms | 6052 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* author : Lăng Trọng Đạt
* created: 22-01-2024
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define int long long
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
using pii = pair<int, int>;
using vi = vector<int>;
#define FOR(i, a, b) for (int (i) = a; (i) <= (b); i++)
void mx(int& a, int b) { if (b > a) a = b; }
void mi(int& a, int b) { if (b < a) a = b; }
#define si(x) (int)(x.size())
const int INF = 1e18;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
int x[MAXN];
const double EPS = 1e-7;
double r[MAXN]; // r[i]: final radius of balloon i
int n;
double mx_radius(int i, int j) {
if (i == 0) return INF;
return (double)(x[i] - x[j])*(x[i] - x[j]) / 4. / r[i];
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("hi.inp", "r")) {
freopen("hi.inp", "r", stdin);
// freopen("hi.out", "w", stdout);
}
vi s = {0};
r[0] = INF;
x[0] = -1e8;
cin >> n;
int cnt = 0;
FOR(i, 1, n) {
cin >> x[i] >> r[i];
while (r[i] - mx_radius(s.back(), i) > EPS or r[i] >= r[s.back()]) {
r[i] = min(r[i], mx_radius(s.back(), i));
if (r[i] >= r[s.back()])
s.pop_back();
else break;
// db(i, s, r[i], r[s.back()])
// db(i, mx_radius(s.back(), i) < r[i], r[i] - mx_radius(s.back(), i) < EPS)
}
s.push_back(i);
cout << setprecision(4) << r[i] << "\n";
}
db(cnt)
}
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... |