Submission #484257

#TimeUsernameProblemLanguageResultExecution timeMemory
484257OlympiaBalloons (CEOI11_bal)C++17
50 / 100
2098 ms4072 KiB
#include <vector> #include <iostream> #include <cassert> #include <cmath> #include <set> #include <map> #include <stack> #include <set> #include <iomanip> #define ll long long using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<double> x(n), r(n); for (int i = 0; i < n; i++) { cin >> x[i] >> r[i]; } vector<int> indices = {0}; for (int i = 1; i < n; i++) { vector<int> new_indices; int myMax = 0; for (int ind: indices) { int j = -ind; double val = ((x[i] - x[j]) * (x[i] - x[j])) / (4.0 * r[j]); r[i] = min(r[i], val); if (r[j] >= myMax) { new_indices.push_back(-j); } else { break; } } new_indices.push_back(-i); indices = new_indices; } for (double d: r) { cout << setprecision(20) << d << "\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...