제출 #868379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868379		noyancanturk	Balloons (CEOI11_bal)	C++17	100 / 100	159 ms	8684 KiB

bal

#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
#endif
#include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
const int lim=2e5+1;
int mod=1e9+7;
using pii=pair<int,int>;

void solve(){
    int n;
    cin>>n;
    double x[n],r[n];
    for(int i=0;i<n;i++){
        cin>>x[i]>>r[i];
    }    
    cout<<fixed<<setprecision(3);
    stack<pair<double,double>>s;
    for(int i=0;i<n;i++){
        double cur=r[i];
        while(s.size()){
            double dist=(x[i]-s.top().second);
            cur=min(dist*dist/(4*s.top().first),cur);
            if(s.top().first<=cur)s.pop();
            else break;
        }
        cout<<cur<<"\n";
        s.push({cur,x[i]});
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#else
    //freopen("dishes.in","r",stdin);
    //freopen("dishes.out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

• 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