# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890724 | 2023-12-21T19:45:21 Z | TimAni | Balloons (CEOI11_bal) | C++17 | 2000 ms | 7776 KB |
#include <algorithm> #include <cassert> #include <cstdio> #include <iostream> #include <string> #include <vector> #include <set> #include <map> #include <numeric> #include <stack> #include <queue> #include <cmath> #include <array> #include <iomanip> using namespace std; void setIO(string File_name) { cin.tie(0)->sync_with_stdio(0); if (File_name.size()) { freopen((File_name + ".in").c_str(), "r", stdin); freopen((File_name + ".out").c_str(), "w", stdout); } } const long double eps = 1e-9; void sol() { int n; cin >> n; vector<pair<int, int>> v(n); for(int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; deque<int> mono; vector<long double> ans(n); auto radius = [&](int curr, int prev) -> long double { long double r = 1.0 * (v[curr].first - v[prev].first) * ((v[curr].first - v[prev].first)) / (4 * v[prev].second); return r; }; auto intersect = [&](int curr, int prev) { long double y = radius(curr, prev); if(v[curr].second >= y) return 1; return 0; }; for(int i = 0; i < n; i++){ ans[i] = v[i].second; for(int j = i - 1; j >= 0; j--){ if(intersect(i, j)){ ans[i] = min(ans[i], radius(i, j)); } } } for(auto el : ans){ cout << fixed << setprecision(6) << el << ' '; } } int main() { setIO(""); int T = 1; //cin >> T; while (T--) sol(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | 5th numbers differ - expected: '17.1630000000', found: '4.3706900000', error = '12.7923100000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | 2 numbers |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | 5th numbers differ - expected: '0.1170000000', found: '0.0833330000', error = '0.0336670000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 348 KB | 3rd numbers differ - expected: '121.0000000000', found: '120.0182930000', error = '0.9817070000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 381 ms | 1360 KB | 3rd numbers differ - expected: '211.0000000000', found: '210.0105630000', error = '0.9894370000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2050 ms | 2140 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2045 ms | 4184 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2061 ms | 4696 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2057 ms | 6236 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2033 ms | 7776 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |