제출 #1116642

#제출 시각아이디문제언어결과실행 시간메모리
1116642pemguimnBalloons (CEOI11_bal)C++14
100 / 100
98 ms12356 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; int n, x[N], r[N]; long double ans[N]; inline long double calc(int i, int j){ long double x1 = x[i], y1 = ans[i]; long double x2 = x[j]; return (x1 * x1 + x2 * x2 - 2.0L * x1 * x2) / (4.0L * 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++){ while(st.size()){ ans[i] = min(ans[i], calc(st.top(), i)); if(ans[i] < ans[st.top()]) break; st.pop(); } if(ans[i] > 0.0L) 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...