제출 #683586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683586		NONTAC	Balloons (CEOI11_bal)	C++11	100 / 100	287 ms	11724 KiB

bal

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

typedef pair<long double, long double> ll;
const int MAX_N = 200000;

int n;
long double x[MAX_N + 1], r[MAX_N + 1];
long double r_al[MAX_N + 1];
stack<ll> s;

long double expected_val(long double x1, long double r1, long double x2)
{
    return (x1 - x2) * (x1 - x2) / (4.0 * r1);
}

int main()
{
    //freopen("test.in","r",stdin);
    //freopen("test.out","w",stdout);

    cin>>n;

    for(int i = 0; i < n; i++){
        cin>>x[i]>>r[i];
    }

    for(int i = 0; i < n; i++){
        long double tmp = r[i];
        while(!s.empty()){
            tmp = min(tmp, expected_val(s.top().first, s.top().second, x[i]));
            if(tmp >= s.top().second){
                s.pop();
                continue;
            }
            else break;
        }

        if(!s.empty()) tmp = min(tmp, expected_val(s.top().first, s.top().second, x[i]));
        s.push(ll(x[i], tmp));
        printf("%.3Lf\n", tmp);
    }


    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