oj.uz

Submission #154992

# Submission time Handle Problem Language Result Execution time Memory
154992 2019-09-25T19:31:38 Z popovicirobert Candies (JOI18_candies) C++14
100 / 100
 371 ms 19632 KB 
#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.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 508 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 504 KB Output is correct

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 508 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 303 ms 19484 KB Output is correct
22 Correct 371 ms 19420 KB Output is correct
23 Correct 327 ms 19552 KB Output is correct
24 Correct 162 ms 19376 KB Output is correct
25 Correct 154 ms 19320 KB Output is correct
26 Correct 149 ms 19420 KB Output is correct
27 Correct 157 ms 19448 KB Output is correct
28 Correct 160 ms 19448 KB Output is correct
29 Correct 165 ms 19436 KB Output is correct
30 Correct 167 ms 19448 KB Output is correct
31 Correct 169 ms 19448 KB Output is correct
32 Correct 164 ms 19448 KB Output is correct
33 Correct 201 ms 19336 KB Output is correct
34 Correct 207 ms 19248 KB Output is correct
35 Correct 238 ms 19396 KB Output is correct
36 Correct 324 ms 19472 KB Output is correct
37 Correct 313 ms 19632 KB Output is correct
38 Correct 290 ms 19576 KB Output is correct
39 Correct 151 ms 19320 KB Output is correct
40 Correct 155 ms 19380 KB Output is correct
41 Correct 149 ms 19444 KB Output is correct
42 Correct 160 ms 19532 KB Output is correct
43 Correct 160 ms 19516 KB Output is correct
44 Correct 160 ms 19448 KB Output is correct
45 Correct 165 ms 19524 KB Output is correct
46 Correct 166 ms 19576 KB Output is correct
47 Correct 166 ms 19548 KB Output is correct
48 Correct 218 ms 19292 KB Output is correct
49 Correct 211 ms 19292 KB Output is correct
50 Correct 211 ms 19292 KB Output is correct