제출 #602622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602622		leroycut	Balloons (CEOI11_bal)	C++17	100 / 100	230 ms	14900 KiB

bal

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

const ll N = 70000000, mod = 1e9 + 7, inf = 1e18 + 7;


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

    // freopen("forest.in", "r", stdin);
    // freopen("forest.out", "w", stdout);

    int n;
    cin >> n;
    vector<ld> r(n), x(n), ans(n);
    for(int i = 0; i < n; ++i) cin >> x[i] >> r[i];
    stack<pair<ld, ld>> st;
    for(int i = 0; i < n; ++i){
        ld rcur = r[i];
        
        while(!st.empty()){
            ld x1 = st.top().first, r1 = st.top().second;
            rcur = min(rcur, (x[i] - x1) * (x[i] - x1) / (4 * r1));
            if(rcur >= r1){
                st.pop();
            }else{
                break;
            }
        }
        st.push({x[i], rcur});
        ans[i] = rcur;
    }

    for(auto i : ans){
        cout << fixed << setprecision(3) << i << "\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