Submission #484254

#	Time	Username	Problem	Language	Result	Execution time	Memory
484254		Olympia	Balloons (CEOI11_bal)	C++17	40 / 100	2100 ms	4072 KiB

bal

#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++) {
        set<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.insert(-j);
                //break;
            } else {
                break;
            }
            r[i] = min(r[i], val);
        }
        new_indices.insert(-i);
        indices = new_indices;
    }
    for (double d: r) {
        cout << setprecision(30) << d << "\n";
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10