# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
914658 | 2024-01-22T13:27:06 Z | NoLove | Balloons (CEOI11_bal) | C++14 | 166 ms | 6052 KB |
/** * 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2396 KB | 5th numbers differ - expected: '17.1630000000', found: '17.1600000000', error = '0.0030000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2516 KB | 1st numbers differ - expected: '247294217.0000000000', found: '247300000.0000000000', error = '5783.0000000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2392 KB | 314th numbers differ - expected: '10.1250000000', found: '10.1200000000', error = '0.0050000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 2564 KB | 2nd numbers differ - expected: '122.0020000000', found: '122.0000000000', error = '0.0020000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 2844 KB | 50th numbers differ - expected: '159.0020000000', found: '159.0000000000', error = '0.0020000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 46 ms | 3544 KB | 1st numbers differ - expected: '15399.0000000000', found: '15400.0000000000', error = '1.0000000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 76 ms | 4364 KB | 285th numbers differ - expected: '7629.0020000000', found: '7629.0000000000', error = '0.0020000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 85 ms | 4744 KB | 511th numbers differ - expected: '4494.0050000000', found: '4494.0000000000', error = '0.0050000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 138 ms | 5344 KB | 164th numbers differ - expected: '1698.0020000000', found: '1698.0000000000', error = '0.0020000000' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 166 ms | 6052 KB | 248th numbers differ - expected: '2694.0020000000', found: '2694.0000000000', error = '0.0020000000' |
2 | Halted | 0 ms | 0 KB | - |