Submission #1186796

#TimeUsernameProblemLanguageResultExecution timeMemory
1186796njoopBalloons (CEOI11_bal)C++20
0 / 100
620 ms10704 KiB
#include <bits/stdc++.h> using namespace std; stack<pair<int, double>> s; int n, x, r; int main() { cin.tie(0)->sync_with_stdio(0); cin >> n; for(int i=1; i<=n; i++) { cin >> x >> r; double cr = r; bool cnt=1; while(s.size() && cnt) { int nx = s.top().first; double nr = s.top().second; cr = min(cr, (x-nx)*(x-nx)/(4*nr)); if(nr > r) { cnt = 0; } else { s.pop(); } } s.push({x, cr}); cout << fixed << setprecision(3) << cr << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...