제출 #206904

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
206904		achibasadzishvili	Candies (JOI18_candies)	C++17	0 / 100	9 ms	632 KiB

candies

#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
ll n,a[200005],ans;
set<pair<ll,ll> >st;
set<ll>ind;
set<pair<ll,ll> >::iterator it;
set<ll>::iterator itt;
int main(){
    ios::sync_with_stdio(false);
    cin >> n;
    
    for(int i=1; i<=n; i++){
        cin >> a[i];
        ind.insert(i);
        st.insert(mp(a[i] , i));
    }
    a[0] = a[n + 1] = -99999999999999;
    ind.insert(0);
    ind.insert(n + 1);
    for(int i=1; i<=(n + 1) / 2; i++){
        it = st.end();
        it--;
        ll val = (*it).f , cur = (*it).s;
        st.erase(it);
        ans += val;
        ind.erase(ind.find(cur));
        itt = ind.upper_bound(cur);
        a[cur] = -a[cur];
        if((*itt) <= n){
            a[cur] += a[(*itt)];
            st.erase(st.find(mp(a[(*itt)] , (*itt))));
            ind.erase(itt);
        }
        itt = ind.upper_bound(cur);
        itt--;
        if((*itt) > 0){
            a[cur] += a[(*itt)];
            st.erase(st.find(mp(a[(*itt)] , (*itt))));
            ind.erase(itt);
        }
        st.insert(mp(a[cur] , cur));
        ind.insert(cur);
        cout << ans << endl;
    }
    
    
    
    
    return 0;
}

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