oj.uz

Submission #415533

# Submission time Handle Problem Language Result Execution time Memory
415533 2021-06-01T08:12:29 Z Aldas25 Fireworks (APIO16_fireworks) C++14
100 / 100
 336 ms 68840 KB 
#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;

const int MAXN = 300100, MAXK = 30;
//const ll MOD = 998244353;
const ll INF = 4e18;
const ld PI = asin(1) * 2;

priority_queue<ll> q[MAXN];
int p[MAXN];
ll c[MAXN];
vi adj[MAXN];
int n, m;

void print (int i) {
    cout << " queue i=" << i << ": ";
    priority_queue<ll> tmp;
    while (!q[i].empty()) {
        ll x = q[i].top();
        q[i].pop();
        tmp.push(x);
        cout << " " << x;
    }
    while (!tmp.empty()) {
        ll x = tmp.top();
        tmp.pop();
        q[i].push(x);
        //cout << " " << x;
    }
    cout << endl;
}

void dfs (int v) {
   // cout << " v = " << v << endl;
    if (n+1 <= v) {
        REP(2) q[v].push(c[v]);
        //print(v);
        return;
    }
    for (int u : adj[v]) {
        dfs(u);

        if ((int)q[u].size() > (int)q[v].size()) swap(q[u], q[v]);
        while (!q[u].empty()) {
            q[v].push(q[u].top());
            q[u].pop();
        }
    }

    int sz = (int)adj[v].size();
    REP(sz-1) q[v].pop();
    ll fr, to;
    to = q[v].top();
    q[v].pop();
    fr = q[v].top();
    q[v].pop();
    q[v].push(fr+c[v]);
    q[v].push(to+c[v]);


   // print(v);
}

