제출 #1285597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285597		srittheboss	Balloons (CEOI11_bal)	C++20	10 / 100	319 ms	14384 KiB

bal

#include "bits/stdc++.h"
using namespace std;


struct Balloon {
    long double r;
    long double x;
    int idx;
};

int main() {
    int n;
    cin >> n;
    vector<Balloon> balloons(n);

    for (int i = 0; i < n; i++) {
        cin >> balloons[i].x;
        cin >> balloons[i].r;
        balloons[i].idx = i;
    }

    stack<Balloon> s;

    s.push(balloons[0]);
    vector<long double> final_r(n);

    for (int i = 1; i < n; i++) {

        while (!s.empty()) {
            long double new_r = (balloons[i].x - s.top().x) * (balloons[i].x - s.top().x) / (4.0 * s.top().r);
            new_r = min(balloons[i].r, new_r);

            if (new_r > s.top().r) {
                final_r[s.top().idx] = s.top().r;
                s.pop();
            } else {
                break;
            }
        }

        if (s.empty()) {
            s.push(balloons[i]);
        } else {
            long double new_r = (balloons[i].x - s.top().x) * (balloons[i].x - s.top().x) / (4.0 * s.top().r);
            s.push({min(new_r, balloons[i].r), balloons[i].x, balloons[i].idx});
        }
    }

    while (!s.empty()) {
        final_r[s.top().idx] = s.top().r;
        s.pop();
    }

    for (int i = 0; i < n; i++) {
        cout << fixed << setprecision(3) <<  final_r[i] << endl;
    }


}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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