oj.uz

Submission #463920

# Submission time Handle Problem Language Result Execution time Memory
463920 2021-08-12T02:49:57 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 183 ms 93880 KB 
#include <iostream>
#include <deque>
#include <vector>
using namespace std;

const int maxN = 200'000;
int N, D;
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++)
    {
        int x;
        cin >> x;

        children[x].push_back(i);
    }

    deque<int> R = dfs(0);
    int res = 0;
    for(int r: R) res = max(res, r);
    cout << res << '\n';
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 3 ms 4988 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 4992 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 3 ms 4940 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 4988 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 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 4 ms 4940 KB Output is correct
2 Correct 3 ms 4988 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 4992 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 3 ms 4940 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 4988 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 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 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 5 ms 4992 KB Output is correct
34 Correct 5 ms 4940 KB Output is correct
35 Correct 4 ms 4988 KB Output is correct
36 Correct 4 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 5 ms 5196 KB Output is correct
39 Correct 5 ms 5324 KB Output is correct
40 Correct 4 ms 6276 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 3 ms 4988 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 4992 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 3 ms 4940 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 4988 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 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 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 5 ms 4992 KB Output is correct
34 Correct 5 ms 4940 KB Output is correct
35 Correct 4 ms 4988 KB Output is correct
36 Correct 4 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 5 ms 5196 KB Output is correct
39 Correct 5 ms 5324 KB Output is correct
40 Correct 4 ms 6276 KB Output is correct
41 Correct 98 ms 9764 KB Output is correct
42 Correct 59 ms 7120 KB Output is correct
43 Correct 60 ms 7108 KB Output is correct
44 Correct 84 ms 7148 KB Output is correct
45 Correct 71 ms 7220 KB Output is correct
46 Correct 148 ms 9292 KB Output is correct
47 Correct 139 ms 9372 KB Output is correct
48 Correct 134 ms 9280 KB Output is correct
49 Correct 150 ms 9516 KB Output is correct
50 Correct 49 ms 5836 KB Output is correct
51 Correct 44 ms 5964 KB Output is correct
52 Correct 42 ms 5876 KB Output is correct
53 Correct 117 ms 6816 KB Output is correct
54 Correct 83 ms 6820 KB Output is correct
55 Correct 84 ms 6876 KB Output is correct
56 Correct 6 ms 5836 KB Output is correct
57 Correct 24 ms 22548 KB Output is correct
58 Correct 103 ms 84432 KB Output is correct
59 Correct 183 ms 93880 KB Output is correct
60 Correct 107 ms 10140 KB Output is correct
61 Correct 123 ms 10076 KB Output is correct