oj.uz

Submission #463940

# Submission time Handle Problem Language Result Execution time Memory
463940 2021-08-12T04:49:05 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 185 ms 92704 KB 
#include <iostream>
#include <deque>
#include <vector>
using namespace std;
const int maxN = 200'000;
int N, D, x, res = 0;
vector<int> children[maxN];
deque<int> dfs(int u)
{
    deque<int> res(1, 1);
    for(int v: children[u]) {
        deque<int> 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] = max(res[i], max(add[i] + (D-i < res.size() ? res[max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[max(D-i, i)] : 0)));
        for(int i = add.size(); i >= 0; i--) if(i+1 < res.size()) res[i] = max(res[i], res[i+1]);
    }
    return res;
}
int main()
{
    cin >> N >> D;
    for(int i = 1; i < N; i++) {
        cin >> x; children[x].push_back(i);
    }
    for(int r: dfs(0)) res = max(res, r);
    cout << res << '\n';
}

Compilation message

catinatree.cpp: In function 'std::deque<int> dfs(int)':
catinatree.cpp:15:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for(int i = 0; i < add.size(); i++) res[i] = max(res[i], max(add[i] + (D-i < res.size() ? res[max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[max(D-i, i)] : 0)));
      |                        ~~^~~~~~~~~~~~
catinatree.cpp:15:84: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for(int i = 0; i < add.size(); i++) res[i] = max(res[i], max(add[i] + (D-i < res.size() ? res[max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[max(D-i, i)] : 0)));
      |                                                                                ~~~~^~~~~~~~~~~~
catinatree.cpp:15:136: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for(int i = 0; i < add.size(); i++) res[i] = max(res[i], max(add[i] + (D-i < res.size() ? res[max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[max(D-i, i)] : 0)));
      |                                                                                                                                    ~~~~^~~~~~~~~~~~
catinatree.cpp:16:53: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for(int i = add.size(); i >= 0; i--) if(i+1 < res.size()) res[i] = max(res[i], res[i+1]);
      |                                                 ~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 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 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4876 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 4 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 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4888 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

Subtask #2
40.0 / 40.0

# 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 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4876 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 4 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 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4888 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 4 ms 6220 KB Output is correct
22 Correct 4 ms 5068 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 4948 KB Output is correct
27 Correct 4 ms 5016 KB Output is correct
28 Correct 4 ms 4940 KB Output is correct
29 Correct 4 ms 4940 KB Output is correct
30 Correct 4 ms 4940 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 5016 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 6220 KB Output is correct

Subtask #3
49.0 / 49.0

# 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 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4876 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 4 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 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4888 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 4 ms 6220 KB Output is correct
22 Correct 4 ms 5068 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 4948 KB Output is correct
27 Correct 4 ms 5016 KB Output is correct
28 Correct 4 ms 4940 KB Output is correct
29 Correct 4 ms 4940 KB Output is correct
30 Correct 4 ms 4940 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 5016 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 6220 KB Output is correct
41 Correct 100 ms 8676 KB Output is correct
42 Correct 64 ms 6548 KB Output is correct
43 Correct 63 ms 6656 KB Output is correct
44 Correct 59 ms 6592 KB Output is correct
45 Correct 59 ms 6504 KB Output is correct
46 Correct 139 ms 8104 KB Output is correct
47 Correct 137 ms 8232 KB Output is correct
48 Correct 145 ms 8224 KB Output is correct
49 Correct 137 ms 8236 KB Output is correct
50 Correct 43 ms 5508 KB Output is correct
51 Correct 44 ms 5532 KB Output is correct
52 Correct 44 ms 5484 KB Output is correct
53 Correct 95 ms 6104 KB Output is correct
54 Correct 86 ms 6084 KB Output is correct
55 Correct 85 ms 6060 KB Output is correct
56 Correct 5 ms 5836 KB Output is correct
57 Correct 25 ms 22460 KB Output is correct
58 Correct 102 ms 83912 KB Output is correct
59 Correct 185 ms 92704 KB Output is correct
60 Correct 106 ms 9136 KB Output is correct
61 Correct 132 ms 9028 KB Output is correct