제출 #1344549

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1344549		jingca2012	Balloons (CEOI11_bal)	C++20	100 / 100	126 ms	6572 KiB

bal

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

int main() {
    size_t N; cin >> N;
    vector<double> x(N);
    vector<double> r(N);
    for (size_t i=0; i<N; ++i){
        cin >> x[i] >> r[i];
    }
    stack<pair<double, size_t>> balloons;
    // if curr doesn't touch 
    vector<double> ans(N);
    for (size_t i=0; i<N; ++i){
        double maxR = r[i];
        while (!balloons.empty()){
            auto& [rj, j] = balloons.top();
            double R = (x[i]-x[j])*(x[i]-x[j]) / (4.0 * rj);
            maxR = min(maxR, R);
            if (maxR >= rj) {
                balloons.pop();
            } else {
                // maxR < rj
                break;
            }
        }
        balloons.push({maxR, i});
        ans[i] = maxR;
    }
    cout << fixed << setprecision(3);
    for (const auto& r: ans)
        cout << r << "\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