제출 #671007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671007		a_aguilo	Balloons (CEOI11_bal)	C++14	20 / 100	514 ms	12468 KiB

bal

#include<bits/stdc++.h>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

int n;

long double Radius(int d, long double r){
    return (long double)(d)*((long double) d/(4*r));
}

int main(){
    cin >> n;
    int lastIdx;
    int position[n];
    long double radius[n];
    vector<pair<int, long double>> MyStack;
    cin >> position[0] >> radius[0];
    MyStack.push_back({position[0], radius[0]});
    for(int i = 1; i < n; ++i){
        cin >> position[i] >> radius[i];
        while((MyStack.size() > 1)){
            lastIdx = MyStack.size()-1;
            long double LastRad = Radius(position[i] - MyStack[lastIdx].first, MyStack[lastIdx].second);
            long double PrevRad = Radius(position[i] - MyStack[lastIdx-1].first, MyStack[lastIdx-1].second);
            if (radius[i] < min(LastRad, PrevRad)) break;
            if(LastRad > PrevRad) MyStack.pop_back();
            else break;
        }
        lastIdx = MyStack.size()-1;
        long double finalRad = Radius(position[i] - MyStack[lastIdx].first, MyStack[lastIdx].second);
        radius[i] = min(radius[i], finalRad);
        MyStack.push_back({position[i], radius[i]});
    }
    for(int i = 0; i < n; ++i) cout << fixed << radius[i] << endl;
    return 0;
}

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