Submission #414527

#TimeUsernameProblemLanguageResultExecution timeMemory
414527fahimcp495Balloons (CEOI11_bal)C++17
10 / 100
207 ms7712 KiB
#include<bits/stdc++.h> using namespace std; int main(){ ios::sync_with_stdio(0), cin.tie(0); int n; cin >> n; int x[n], r[n]; for (int i = 0; i < n; ++i){ cin >> x[i] >> r[i]; } stack<int> st; double rr[n]; for (int i = 0; i < n; ++i){ while (!st.empty()) { int dx = x[i]-x[st.top()]; rr[i] = min(1.0*r[i], 1ll*dx*dx/(4*rr[st.top()])); if (rr[i] >= rr[st.top()]) { st.pop(); } else break; } if (st.empty()) rr[i] = r[i]; else { int dx = x[i]-x[st.top()]; rr[i] = min(1.0*r[i], 1ll*dx*dx/(4*rr[st.top()])); } st.push(i); } cout << fixed << setprecision(3); for (int i = 0; i < n; ++i){ cout << rr[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...