int main()
{
    FAST_IO;

    cin >> n >> m;
    FOR(i, 2, n+m) {
        cin >> p[i] >> c[i];
        adj[p[i]].pb(i);
    }

    /*FOR(i, 1, n+m) {
        cout << "    i = " << i << "  adj: ";
        for (int x : adj[i]) cout << x << " ";
        cout << endl;
    }*/

    dfs (1);

    ll cur = 0;
    FOR(i, 1, n+m) cur += c[i];
    q[1].pop();
    while (!q[1].empty()) {
        cur -= q[1].top();
        q[1].pop();
    }

    cout << cur << "\n";


    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16716 KB Output is correct
2 Correct 12 ms 16716 KB Output is correct
3 Correct 11 ms 16716 KB Output is correct
4 Correct 14 ms 16780 KB Output is correct
5 Correct 12 ms 16716 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 13 ms 16752 KB Output is correct
8 Correct 12 ms 16716 KB Output is correct
9 Correct 12 ms 16716 KB Output is correct
10 Correct 13 ms 16716 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16716 KB Output is correct
2 Correct 13 ms 16716 KB Output is correct
3 Correct 15 ms 16716 KB Output is correct
4 Correct 13 ms 16716 KB Output is correct
5 Correct 13 ms 16716 KB Output is correct
6 Correct 13 ms 16772 KB Output is correct
7 Correct 12 ms 16724 KB Output is correct
8 Correct 13 ms 16736 KB Output is correct
9 Correct 13 ms 16716 KB Output is correct
10 Correct 16 ms 16752 KB Output is correct
11 Correct 14 ms 16684 KB Output is correct
12 Correct 13 ms 16716 KB Output is correct
13 Correct 16 ms 16728 KB Output is correct
14 Correct 15 ms 16716 KB Output is correct
15 Correct 15 ms 16716 KB Output is correct
16 Correct 13 ms 16716 KB Output is correct
17 Correct 13 ms 16792 KB Output is correct
18 Correct 13 ms 16768 KB Output is correct
19 Correct 13 ms 16796 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16716 KB Output is correct
2 Correct 12 ms 16716 KB Output is correct
3 Correct 11 ms 16716 KB Output is correct
4 Correct 14 ms 16780 KB Output is correct
5 Correct 12 ms 16716 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 13 ms 16752 KB Output is correct
8 Correct 12 ms 16716 KB Output is correct
9 Correct 12 ms 16716 KB Output is correct
10 Correct 13 ms 16716 KB Output is correct
11 Correct 14 ms 16716 KB Output is correct
12 Correct 13 ms 16716 KB Output is correct
13 Correct 15 ms 16716 KB Output is correct
14 Correct 13 ms 16716 KB Output is correct
15 Correct 13 ms 16716 KB Output is correct
16 Correct 13 ms 16772 KB Output is correct
17 Correct 12 ms 16724 KB Output is correct
18 Correct 13 ms 16736 KB Output is correct
19 Correct 13 ms 16716 KB Output is correct
20 Correct 16 ms 16752 KB Output is correct
21 Correct 14 ms 16684 KB Output is correct
22 Correct 13 ms 16716 KB Output is correct
23 Correct 16 ms 16728 KB Output is correct
24 Correct 15 ms 16716 KB Output is correct
25 Correct 15 ms 16716 KB Output is correct
26 Correct 13 ms 16716 KB Output is correct
27 Correct 13 ms 16792 KB Output is correct
28 Correct 13 ms 16768 KB Output is correct
29 Correct 13 ms 16796 KB Output is correct
30 Correct 11 ms 16712 KB Output is correct
31 Correct 16 ms 16772 KB Output is correct
32 Correct 14 ms 16884 KB Output is correct
33 Correct 15 ms 16900 KB Output is correct
34 Correct 16 ms 16960 KB Output is correct
35 Correct 18 ms 16972 KB Output is correct
36 Correct 16 ms 16972 KB Output is correct
37 Correct 19 ms 17100 KB Output is correct
38 Correct 17 ms 17100 KB Output is correct
39 Correct 17 ms 17096 KB Output is correct
40 Correct 13 ms 17612 KB Output is correct
41 Correct 13 ms 17612 KB Output is correct
42 Correct 13 ms 17032 KB Output is correct
43 Correct 15 ms 17296 KB Output is correct
44 Correct 14 ms 17284 KB Output is correct
45 Correct 15 ms 17184 KB Output is correct
46 Correct 15 ms 17224 KB Output is correct
47 Correct 17 ms 17228 KB Output is correct
48 Correct 17 ms 17112 KB Output is correct
49 Correct 15 ms 17140 KB Output is correct
50 Correct 15 ms 17072 KB Output is correct
51 Correct 14 ms 17036 KB Output is correct
52 Correct 19 ms 17064 KB Output is correct
53 Correct 18 ms 17156 KB Output is correct
54 Correct 16 ms 17128 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16716 KB Output is correct
2 Correct 12 ms 16716 KB Output is correct
3 Correct 11 ms 16716 KB Output is correct
4 Correct 14 ms 16780 KB Output is correct
5 Correct 12 ms 16716 KB Output is correct
6 Correct 12 ms 16736 KB Output is correct
7 Correct 13 ms 16752 KB Output is correct
8 Correct 12 ms 16716 KB Output is correct
9 Correct 12 ms 16716 KB Output is correct
10 Correct 13 ms 16716 KB Output is correct
11 Correct 14 ms 16716 KB Output is correct
12 Correct 13 ms 16716 KB Output is correct
13 Correct 15 ms 16716 KB Output is correct
14 Correct 13 ms 16716 KB Output is correct
15 Correct 13 ms 16716 KB Output is correct
16 Correct 13 ms 16772 KB Output is correct
17 Correct 12 ms 16724 KB Output is correct
18 Correct 13 ms 16736 KB Output is correct
19 Correct 13 ms 16716 KB Output is correct
20 Correct 16 ms 16752 KB Output is correct
21 Correct 14 ms 16684 KB Output is correct
22 Correct 13 ms 16716 KB Output is correct
23 Correct 16 ms 16728 KB Output is correct
24 Correct 15 ms 16716 KB Output is correct
25 Correct 15 ms 16716 KB Output is correct
26 Correct 13 ms 16716 KB Output is correct
27 Correct 13 ms 16792 KB Output is correct
28 Correct 13 ms 16768 KB Output is correct
29 Correct 13 ms 16796 KB Output is correct
30 Correct 11 ms 16712 KB Output is correct
31 Correct 16 ms 16772 KB Output is correct
32 Correct 14 ms 16884 KB Output is correct
33 Correct 15 ms 16900 KB Output is correct
34 Correct 16 ms 16960 KB Output is correct
35 Correct 18 ms 16972 KB Output is correct
36 Correct 16 ms 16972 KB Output is correct
37 Correct 19 ms 17100 KB Output is correct
38 Correct 17 ms 17100 KB Output is correct
39 Correct 17 ms 17096 KB Output is correct
40 Correct 13 ms 17612 KB Output is correct
41 Correct 13 ms 17612 KB Output is correct
42 Correct 13 ms 17032 KB Output is correct
43 Correct 15 ms 17296 KB Output is correct
44 Correct 14 ms 17284 KB Output is correct
45 Correct 15 ms 17184 KB Output is correct
46 Correct 15 ms 17224 KB Output is correct
47 Correct 17 ms 17228 KB Output is correct
48 Correct 17 ms 17112 KB Output is correct
49 Correct 15 ms 17140 KB Output is correct
50 Correct 15 ms 17072 KB Output is correct
51 Correct 14 ms 17036 KB Output is correct
52 Correct 19 ms 17064 KB Output is correct
53 Correct 18 ms 17156 KB Output is correct
54 Correct 16 ms 17128 KB Output is correct
55 Correct 22 ms 17728 KB Output is correct
56 Correct 58 ms 20348 KB Output is correct
57 Correct 94 ms 23036 KB Output is correct
58 Correct 112 ms 24636 KB Output is correct
59 Correct 154 ms 26772 KB Output is correct
60 Correct 205 ms 28772 KB Output is correct
61 Correct 234 ms 30600 KB Output is correct
62 Correct 267 ms 31732 KB Output is correct
63 Correct 329 ms 34172 KB Output is correct
64 Correct 336 ms 34804 KB Output is correct
65 Correct 137 ms 68804 KB Output is correct
66 Correct 164 ms 68840 KB Output is correct
67 Correct 140 ms 31376 KB Output is correct
68 Correct 236 ms 51440 KB Output is correct
69 Correct 238 ms 48308 KB Output is correct
70 Correct 245 ms 48384 KB Output is correct
71 Correct 287 ms 44208 KB Output is correct
72 Correct 251 ms 44648 KB Output is correct
73 Correct 240 ms 41244 KB Output is correct
74 Correct 224 ms 41192 KB Output is correct
75 Correct 238 ms 40388 KB Output is correct
76 Correct 258 ms 40312 KB Output is correct
77 Correct 233 ms 39768 KB Output is correct
78 Correct 240 ms 37820 KB Output is correct
79 Correct 217 ms 39484 KB Output is correct