Submission #1116632

#TimeUsernameProblemLanguageResultExecution timeMemory
1116632pemguimnBalloons (CEOI11_bal)C++17
50 / 100
109 ms8264 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, x[N], r[N]; long double ans[N]; long double calc(int i, int j){ double x1 = x[i], y1 = ans[i]; double x2 = x[j]; return (x1 * x1 + x2 * x2 - 2 * x1 * x2 ) / (4 * y1); } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 1; i <= n; i++){ cin >> x[i] >> r[i]; ans[i] = r[i]; } stack<int> st; for(int i = 1; i <= n; i++){ long double reach = r[i]; while(st.size()){ reach = min(reach, calc(st.top(), i)); if(reach < ans[st.top()]) break; st.pop(); } ans[i] = reach; st.push(i); } for(int i = 1; i <= n; i++) cout << setprecision(3) << fixed << ans[i] << "\n"; return 0; }
#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...