Submission #154992

#	Time	Username	Problem	Language	Result	Execution time	Memory
154992		popovicirobert	Candies (JOI18_candies)	C++14	100 / 100	371 ms	19632 KiB

candies

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



#if 0
const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}
#endif

#if 0
int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif

using namespace std;

const ll INF = 1e18;


int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;

    vector <ll> a(n + 2);
    vector <int> l(n + 2), r(n + 2);
    multiset < pair <ll, int> > mst;

    for(i = 1; i <= n; i++) {
        cin >> a[i];
        l[i] = i - 1, r[i] = i + 1;
        mst.insert({-a[i], i});
    }

    a[0] = a[n + 1] = -INF;
    r[0] = 1; l[n + 1] = n;
    mst.insert({-a[0], 0}); mst.insert({-a[n + 1], n + 1});

    vector <bool> vis(n + 2);

    ll ans = 0;
    for(i = 1; i <= (n + 1) / 2; i++) {

        while(1) {
            auto cur = mst.begin();
            if(vis[cur -> second]) {
                mst.erase(cur);
                continue;
            }
            break;
        }

        ll val;
        int id;
        tie(val, id) = *mst.begin();
        //cerr << val << " " << id << "\n";
        mst.erase(mst.begin());

        ans -= val;

        a[id] = a[l[id]] + a[r[id]] - a[id];
        mst.insert({-a[id], id});

        vis[l[id]] = vis[r[id]] = 1;
        l[id] = l[l[id]], r[id] = r[r[id]];
        r[l[id]] = id, l[r[id]] = id;

        cout << ans << "\n";
    }

    return 0;
}

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