Submission #653868

#TimeUsernameProblemLanguageResultExecution timeMemory
653868zxcvbnmBalloons (CEOI11_bal)C++14
0 / 100
138 ms3432 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> x(n), r(n); for(int i = 0; i < n; i++) { cin >> x[i] >> r[i]; } stack<int> st; for(int i = 0; i < n; i++) { double curr = r[i]; while(!st.empty()) { int idx = st.top(); curr = min(curr, (double) ((x[i] - x[idx]) * (x[i] - x[idx])) / (4.00 * r[idx])); if (r[idx] <= r[i]) { st.pop(); } else { break; } } st.push(i); cout << fixed << setprecision(3) << curr << "\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...