Submission #1317372

#	Time	Username	Problem	Language	Result	Execution time	Memory
1317372		RgZg_LnEn	Balloons (CEOI11_bal)	C++20	0 / 100	49 ms	3624 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;
    cout<<setprecision(20);

    for(int i=1;i<=n;i++){
        if(!S.empty()){
            ans[i]=min((lst[S.top()].x-lst[i].x)*(lst[S.top()].x-lst[i].x)/(4*ans[S.top()]),lst[i].r);
            while(!S.empty()&&ans[i]>=ans[S.top()]){
                S.pop();
                ans[i]=min((lst[S.top()].x-lst[i].x)*(lst[S.top()].x-lst[i].x)/(4*ans[S.top()]),ans[i]);
            }
        }else{
            ans[i]=lst[i].r;
        }
        S.push(i);
        
        cout<<ans[i]<<'\n';
    }
}

• 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