제출 #630651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
630651		Iwanttobreakfree	Balloons (CEOI11_bal)	C++17	100 / 100	583 ms	6872 KiB

bal

#include <iostream>
#include <vector>
#include <stack>
#include <iomanip>
using namespace std;
const long double EPS=1e-9;
long double dist(int x,long double r1,int y){
    return (long double)(x-y)*(x-y)/(4*r1);
}
int main(){
    int n,x;
    long double r;
    cin>>n;
    stack<pair<int,long double>> st;
    for(int i=0;i<n;i++){
        cin>>x>>r;
        while(st.size()){
            long double ok=dist(st.top().first,st.top().second,x);
            r=min(r,ok);
            if(r>=st.top().second)st.pop();
            else break;
            //cout<<st.size()<<'\n';
        }
        st.push({x,r});
        cout<<fixed<<setprecision(10)<<r<<'\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