# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872453 | 2023-11-13T06:44:52 Z | sleepntsheep | Balloons (CEOI11_bal) | C++17 | 2000 ms | 3472 KB |
#include <iostream> #include <iomanip> #include <cmath> #include <cstring> #include <vector> #include <algorithm> #include <deque> #include <set> #include <utility> #include <array> using i64 = long long; using u64 = unsigned long long; using f64 = double; using f80 = long double; using namespace std; #define ALL(x) x.begin(), x.end() #define ShinLena cin.tie(nullptr)->sync_with_stdio(false); #define N 200005 int n, x[N], r[N]; f80 rr[N]; int main() { ShinLena; cin >> n; for (int i = 0; i < n; ++i) cin >> x[i] >> r[i]; rr[0] = r[0]; for (int st = 0, i = 1; i < n; ++i) { f80 l = 0, r = ::r[i], iter = 50; for (; iter--;) { f80 m = (l+r)/2, ok = 1; for (int j = i-1; ok && j >= 0; --j) { f80 A = 1L * x[i] * x[i] + 1L * x[j] * x[j] - 2L * x[i] * x[j] - 4L * rr[j] * m; if (A < 0) ok = 0; } if (ok) l = m; else r = m; } rr[i] = l; if (rr[i] >= ::rr[i-1]) st = i; } cout << fixed << setprecision(3); for (int i = 0; i < n; ++i) cout << rr[i] << '\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | 10 numbers |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | 2 numbers |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 2396 KB | 505 numbers |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 146 ms | 2512 KB | 2000 numbers |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2066 ms | 2780 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2071 ms | 2644 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2027 ms | 2664 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2045 ms | 2684 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2040 ms | 3080 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2066 ms | 3472 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |