Submission #768966

#	Time	Username	Problem	Language	Result	Execution time	Memory
768966		bachhoangxuan	Candies (JOI18_candies)	C++17	100 / 100	97 ms	13392 KiB

candies

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,ans=0;cin >> n;
    vector<int> a(n+2),l(n+2),r(n+2);
    a[0]=a[n+1]=-inf;
    priority_queue<piii> pq;
    for(int i=0;i<=n+1;i++){
        if(i>=1 && i<=n) cin >> a[i];
        l[i]=r[i]=i;pq.push({a[i],{l[i],r[i]}});
    }
    for(int i=1;i<=(n+1)/2;i++){
        while(!pq.empty()){
            int lt=pq.top().se.fi,rt=pq.top().se.se;
            if(l[lt]!=rt || r[rt]!=lt) pq.pop();
            else break;
        }
        piii x=pq.top();pq.pop();
        int lt=x.se.fi,rt=x.se.se;ans+=x.fi;
        cout << ans << '\n';
        int nl=r[lt-1],nr=l[rt+1];
        l[lt]=r[rt]=r[lt-1]=l[rt+1]=-1;
        l[nl]=nr;r[nr]=nl;a[nl]+=a[rt+1]-a[lt];
        pq.push({a[nl],{nl,nr}});
    }
}
signed main(){
    //freopen("candies.inp","r",stdin);
    //freopen("candies.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• Subtask 1: 8 / 8
• Subtask 2: 92 / 92