oj.uz

Submission #700921

# Submission time Handle Problem Language Result Execution time Memory
700921 2023-02-19T12:20:13 Z urosk Candies (JOI18_candies) C++14
0 / 100
 5000 ms 187108 KB 
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
#define maxn 200005
ll n;
ll a[maxn],b[maxn];
bool ok[maxn];
bool cmp(pair<ll,pll> x,pair<ll,pll> y){return x.fi<y.fi;}
void tc(){
    cin >> n;
    for(ll i = 1;i<=n;i++) cin >> a[i];
    for(ll i = 2;i<=n+1;i++) b[i] = b[i-1] + a[i-1];
    priority_queue<pair<ll,pll>,vector<pair<ll,pll> >,decltype(&cmp) > pq(cmp);
    for(ll i = 1;i<=n;i++) pq.push({b[i+1]-b[i],{i,i+1}});
    ll cnt = 0,ans = 0;
    while(sz(pq)&&cnt<(n+1)/2){
        pair<ll,pll> p = pq.top();
        pq.pop();
        ll l = p.sc.fi,r = p.sc.sc,x = p.fi;
        if(ok[l]||ok[r]) continue;
        ok[l] = 1,ok[r] = 1;
        ans+=x;
        if(l!=1&&r!=n+1) pq.push({b[r+1]-b[l-1]-2*x,{l-1,r+1}});
        if(r!=n+1) pq.push({b[r+1]-b[l]-2*x,{l,r+1}});
        if(l!=1) pq.push({b[r]-b[l-1]-2*x,{l-1,r}});
        cnt++;
        cout<<ans<<endl;
    }
    if(cnt!=n/2){
        while(1) here;
    }
    if((n&1)&&cnt!=(n+1)/2){
        ans = 0;
        for(ll i = 1;i<=n;i+=2) ans+=a[i];
        cout<<ans<<endl;
    }
}
int main(){
	daj_mi_malo_vremena
    int t; t = 1;
    while(t--){
        tc();
    }
	return 0;
}
/**
5
3 5 1 7 6

8
11 5 3 6 14 10 9 10

20
623239331
125587558
908010226
866053126
389255266
859393857
596640443
60521559
11284043
930138174
936349374
810093502
521142682
918991183
743833745
739411636
276010057
577098544
551216812
816623724
**/

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5017 ms 187108 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5017 ms 187108 KB Time limit exceeded
2 Halted 0 ms 0 KB -