Submission #484265

#	Time	Username	Problem	Language	Result	Execution time	Memory
484265		Olympia	Balloons (CEOI11_bal)	C++17	100 / 100	266 ms	13932 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];
    }
    stack<int> indices;
    indices.push(0);
    for (int i = 1; i < n; i++) {
        while(!indices.empty()) {
            int j = indices.top();
            double val = ((x[i] - x[j]) * (x[i] - x[j])) / (4.0 * r[j]);
            r[i] = min(r[i], val);
            if (r[i] >= r[j]) {
                indices.pop();
            } else {
                break;
            }
        }
        indices.push(i);
    }
    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: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10