Submission #484246

#TimeUsernameProblemLanguageResultExecution timeMemory
484246OlympiaBalloons (CEOI11_bal)C++17
40 / 100
2087 ms4384 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];
    }
    set<int> indices = {0};
    for (int i = 1; i < n; i++) {
        for (int j: indices) {
            double val = ((x[i] - x[j]) * (x[i] - x[j]))/(4.0 * r[j]);
            r[i] = min(r[i], val);
        }
        indices.insert(i);
        for (int j: indices) {
            if (j != i) {
                if (x[j] >= x[i] && r[j] <= r[i]) {
                    indices.erase(j);
                }
            }
        }
    }
    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...