Submission #730397

# Submission time Handle Problem Language Result Execution time Memory
730397 2023-04-25T19:53:16 Z iosif_andrei_ Cat in a tree (BOI17_catinatree) C++14
100 / 100
116 ms 20656 KB
#include <bits/stdc++.h>
using namespace std;
 
int n, k;
vector <int> g[200001];
 
pair <int, int> dfs(int nod = 0) {
 
    vector <int> v;
    int ret = 1;
    v.push_back(0);
 
    for (auto &i : g[nod]) {
 
        pair <int, int> aux = dfs(i);
        v.push_back(aux.first);
        ret += aux.second;
    }
 
    sort(v.begin(), v.end());
 
    int i = 0;
    while (v.size() - i > 1 && v[i] + v[i + 1] < k)
        i++, ret--;
 
    return {v[i] + 1, ret};
}
 
int main() {
 
    cin >> n >> k;
 
    for (int i = 1; i < n; i++) {
 
        int x;
        cin >> x;
 
        g[x].push_back(i);
    }
 
    cout << dfs().second;
 
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 4 ms 4948 KB Output is correct
23 Correct 4 ms 4908 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 4 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 4 ms 4948 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 4 ms 4948 KB Output is correct
23 Correct 4 ms 4908 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 4 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 4 ms 4948 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct
41 Correct 72 ms 9124 KB Output is correct
42 Correct 43 ms 6476 KB Output is correct
43 Correct 45 ms 6644 KB Output is correct
44 Correct 54 ms 6596 KB Output is correct
45 Correct 59 ms 6560 KB Output is correct
46 Correct 114 ms 8212 KB Output is correct
47 Correct 98 ms 8136 KB Output is correct
48 Correct 116 ms 8100 KB Output is correct
49 Correct 116 ms 8112 KB Output is correct
50 Correct 28 ms 5588 KB Output is correct
51 Correct 28 ms 5468 KB Output is correct
52 Correct 28 ms 5588 KB Output is correct
53 Correct 54 ms 6112 KB Output is correct
54 Correct 57 ms 6112 KB Output is correct
55 Correct 55 ms 6128 KB Output is correct
56 Correct 5 ms 5152 KB Output is correct
57 Correct 12 ms 8020 KB Output is correct
58 Correct 52 ms 19040 KB Output is correct
59 Correct 99 ms 20656 KB Output is correct
60 Correct 79 ms 9628 KB Output is correct
61 Correct 104 ms 8896 KB Output is correct