Submission #484255

#TimeUsernameProblemLanguageResultExecution timeMemory
484255OlympiaBalloons (CEOI11_bal)C++17
50 / 100
2086 ms4240 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]);
            if (r[j] >= myMax) {
                new_indices.push_back(-j);
            } else {
                break;
            }
            r[i] = min(r[i], val);
        }
        new_indices.push_back(-i);
        indices = new_indices;
    }
    for (double d: r) {
        cout << setprecision(30) << 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...