oj.uz

Submission #463939

# Submission time Handle Problem Language Result Execution time Memory
463939 2021-08-12T04:46:49 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 179 ms 92612 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++)
        {
            int opt1 = add[i] + (D-i < res.size() ? res[max(D-i, i)] : 0);
            int opt2 = res[i] + (D-i < add.size() ? add[max(D-i, i)] : 0);
            res[i] = max(res[i], max(opt1, opt2));
        }
        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:16:26: 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 = 0; i < add.size(); i++)
      |                        ~~^~~~~~~~~~~~
catinatree.cpp:18:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |             int opt1 = add[i] + (D-i < res.size() ? res[max(D-i, i)] : 0);
      |                                  ~~~~^~~~~~~~~~~~
catinatree.cpp:19:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |             int opt2 = res[i] + (D-i < add.size() ? add[max(D-i, i)] : 0);
      |                                  ~~~~^~~~~~~~~~~~
catinatree.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             if(i+1 < res.size())
      |                ~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 4 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 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4996 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 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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 4 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 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4996 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 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 6 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 4 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 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 5020 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 4996 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 5 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 4 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 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4996 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 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 6 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 4 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 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 5020 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 4996 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 95 ms 8664 KB Output is correct
42 Correct 62 ms 6608 KB Output is correct
43 Correct 62 ms 6608 KB Output is correct
44 Correct 63 ms 6496 KB Output is correct
45 Correct 62 ms 6548 KB Output is correct
46 Correct 139 ms 8228 KB Output is correct
47 Correct 126 ms 8236 KB Output is correct
48 Correct 141 ms 8116 KB Output is correct
49 Correct 128 ms 8236 KB Output is correct
50 Correct 45 ms 5552 KB Output is correct
51 Correct 44 ms 5548 KB Output is correct
52 Correct 43 ms 5576 KB Output is correct
53 Correct 83 ms 6104 KB Output is correct
54 Correct 88 ms 6056 KB Output is correct
55 Correct 86 ms 6100 KB Output is correct
56 Correct 5 ms 5836 KB Output is correct
57 Correct 25 ms 22460 KB Output is correct
58 Correct 107 ms 83820 KB Output is correct
59 Correct 179 ms 92612 KB Output is correct
60 Correct 104 ms 9168 KB Output is correct
61 Correct 115 ms 8904 KB Output is correct