oj.uz

Submission #730396

# Submission time Handle Problem Language Result Execution time Memory
730396 2023-04-25T19:52:32 Z USER Cat in a tree (BOI17_catinatree) C++14
100 / 100
 103 ms 21808 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;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 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 5000 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 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 4 ms 4996 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 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 3 ms 4948 KB Output is correct
19 Correct 3 ms 4996 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 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 5000 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 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 4 ms 4996 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 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 3 ms 4948 KB Output is correct
19 Correct 3 ms 4996 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5104 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4996 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5000 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4996 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 4 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 4 ms 4996 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 3 ms 5004 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 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 5000 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 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 4 ms 4996 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 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 3 ms 4948 KB Output is correct
19 Correct 3 ms 4996 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5104 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4996 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5000 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4996 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 4 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 4 ms 4996 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 3 ms 5004 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 10124 KB Output is correct
42 Correct 47 ms 7148 KB Output is correct
43 Correct 46 ms 7044 KB Output is correct
44 Correct 60 ms 7096 KB Output is correct
45 Correct 43 ms 7064 KB Output is correct
46 Correct 98 ms 9376 KB Output is correct
47 Correct 92 ms 9376 KB Output is correct
48 Correct 97 ms 9252 KB Output is correct
49 Correct 103 ms 9416 KB Output is correct
50 Correct 27 ms 5936 KB Output is correct
51 Correct 29 ms 5916 KB Output is correct
52 Correct 27 ms 5844 KB Output is correct
53 Correct 52 ms 6796 KB Output is correct
54 Correct 52 ms 6800 KB Output is correct
55 Correct 54 ms 6800 KB Output is correct
56 Correct 3 ms 5136 KB Output is correct
57 Correct 13 ms 8208 KB Output is correct
58 Correct 48 ms 19788 KB Output is correct
59 Correct 97 ms 21808 KB Output is correct
60 Correct 77 ms 10576 KB Output is correct
61 Correct 84 ms 10036 KB Output is correct