제출 #1317390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1317390		RgZg_LnEn	Balloons (CEOI11_bal)	C++20	100 / 100	127 ms	9740 KiB

bal

//UPDATERA ARRAY STORLEKEN!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
const ll INF=1e15;
const ll MAXN=200006;//UPDATERA ARRAY STORLEKEN!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
ll n;
double ans[MAXN];

struct node{
    double x,r;
}lst[MAXN];

stack<ll> S;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>lst[i].x>>lst[i].r;
        ans[i]=lst[i].r;
    }
    cout<<setprecision(20);

    for(int i=1;i<=n;i++){
        while(!S.empty()){
            ans[i]=min((lst[S.top()].x-lst[i].x)*(lst[S.top()].x-lst[i].x)/(4.0*ans[S.top()]),ans[i]);
            if(ans[i]>=ans[S.top()]){
                S.pop();
            }else break;
        }
        S.push(i);
        cout<<ans[i]<<'\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