Submission #485121

#TimeUsernameProblemLanguageResultExecution timeMemory
485121dz001Balloons (CEOI11_bal)C++11
100 / 100
216 ms6624 KiB
#include <bits/stdc++.h> using namespace std; #define sqr(x) (x)*(x) const double eps=1e-3; const int N=2e5+10; stack<int> st; double ans[N],x[N],R[N]; int n; signed main() { ios::sync_with_stdio(NULL); cin.tie(nullptr); cout.precision(3); cout<<fixed; cin>>n; for(int i=0;i<n;++i)cin>>x[i]>>R[i],ans[i]=R[i]; st.push(0); for(int i=1;i<n;++i){ while(!st.empty()){ ans[i]=min(ans[i],sqr(x[i]-x[st.top()])/(4.*ans[st.top()])); if(ans[i]-ans[st.top()]>=eps)st.pop(); else break; } st.push(i); } for(int i=0;i<n;++i)cout<<ans[i]<<'\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...