Submission #1215676

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215676		rkgena	Balloons (CEOI11_bal)	C++20	10 / 100	93 ms	8260 KiB

bal

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define lli long long int
#define pb push_back
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repp(i,a,b) for(int i=a;i>=b;i--)
#define vi vector<lli>
#define vvi vector<vi>
#define vpi vector<pair<lli,lli>>
#define pi pair<lli,lli>
#define msi multiset<lli>
#define mspi multiset<pair<lli,lli>>
#define mii map<lli,lli>
#define mpi map<pair<lli,lli>,lli>
#define si set<lli>
#define spi set<pair<lli,lli>>
#define qi queue<lli>
#define pqi priority_queue<lli>
#define pqimin priority_queue<lli,vi,greater<lli>>
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T1, class T2> using ordered_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
void solve() {
    lli n;
    cin>>n;

    vpi a(n);
    rep(i,0,n-1){
        cin>>a[i].first>>a[i].second;
    }

    vector<long double> radius(n);
    radius[0] = (a[0].second*1.0);
    stack<pair<lli, long double>> data;

    data.push({a[0].first, 1.0*a[0].second});

    cout<<fixed<<setprecision(3)<<radius[0]<<" ";

    rep(i,1,n-1){
        while(!data.empty()){
            pi maxdata = data.top();
            long double radii = (a[i].first - maxdata.first)*(a[i].first - maxdata.first);
            radii = (radii)/(4.0 * maxdata.second);
            radius[i] = min(radii, (long double)a[i].second);
            
            if(radius[i] >= maxdata.second){
                data.pop();
            }
            else{
                break;
            }
        }
        data.push({a[i].first, radius[i]});
        cout<<fixed<<setprecision(3)<<radius[i]<<" ";
    }cout<<"\n";

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

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