Submission #1236476

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236476		MinhKien	Balloons (CEOI11_bal)	C++20	100 / 100	121 ms	3464 KiB

bal

#include <iostream>
#include <math.h>
#include <stack>

using namespace std;

struct bb {
    long double x, r;

    bb () {}
    bb (long double X, long double R) {
        x = X;
        r = R;
    }
};

int n;
bb k;
stack <bb> st, tmp;

long double dis(bb A, bb B) {
    return sqrt((A.x - B.x) * (A.x - B.x) + (A.r - B.r) * (A.r - B.r));
}

long double Find(bb kt) {
    return (kt.x - k.x) * (kt.x - k.x) / (4.0 * kt.r);
}

int main() {
    cin.tie(0); cout.tie(0);
    ios_base::sync_with_stdio(false);

    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> k.x >> k.r;

        long double ans = k.r;
        while (!st.empty()) {
            ans = min(ans, Find(st.top()));
            if (ans >= st.top().r) {
                st.pop();
                continue;
            }
            break;
        }

        st.push(bb(k.x, ans));
        printf("%.10Lf\n", ans);
    }

    return 0;
}

• 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