oj.uz

Submission #580504

# Submission time Handle Problem Language Result Execution time Memory
580504 2022-06-21T11:09:30 Z islingr Fireworks (APIO16_fireworks) C++17
100 / 100
 158 ms 39480 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include "bits/stdc++.h"

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a);)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) static_cast<int>((x).size())

template <class T>
bool uin(T& a, const T& b) {
    return a > b ? a = b, true : false;
}
template <class T>
bool uax(T& a, const T& b) {
    return a < b ? a = b, true : false;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    swap(n, m);
    n += m;

    vector<int> p(n), c(n);
    rep(i, 1, n) {
        cin >> p[i] >> c[i];
        --p[i];
    }

    struct node {
        int a;
        ll b;
        priority_queue<ll> q;
        node() : a{0}, b{0} {}
        node(int x) : a{1}, b{-x}, q{{}, {x, x}} {}
        void merge(node& o) {
            a += o.a;
            b += o.b;
            if (sz(q) < sz(o.q)) swap(q, o.q);
            while (!o.q.empty()) {
                q.push(o.q.top());
                o.q.pop();
            }
        }
    };

    vector<node> data(n);
    per(i, m, n) {
        data[i] = node(c[i]);
        data[p[i]].merge(data[i]);
    }

    per(i, 1, m) {
        const auto x = c[i];
        auto& [a, b, q] = data[i];
        while (a > 1) {
            --a;
            b += q.top();
            q.pop();
        }
        const auto one = q.top();
        q.pop();
        const auto zero = q.top();
        q.pop();
        q.push(one + x);
        q.push(zero + x);
        b -= x;
        data[p[i]].merge(data[i]);
    }

    auto& [a, b, q] = data[0];
    while (a > 0) {
        --a;
        b += q.top();
        q.pop();
    }
    cout << b << '\n';
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
19.0 / 19.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 3 ms 724 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 744 KB Output is correct
46 Correct 3 ms 852 KB Output is correct
47 Correct 3 ms 980 KB Output is correct
48 Correct 3 ms 852 KB Output is correct
49 Correct 3 ms 852 KB Output is correct
50 Correct 2 ms 724 KB Output is correct
51 Correct 3 ms 724 KB Output is correct
52 Correct 2 ms 852 KB Output is correct
53 Correct 2 ms 852 KB Output is correct
54 Correct 2 ms 852 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 3 ms 724 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 744 KB Output is correct
46 Correct 3 ms 852 KB Output is correct
47 Correct 3 ms 980 KB Output is correct
48 Correct 3 ms 852 KB Output is correct
49 Correct 3 ms 852 KB Output is correct
50 Correct 2 ms 724 KB Output is correct
51 Correct 3 ms 724 KB Output is correct
52 Correct 2 ms 852 KB Output is correct
53 Correct 2 ms 852 KB Output is correct
54 Correct 2 ms 852 KB Output is correct
55 Correct 5 ms 1492 KB Output is correct
56 Correct 19 ms 4956 KB Output is correct
57 Correct 34 ms 8000 KB Output is correct
58 Correct 44 ms 10252 KB Output is correct
59 Correct 65 ms 13432 KB Output is correct
60 Correct 91 ms 16488 KB Output is correct
61 Correct 96 ms 19196 KB Output is correct
62 Correct 95 ms 20956 KB Output is correct
63 Correct 137 ms 24752 KB Output is correct
64 Correct 150 ms 26028 KB Output is correct
65 Correct 87 ms 16624 KB Output is correct
66 Correct 67 ms 16632 KB Output is correct
67 Correct 66 ms 16748 KB Output is correct
68 Correct 128 ms 23520 KB Output is correct
69 Correct 130 ms 24368 KB Output is correct
70 Correct 123 ms 24160 KB Output is correct
71 Correct 158 ms 39356 KB Output is correct
72 Correct 157 ms 39480 KB Output is correct
73 Correct 128 ms 36212 KB Output is correct
74 Correct 140 ms 36820 KB Output is correct
75 Correct 135 ms 35392 KB Output is correct
76 Correct 133 ms 35288 KB Output is correct
77 Correct 155 ms 34344 KB Output is correct
78 Correct 144 ms 34084 KB Output is correct
79 Correct 128 ms 33120 KB Output is correct