제출 #1314311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1314311		kingboy	Balloons (CEOI11_bal)	C++20	30 / 100	329 ms	1540 KiB

bal

#include <iostream>
#include <stack>

using namespace std;

int main() {
    int n;
    cin >> n;
    stack<pair<double, double>> st;
    for (int x=0;x<n;x++) {
        double xpos, maxRadius;
        cin >> xpos >> maxRadius;

        while (!st.empty()) {
            double maxAllowableRadius = (xpos-st.top().first) * (xpos-st.top().first) / (4*st.top().second);
            if (maxAllowableRadius <= maxRadius) {
                maxRadius = maxAllowableRadius;
            }

            // covers previous balloon
            if (maxRadius >= st.top().second) {
                st.pop();
            } else {
                break;
            }
        }
        cout << maxRadius << endl;
        st.push({xpos, maxRadius});
    }
}

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