제출 #1281204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281204		minhphan	Balloons (CEOI11_bal)	C++20	30 / 100	178 ms	5084 KiB

bal

#include <bits/stdc++.h>

using namespace std;

long double calcRadius(const pair<long double, long double> &a, const long double bx) {
    const long double dx = bx-a.first;
    return dx*dx/(4*a.second);
}

int main() {

    int n;
    cin >> n;

    stack<pair<long double, long double>> stack;

    vector<long double> finalRadius(n);

    for (int i = 0; i<n; i++) {
        long double x, r;
        cin >> x >> r;

        long double maxR = r;

        while (!stack.empty()) {
            pair<long double, long double> last = stack.top();
            long double radius = calcRadius(last, x);

            maxR = min(maxR, radius);

            if (radius >= last.second) {
                stack.pop();
                continue;
            }

            break;
        }

        stack.emplace(x, maxR);
        finalRadius[i] = maxR;
    }

    cout << fixed << setprecision(3);

    for (int i = 0; i<n; i++) {
        cout << finalRadius[i] << "\n";
    }

    return 0;
}

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