Submission #1059672

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059672		Mazhavil	Balloons (CEOI11_bal)	C++17	30 / 100	152 ms	7512 KiB

bal

#include<bits/stdc++.h>
using namespace std;

void solve(){
   int n;cin>>n;
   vector<int>x(n), limit(n);
   for(int i=0;i<n;i++)cin>>x[i]>>limit[i];

   vector<double>radius(n);
   stack<int>st;

   for(int i=0;i<n;i++){
    double val_i = 1.0*limit[i];

    while(!st.empty()){ 
        // just touching the balloon;
        double curr = 1.0*(x[i]-x[st.top()])*(x[i]-x[st.top()])/(4*radius[st.top()]);

        if(curr < val_i){            
            val_i = curr;            
        }

        if(val_i >= radius[st.top()]){
              st.pop();  
        }else{
            break;
        }
    }

    st.push(i);
    radius[i]=val_i;
   }

   for(int i=0;i<n;i++)cout<<radius[i]<<" ";
   cout<<endl;
}

int main(){
    int tt=1;
    //cin>>tt;
    while(tt--){
        solve();
    }
    return 0;
}

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