# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988281 | 2024-05-24T12:03:03 Z | hegoplay | Balloons (CEOI11_bal) | C++14 | 89 ms | 6412 KB |
/* - += @@@@@% +@@@@@@+ %@@@@@#% @@@@@@@@=: +****************** =@@@@@@@@@% =***********#*******+ %@@@@@@@@@@@@@@@@@@@@= @@@@@@@@@@% #@@@@@@@@@@@@@@@@@@@@@@ +@@@@@@@@@@@@@@@@@@@@@+ +@@#@@@@@@@@% @@@@@@@@@@@@@@@@@@@@@@@= +@@@@% *@@%@@@@@@@@@= %@@@% @@@@@# *@@@@@@@@@@@@# #@@@@@ %@@@@% +@@@@@@@@@@@@% @@@@@@@@@@@@@@@@@@@@% #@@@@@ =#+@@@@@@@@#@% =@@@@@@@@@@@@@@@@@@@@* +@@@@@+ #@@@@@@% =@@@@@= =@@@@@* #@@@@@@# @@@@@* #@@@@@@@@@@@@@@@@@@@@@ +@@@@@@# *@@@@@@@@@@@@@@@@@@@@@@# +@@@@@@@@@@@@@@@@@@@@= %@@@@@% +@@@@@@@@@@@@@@@@@@@@@@+ +*#************##* =@@@@@#+ ###**##**#*******##*+ =@@@@@@% +** =+= Michael Jackson peeks "Nothing is hard to understand, you just didn't get it." @author: MahK17 */ #include <bits/stdc++.h> #include <set> #include <vector> #include <algorithm> #include <map> #include <queue> #include <stack> #include <cmath> #include <unordered_map> #include <unordered_set> #include <string> #include <sstream> #include <numeric> #include <cstdio> #include <cstring> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define pb push_back #define inf 0x3f3f3f3f3f3f3f3f #define all(x) (x).begin(), (x).end() #define yes cout << "YES\n"; #define no cout << "NO\n"; #define sz(x) (int)(x).size() #define el "\n" typedef long long ll; typedef long double ld; #define int long long using namespace __gnu_pbds; using namespace std; #define indexed_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> void setIO(string name = "") { if (sz(name)) { freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output freopen((name + ".out").c_str(), "w", stdout); } } ld find(ld lb, ld x1, ld x2) { // binary search 4*lb*x = (x1-x2)**2 return (x1 - x2) * (x1 - x2) / (4 * lb); } void solve() { int n; cin >> n; vector<pair<int, int>> a(n); for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; } stack<pair<ld, ld>> s; for (int i = 0; i < n; i++) { ld curSize = a[i].second; while (!s.empty()) { ld x1 = s.top().first; ld x2 = a[i].first; ld lb = s.top().second; ld x = find(lb, x1, x2); if (x < curSize) { s.pop(); curSize = x; } else break; } s.push({a[i].first, curSize}); printf("%.3Lf\n", curSize); } } signed main() { ios ::sync_with_stdio(false); std::cin.tie(nullptr); ll t = 1; // cin >> t; while (t--) solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | 5th numbers differ - expected: '17.1630000000', found: '99.0000000000', error = '81.8370000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | 2 numbers |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | 3rd numbers differ - expected: '0.0420000000', found: '3.0000000000', error = '2.9580000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 344 KB | 114th numbers differ - expected: '39.0180000000', found: '56.0000000000', error = '16.9820000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 856 KB | 196th numbers differ - expected: '100.7250000000', found: '111.0000000000', error = '10.2750000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 23 ms | 1876 KB | 13945th numbers differ - expected: '0.0140000000', found: '7.0000000000', error = '6.9860000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 46 ms | 3412 KB | 7236th numbers differ - expected: '0.0070000000', found: '7.0000000000', error = '6.9930000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 53 ms | 3924 KB | 4645th numbers differ - expected: '0.0260000000', found: '8.0000000000', error = '7.9740000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 73 ms | 4940 KB | 1730th numbers differ - expected: '5.6890000000', found: '6.8060000000', error = '1.1170000000' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 89 ms | 6412 KB | 2716th numbers differ - expected: '22.1690000000', found: '43.0000000000', error = '20.8310000000' |
2 | Halted | 0 ms | 0 KB | - |