제출 #1345477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1345477		duonghongducaz	Balloons (CEOI11_bal)	C++20	0 / 100	108 ms	7440 KiB

bal

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<stack>
#include<vector>
using namespace std;
struct Ballon{
    int x;
    double r;
};

void Input(int& n, vector<Ballon>& ballons){
    cin >> n;
    ballons.resize(n);
    for(int i=0;i<n;i++){
        cin >> ballons[i].x >> ballons[i].r;
    }
}

double calculate_r2(int x1, int x2, double r){
    return ((x1-x2)*(x1-x2))/(4*r);
}

void processing(int n, vector<Ballon>& ballons){
    stack<pair<int, double>> s;
    for(int i=0;i<n;i++){
        double current_r = ballons[i].r;
        while(!s.empty()){
            pair<int, double> last_circus = s.top();
            current_r = min(ballons[i].r, calculate_r2(last_circus.first, ballons[i].x, last_circus.second));
            if(current_r>=last_circus.second){
                s.pop();
                continue;
            }
            else{
                break;
            }
        }
        s.push({ballons[i].x, ballons[i].r});
        ballons[i].r = current_r;
    }
    for(int i=0;i<n;i++){
        cout << fixed << setprecision(3) << ballons[i].r << "\n";
    }
}


int main(){
    int n;
    vector<Ballon> ballons;
    Input(n, ballons);
    processing(n, ballons);
    return 0;
}

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