Submission #216990

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
216990	2020-03-28T16:24:15 Z	dolphingarlic	Magic Tree (CEOI19_magictree)	C++14	100 / 100	267 ms	25848 KB

magictree

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<ll> graph[101010];
pair<ll, ll> fruit[101010];
ll n, m, k, ans;

void merge(map<ll, ll> &X, map<ll, ll> &Y) {
    if (X.size() < Y.size()) swap(X, Y);
    for (pair<ll, ll> t : Y) X[t.first] += t.second;
}

void dfs(ll p, map<ll, ll> &X) {
    ll s, t, x, y;

    for (ll &t : graph[p]) {
        map<ll, ll> Y;
        dfs(t, Y);
        merge(X, Y);
    }

    if (fruit[p].second) {
        tie(x, y) = fruit[p];
        X[x] += y;

        auto it = next(X.find(x));
        for (s = 0; it != X.end(); it = next(X.find(x))) {
            s += it->second;
            t = it->first;
            X.erase(it);
            if (s > y) {
                X[t] = s - y;
                break;
            }
        }
    }
}

int main() {
    ll i, p, d, w;

    cin >> n >> m >> k;

    for (i = 2; i <= n; i++) {
        cin >> p;
        graph[p].push_back(i);
    }

    for (i = 1; i <= m; i++) {
        cin >> p >> d >> w;
        fruit[p] = pair<ll, ll>(d, w);
    }

    map<ll, ll> X;
    dfs(1, X);

    for (pair<ll, ll> t : X) {
        ans += t.second;
    }

    cout << ans;

    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	118 ms	9056 KB	Output is correct
2	Correct	99 ms	13304 KB	Output is correct
3	Correct	260 ms	12720 KB	Output is correct
4	Correct	191 ms	10860 KB	Output is correct
5	Correct	229 ms	12792 KB	Output is correct

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	2816 KB	Output is correct
2	Correct	7 ms	2816 KB	Output is correct
3	Correct	7 ms	2944 KB	Output is correct
4	Correct	176 ms	21892 KB	Output is correct
5	Correct	197 ms	25848 KB	Output is correct
6	Correct	206 ms	21880 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	188 ms	8184 KB	Output is correct
2	Correct	178 ms	8184 KB	Output is correct
3	Correct	187 ms	13948 KB	Output is correct
4	Correct	151 ms	6888 KB	Output is correct
5	Correct	173 ms	22136 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	2688 KB	Output is correct
2	Correct	6 ms	2688 KB	Output is correct
3	Correct	6 ms	2688 KB	Output is correct
4	Correct	6 ms	2688 KB	Output is correct
5	Correct	6 ms	2688 KB	Output is correct
6	Correct	6 ms	2688 KB	Output is correct
7	Correct	6 ms	2688 KB	Output is correct
8	Correct	6 ms	2688 KB	Output is correct
9	Correct	6 ms	2688 KB	Output is correct
10	Correct	158 ms	7544 KB	Output is correct
11	Correct	153 ms	7544 KB	Output is correct
12	Correct	167 ms	13432 KB	Output is correct
13	Correct	116 ms	6376 KB	Output is correct
14	Correct	154 ms	21368 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	3584 KB	Output is correct
2	Correct	69 ms	6608 KB	Output is correct
3	Correct	79 ms	6780 KB	Output is correct
4	Correct	63 ms	6648 KB	Output is correct
5	Correct	35 ms	5228 KB	Output is correct
6	Correct	64 ms	8952 KB	Output is correct
7	Correct	64 ms	12280 KB	Output is correct

Subtask #7
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	2688 KB	Output is correct
2	Correct	6 ms	2688 KB	Output is correct
3	Correct	6 ms	2688 KB	Output is correct
4	Correct	6 ms	2688 KB	Output is correct
5	Correct	6 ms	2688 KB	Output is correct
6	Correct	6 ms	2688 KB	Output is correct
7	Correct	6 ms	2688 KB	Output is correct
8	Correct	6 ms	2688 KB	Output is correct
9	Correct	6 ms	2688 KB	Output is correct
10	Correct	7 ms	2816 KB	Output is correct
11	Correct	7 ms	2816 KB	Output is correct
12	Correct	7 ms	2944 KB	Output is correct
13	Correct	176 ms	21892 KB	Output is correct
14	Correct	197 ms	25848 KB	Output is correct
15	Correct	206 ms	21880 KB	Output is correct
16	Correct	158 ms	7544 KB	Output is correct
17	Correct	153 ms	7544 KB	Output is correct
18	Correct	167 ms	13432 KB	Output is correct
19	Correct	116 ms	6376 KB	Output is correct
20	Correct	154 ms	21368 KB	Output is correct
21	Correct	40 ms	3960 KB	Output is correct
22	Correct	141 ms	7800 KB	Output is correct
23	Correct	146 ms	9592 KB	Output is correct
24	Correct	232 ms	11260 KB	Output is correct
25	Correct	161 ms	10216 KB	Output is correct
26	Correct	204 ms	14204 KB	Output is correct
27	Correct	210 ms	15224 KB	Output is correct

Subtask #8
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	2688 KB	Output is correct
2	Correct	6 ms	2688 KB	Output is correct
3	Correct	6 ms	2688 KB	Output is correct
4	Correct	6 ms	2688 KB	Output is correct
5	Correct	6 ms	2688 KB	Output is correct
6	Correct	6 ms	2688 KB	Output is correct
7	Correct	6 ms	2688 KB	Output is correct
8	Correct	6 ms	2688 KB	Output is correct
9	Correct	6 ms	2688 KB	Output is correct
10	Correct	118 ms	9056 KB	Output is correct
11	Correct	99 ms	13304 KB	Output is correct
12	Correct	260 ms	12720 KB	Output is correct
13	Correct	191 ms	10860 KB	Output is correct
14	Correct	229 ms	12792 KB	Output is correct
15	Correct	7 ms	2816 KB	Output is correct
16	Correct	7 ms	2816 KB	Output is correct
17	Correct	7 ms	2944 KB	Output is correct
18	Correct	176 ms	21892 KB	Output is correct
19	Correct	197 ms	25848 KB	Output is correct
20	Correct	206 ms	21880 KB	Output is correct
21	Correct	188 ms	8184 KB	Output is correct
22	Correct	178 ms	8184 KB	Output is correct
23	Correct	187 ms	13948 KB	Output is correct
24	Correct	151 ms	6888 KB	Output is correct
25	Correct	173 ms	22136 KB	Output is correct
26	Correct	158 ms	7544 KB	Output is correct
27	Correct	153 ms	7544 KB	Output is correct
28	Correct	167 ms	13432 KB	Output is correct
29	Correct	116 ms	6376 KB	Output is correct
30	Correct	154 ms	21368 KB	Output is correct
31	Correct	17 ms	3584 KB	Output is correct
32	Correct	69 ms	6608 KB	Output is correct
33	Correct	79 ms	6780 KB	Output is correct
34	Correct	63 ms	6648 KB	Output is correct
35	Correct	35 ms	5228 KB	Output is correct
36	Correct	64 ms	8952 KB	Output is correct
37	Correct	64 ms	12280 KB	Output is correct
38	Correct	40 ms	3960 KB	Output is correct
39	Correct	141 ms	7800 KB	Output is correct
40	Correct	146 ms	9592 KB	Output is correct
41	Correct	232 ms	11260 KB	Output is correct
42	Correct	161 ms	10216 KB	Output is correct
43	Correct	204 ms	14204 KB	Output is correct
44	Correct	210 ms	15224 KB	Output is correct
45	Correct	48 ms	4088 KB	Output is correct
46	Correct	166 ms	8056 KB	Output is correct
47	Correct	168 ms	9848 KB	Output is correct
48	Correct	267 ms	12288 KB	Output is correct
49	Correct	196 ms	10984 KB	Output is correct
50	Correct	248 ms	15224 KB	Output is correct
51	Correct	243 ms	16120 KB	Output is correct

Submission #216990

Compilation message