Submission #157935

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
157935	2019-10-14T03:09:13 Z	PeppaPig	Cat in a tree (BOI17_catinatree)	C++14	100 / 100	254 ms	40720 KB

catinatree

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5+5;

int n, k;
int dep[N], hv[N];
vector<int> g[N];
multiset<int> S[N];

int dfs(int u, int p) {
    dep[u] = dep[p] + 1;
    int sz = 1, mx = 0, x = -1;
    for(int v : g[u]) if(v != p) {
        int z = dfs(v, u);
        if(z > mx) mx = z, x = v;
        sz += z;
    }
    hv[u] = x;
    return sz;
}

void sack(int u, int p) {
    S[u].emplace(dep[u]);
    for(int v : g[u]) if(v != p) sack(v, u);
    if(hv[u] == -1) return;
    swap(S[u], S[hv[u]]);
    for(int v : g[u]) if(v != p) {
        while(!S[u].empty() && !S[v].empty() && *S[u].begin() + *S[v].begin() - 2 * dep[u] < k) {
            if(*S[u].begin() > *S[v].begin()) S[v].erase(S[v].begin());
            else S[u].erase(S[u].begin());
        }
        for(int x : S[v]) S[u].emplace(x);
        S[v].clear();
    }
}

int main() {
    scanf("%d %d", &n, &k);
    for(int i = 2, p; i <= n; i++) {
        scanf("%d", &p);
        g[++p].emplace_back(i);
        g[i].emplace_back(p);
    }
    dfs(1, 0);
    sack(1, 0);
    printf("%d\n", S[1].size());

    return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:48:31: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::multiset<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", S[1].size());
                    ~~~~~~~~~~~^
catinatree.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~
catinatree.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &p);
         ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	14584 KB	Output is correct
2	Correct	15 ms	14456 KB	Output is correct
3	Correct	15 ms	14456 KB	Output is correct
4	Correct	15 ms	14456 KB	Output is correct
5	Correct	18 ms	14456 KB	Output is correct
6	Correct	15 ms	14456 KB	Output is correct
7	Correct	15 ms	14460 KB	Output is correct
8	Correct	15 ms	14456 KB	Output is correct
9	Correct	15 ms	14456 KB	Output is correct
10	Correct	15 ms	14456 KB	Output is correct
11	Correct	15 ms	14456 KB	Output is correct
12	Correct	15 ms	14456 KB	Output is correct
13	Correct	15 ms	14456 KB	Output is correct
14	Correct	15 ms	14456 KB	Output is correct
15	Correct	15 ms	14456 KB	Output is correct
16	Correct	14 ms	14456 KB	Output is correct
17	Correct	15 ms	14456 KB	Output is correct
18	Correct	15 ms	14456 KB	Output is correct
19	Correct	15 ms	14456 KB	Output is correct
20	Correct	15 ms	14456 KB	Output is correct
21	Correct	15 ms	14712 KB	Output is correct
22	Correct	15 ms	14456 KB	Output is correct
23	Correct	15 ms	14456 KB	Output is correct
24	Correct	15 ms	14456 KB	Output is correct
25	Correct	16 ms	14456 KB	Output is correct
26	Correct	16 ms	14456 KB	Output is correct
27	Correct	15 ms	14456 KB	Output is correct
28	Correct	15 ms	14456 KB	Output is correct
29	Correct	16 ms	14456 KB	Output is correct
30	Correct	16 ms	14456 KB	Output is correct
31	Correct	16 ms	14456 KB	Output is correct
32	Correct	15 ms	14456 KB	Output is correct
33	Correct	16 ms	14456 KB	Output is correct
34	Correct	15 ms	14456 KB	Output is correct
35	Correct	15 ms	14456 KB	Output is correct
36	Correct	15 ms	14472 KB	Output is correct
37	Correct	15 ms	14456 KB	Output is correct
38	Correct	15 ms	14712 KB	Output is correct
39	Correct	15 ms	14584 KB	Output is correct
40	Correct	16 ms	14684 KB	Output is correct

Subtask #3
49.0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	14584 KB	Output is correct
2	Correct	15 ms	14456 KB	Output is correct
3	Correct	15 ms	14456 KB	Output is correct
4	Correct	15 ms	14456 KB	Output is correct
5	Correct	18 ms	14456 KB	Output is correct
6	Correct	15 ms	14456 KB	Output is correct
7	Correct	15 ms	14460 KB	Output is correct
8	Correct	15 ms	14456 KB	Output is correct
9	Correct	15 ms	14456 KB	Output is correct
10	Correct	15 ms	14456 KB	Output is correct
11	Correct	15 ms	14456 KB	Output is correct
12	Correct	15 ms	14456 KB	Output is correct
13	Correct	15 ms	14456 KB	Output is correct
14	Correct	15 ms	14456 KB	Output is correct
15	Correct	15 ms	14456 KB	Output is correct
16	Correct	14 ms	14456 KB	Output is correct
17	Correct	15 ms	14456 KB	Output is correct
18	Correct	15 ms	14456 KB	Output is correct
19	Correct	15 ms	14456 KB	Output is correct
20	Correct	15 ms	14456 KB	Output is correct
21	Correct	15 ms	14712 KB	Output is correct
22	Correct	15 ms	14456 KB	Output is correct
23	Correct	15 ms	14456 KB	Output is correct
24	Correct	15 ms	14456 KB	Output is correct
25	Correct	16 ms	14456 KB	Output is correct
26	Correct	16 ms	14456 KB	Output is correct
27	Correct	15 ms	14456 KB	Output is correct
28	Correct	15 ms	14456 KB	Output is correct
29	Correct	16 ms	14456 KB	Output is correct
30	Correct	16 ms	14456 KB	Output is correct
31	Correct	16 ms	14456 KB	Output is correct
32	Correct	15 ms	14456 KB	Output is correct
33	Correct	16 ms	14456 KB	Output is correct
34	Correct	15 ms	14456 KB	Output is correct
35	Correct	15 ms	14456 KB	Output is correct
36	Correct	15 ms	14472 KB	Output is correct
37	Correct	15 ms	14456 KB	Output is correct
38	Correct	15 ms	14712 KB	Output is correct
39	Correct	15 ms	14584 KB	Output is correct
40	Correct	16 ms	14684 KB	Output is correct
41	Correct	115 ms	25432 KB	Output is correct
42	Correct	147 ms	24436 KB	Output is correct
43	Correct	74 ms	19064 KB	Output is correct
44	Correct	80 ms	18936 KB	Output is correct
45	Correct	72 ms	19112 KB	Output is correct
46	Correct	249 ms	30300 KB	Output is correct
47	Correct	254 ms	23544 KB	Output is correct
48	Correct	165 ms	23804 KB	Output is correct
49	Correct	166 ms	23604 KB	Output is correct
50	Correct	70 ms	19320 KB	Output is correct
51	Correct	68 ms	19320 KB	Output is correct
52	Correct	61 ms	19208 KB	Output is correct
53	Correct	131 ms	24184 KB	Output is correct
54	Correct	136 ms	24184 KB	Output is correct
55	Correct	128 ms	24056 KB	Output is correct
56	Correct	15 ms	14712 KB	Output is correct
57	Correct	27 ms	18844 KB	Output is correct
58	Correct	72 ms	34396 KB	Output is correct
59	Correct	171 ms	40720 KB	Output is correct
60	Correct	113 ms	25212 KB	Output is correct
61	Correct	120 ms	23160 KB	Output is correct

Submission #157935

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 40.0 / 40.0

Subtask #3 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
40.0 / 40.0

Subtask #3
49.0 / 49.0