Submission #463943

# Submission time Handle Problem Language Result Execution time Memory
463943 2021-08-12T04:53:19 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
193 ms 92680 KB
#include <iostream>
#include <deque>
#include <vector>
int N, D, x, res = 0;
std::vector<int> children[200'000];
std::deque<int> dfs(int u) {
    std::deque<int> res(1, 1);
    for(int v: children[u]) {
        auto add = dfs(v);
        add.push_front(add.front());
        if(res.size() < add.size()) swap(res, add);
        for(int i = 0; i < add.size(); i++) res[i] = std::max(res[i], std::max(add[i] + (D-i < res.size() ? res[std::max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[std::max(D-i, i)] : 0)));
        for(int i = add.size(); i >= 0; i--) if(i+1 < res.size()) res[i] = std::max(res[i], res[i+1]); }
    return res; }
int main() {
    std::cin >> N >> D;
    for(int i = 1; i < N; i++) { std::cin >> x; children[x].push_back(i); }
    for(int r: dfs(0)) res = std::max(res, r);
    std::cout << res << '\n'; }

Compilation message

catinatree.cpp: In function 'std::deque<int> dfs(int)':
catinatree.cpp:12:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int i = 0; i < add.size(); i++) res[i] = std::max(res[i], std::max(add[i] + (D-i < res.size() ? res[std::max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[std::max(D-i, i)] : 0)));
      |                        ~~^~~~~~~~~~~~
catinatree.cpp:12:94: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int i = 0; i < add.size(); i++) res[i] = std::max(res[i], std::max(add[i] + (D-i < res.size() ? res[std::max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[std::max(D-i, i)] : 0)));
      |                                                                                          ~~~~^~~~~~~~~~~~
catinatree.cpp:12:151: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int i = 0; i < add.size(); i++) res[i] = std::max(res[i], std::max(add[i] + (D-i < res.size() ? res[std::max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[std::max(D-i, i)] : 0)));
      |                                                                                                                                                   ~~~~^~~~~~~~~~~~
catinatree.cpp:13:53: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |         for(int i = add.size(); i >= 0; i--) if(i+1 < res.size()) res[i] = std::max(res[i], res[i+1]); }
      |                                                 ~~~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 4996 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 4996 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 5 ms 6220 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 4 ms 4940 KB Output is correct
26 Correct 4 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 4 ms 4992 KB Output is correct
29 Correct 4 ms 4940 KB Output is correct
30 Correct 4 ms 4916 KB Output is correct
31 Correct 4 ms 4940 KB Output is correct
32 Correct 4 ms 4940 KB Output is correct
33 Correct 4 ms 4940 KB Output is correct
34 Correct 4 ms 4940 KB Output is correct
35 Correct 4 ms 4940 KB Output is correct
36 Correct 4 ms 4940 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5196 KB Output is correct
39 Correct 4 ms 5324 KB Output is correct
40 Correct 5 ms 6300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 4996 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 5 ms 6220 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 4 ms 4940 KB Output is correct
26 Correct 4 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 4 ms 4992 KB Output is correct
29 Correct 4 ms 4940 KB Output is correct
30 Correct 4 ms 4916 KB Output is correct
31 Correct 4 ms 4940 KB Output is correct
32 Correct 4 ms 4940 KB Output is correct
33 Correct 4 ms 4940 KB Output is correct
34 Correct 4 ms 4940 KB Output is correct
35 Correct 4 ms 4940 KB Output is correct
36 Correct 4 ms 4940 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5196 KB Output is correct
39 Correct 4 ms 5324 KB Output is correct
40 Correct 5 ms 6300 KB Output is correct
41 Correct 98 ms 8768 KB Output is correct
42 Correct 61 ms 6520 KB Output is correct
43 Correct 65 ms 6496 KB Output is correct
44 Correct 62 ms 6560 KB Output is correct
45 Correct 67 ms 6616 KB Output is correct
46 Correct 147 ms 8228 KB Output is correct
47 Correct 135 ms 8232 KB Output is correct
48 Correct 138 ms 8132 KB Output is correct
49 Correct 143 ms 8228 KB Output is correct
50 Correct 43 ms 5568 KB Output is correct
51 Correct 43 ms 5444 KB Output is correct
52 Correct 43 ms 5572 KB Output is correct
53 Correct 85 ms 6060 KB Output is correct
54 Correct 85 ms 6148 KB Output is correct
55 Correct 86 ms 6088 KB Output is correct
56 Correct 5 ms 5836 KB Output is correct
57 Correct 25 ms 22396 KB Output is correct
58 Correct 106 ms 83768 KB Output is correct
59 Correct 193 ms 92680 KB Output is correct
60 Correct 111 ms 9220 KB Output is correct
61 Correct 121 ms 9024 KB Output is correct