제출 #542989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
542989		asdf1234coding	Balloons (CEOI11_bal)	C++14	100 / 100	453 ms	7156 KiB

bal

#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <iomanip>
using namespace std;

#define problemname "balloons"
#define pii pair<int,int>
#define pb push_back
#define MOD (int)1e9+7
#define ll long long
#define ff first
#define ss second

bool ckmin(double& a, double b) {return a>b?a=b,true:false;}
bool ckmax(int& a, int b) {return a<b?a=b,true:false;}

int main () {
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen (problemname ".in", "r", stdin); freopen(problemname ".out", "w", stdout);
    int n; cin>>n;
    stack<pair<int, double>> stacc;
    double x; double r; cin>>x>>r; stacc.push({x,r});
    vector<double> radii;
    radii.push_back(r);
    for(int i=1; i<n; i++) {
        cin>>x>>r;
        while(!stacc.empty()) {
            double topx, topr; topx=stacc.top().ff; topr=stacc.top().ss;
            ckmin(r, (x-topx)*(x-topx)/(4*topr));
            if(r>=topr) {
                stacc.pop();
            } else {
                break;
            }
        }
        stacc.push({x,r});
        radii.push_back(r);
    }

    cout<<fixed<<setprecision(3);

    for (auto x:radii) {
        cout<<x<<endl;
    }

    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