oj.uz

Submission #463948

# Submission time Handle Problem Language Result Execution time Memory
463948 2021-08-12T05:00:38 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 264 ms 221020 KB 
#include <iostream>
#include <deque>
using namespace std; int N, D, x, q = 0; deque<int> c[200'000];
deque<int> d(int u) {
    deque<int> q(1, 1);
    for(int v: c[u]) {
        auto a = d(v);
        if(q.size() < a.size()) swap(q, a);
        for(int i = 0; i < a.size(); i++) q[i] = max(q[i], max(a[i] + (D-i < q.size() ? q[max(D-i, i)] : 0), q[i] + (D-i < a.size() ? a[max(D-i, i)] : 0)));
        for(int i = a.size(); i >= 0; i--) if(i+1 < q.size()) q[i] = max(q[i], q[i+1]); }
    q.push_front(q.front()); return q; }
int main() {
    cin >> N >> D;
    for(int i = 1; i < N; i++) { cin >> x; c[x].push_back(i); }
    for(int r: d(0)) q = max(q, r);
    cout << q << '\n'; }

Compilation message

catinatree.cpp: In function 'std::deque<int> d(int)':
catinatree.cpp:9:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         for(int i = 0; i < a.size(); i++) q[i] = max(q[i], max(a[i] + (D-i < q.size() ? q[max(D-i, i)] : 0), q[i] + (D-i < a.size() ? a[max(D-i, i)] : 0)));
      |                        ~~^~~~~~~~~~
catinatree.cpp:9:76: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         for(int i = 0; i < a.size(); i++) q[i] = max(q[i], max(a[i] + (D-i < q.size() ? q[max(D-i, i)] : 0), q[i] + (D-i < a.size() ? a[max(D-i, i)] : 0)));
      |                                                                        ~~~~^~~~~~~~~~
catinatree.cpp:9:122: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         for(int i = 0; i < a.size(); i++) q[i] = max(q[i], max(a[i] + (D-i < q.size() ? q[max(D-i, i)] : 0), q[i] + (D-i < a.size() ? a[max(D-i, i)] : 0)));
      |                                                                                                                      ~~~~^~~~~~~~~~
catinatree.cpp:10:51: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |         for(int i = a.size(); i >= 0; i--) if(i+1 < q.size()) q[i] = max(q[i], q[i+1]); }
      |                                               ~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 134860 KB Output is correct
2 Correct 98 ms 134912 KB Output is correct
3 Correct 89 ms 134896 KB Output is correct
4 Correct 91 ms 134852 KB Output is correct
5 Correct 95 ms 134800 KB Output is correct
6 Correct 92 ms 134920 KB Output is correct
7 Correct 93 ms 134900 KB Output is correct
8 Correct 93 ms 134916 KB Output is correct
9 Correct 95 ms 135036 KB Output is correct
10 Correct 91 ms 134920 KB Output is correct
11 Correct 92 ms 134792 KB Output is correct
12 Correct 92 ms 134824 KB Output is correct
13 Correct 92 ms 134852 KB Output is correct
14 Correct 92 ms 134980 KB Output is correct
15 Correct 93 ms 134852 KB Output is correct
16 Correct 92 ms 134868 KB Output is correct
17 Correct 92 ms 134852 KB Output is correct
18 Correct 93 ms 134832 KB Output is correct
19 Correct 92 ms 134852 KB Output is correct
20 Correct 90 ms 134808 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 134860 KB Output is correct
2 Correct 98 ms 134912 KB Output is correct
3 Correct 89 ms 134896 KB Output is correct
4 Correct 91 ms 134852 KB Output is correct
5 Correct 95 ms 134800 KB Output is correct
6 Correct 92 ms 134920 KB Output is correct
7 Correct 93 ms 134900 KB Output is correct
8 Correct 93 ms 134916 KB Output is correct
9 Correct 95 ms 135036 KB Output is correct
10 Correct 91 ms 134920 KB Output is correct
11 Correct 92 ms 134792 KB Output is correct
12 Correct 92 ms 134824 KB Output is correct
13 Correct 92 ms 134852 KB Output is correct
14 Correct 92 ms 134980 KB Output is correct
15 Correct 93 ms 134852 KB Output is correct
16 Correct 92 ms 134868 KB Output is correct
17 Correct 92 ms 134852 KB Output is correct
18 Correct 93 ms 134832 KB Output is correct
19 Correct 92 ms 134852 KB Output is correct
20 Correct 90 ms 134808 KB Output is correct
21 Correct 92 ms 136160 KB Output is correct
22 Correct 93 ms 134924 KB Output is correct
23 Correct 86 ms 134892 KB Output is correct
24 Correct 91 ms 134828 KB Output is correct
25 Correct 90 ms 134852 KB Output is correct
26 Correct 94 ms 134872 KB Output is correct
27 Correct 92 ms 134872 KB Output is correct
28 Correct 94 ms 134924 KB Output is correct
29 Correct 92 ms 134808 KB Output is correct
30 Correct 93 ms 134980 KB Output is correct
31 Correct 95 ms 134928 KB Output is correct
32 Correct 95 ms 134904 KB Output is correct
33 Correct 95 ms 134980 KB Output is correct
34 Correct 92 ms 134852 KB Output is correct
35 Correct 90 ms 134964 KB Output is correct
36 Correct 94 ms 134808 KB Output is correct
37 Correct 94 ms 134892 KB Output is correct
38 Correct 93 ms 135184 KB Output is correct
39 Correct 92 ms 135308 KB Output is correct
40 Correct 95 ms 136132 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 134860 KB Output is correct
2 Correct 98 ms 134912 KB Output is correct
3 Correct 89 ms 134896 KB Output is correct
4 Correct 91 ms 134852 KB Output is correct
5 Correct 95 ms 134800 KB Output is correct
6 Correct 92 ms 134920 KB Output is correct
7 Correct 93 ms 134900 KB Output is correct
8 Correct 93 ms 134916 KB Output is correct
9 Correct 95 ms 135036 KB Output is correct
10 Correct 91 ms 134920 KB Output is correct
11 Correct 92 ms 134792 KB Output is correct
12 Correct 92 ms 134824 KB Output is correct
13 Correct 92 ms 134852 KB Output is correct
14 Correct 92 ms 134980 KB Output is correct
15 Correct 93 ms 134852 KB Output is correct
16 Correct 92 ms 134868 KB Output is correct
17 Correct 92 ms 134852 KB Output is correct
18 Correct 93 ms 134832 KB Output is correct
19 Correct 92 ms 134852 KB Output is correct
20 Correct 90 ms 134808 KB Output is correct
21 Correct 92 ms 136160 KB Output is correct
22 Correct 93 ms 134924 KB Output is correct
23 Correct 86 ms 134892 KB Output is correct
24 Correct 91 ms 134828 KB Output is correct
25 Correct 90 ms 134852 KB Output is correct
26 Correct 94 ms 134872 KB Output is correct
27 Correct 92 ms 134872 KB Output is correct
28 Correct 94 ms 134924 KB Output is correct
29 Correct 92 ms 134808 KB Output is correct
30 Correct 93 ms 134980 KB Output is correct
31 Correct 95 ms 134928 KB Output is correct
32 Correct 95 ms 134904 KB Output is correct
33 Correct 95 ms 134980 KB Output is correct
34 Correct 92 ms 134852 KB Output is correct
35 Correct 90 ms 134964 KB Output is correct
36 Correct 94 ms 134808 KB Output is correct
37 Correct 94 ms 134892 KB Output is correct
38 Correct 93 ms 135184 KB Output is correct
39 Correct 92 ms 135308 KB Output is correct
40 Correct 95 ms 136132 KB Output is correct
41 Correct 204 ms 135132 KB Output is correct
42 Correct 171 ms 134904 KB Output is correct
43 Correct 175 ms 134992 KB Output is correct
44 Correct 184 ms 134912 KB Output is correct
45 Correct 166 ms 134904 KB Output is correct
46 Correct 264 ms 134936 KB Output is correct
47 Correct 260 ms 134852 KB Output is correct
48 Correct 257 ms 135032 KB Output is correct
49 Correct 253 ms 135028 KB Output is correct
50 Correct 136 ms 134852 KB Output is correct
51 Correct 137 ms 134816 KB Output is correct
52 Correct 135 ms 134880 KB Output is correct
53 Correct 205 ms 135620 KB Output is correct
54 Correct 196 ms 135404 KB Output is correct
55 Correct 200 ms 135420 KB Output is correct
56 Correct 99 ms 135764 KB Output is correct
57 Correct 111 ms 152200 KB Output is correct
58 Correct 177 ms 212408 KB Output is correct
59 Correct 261 ms 221020 KB Output is correct
60 Correct 206 ms 135096 KB Output is correct
61 Correct 209 ms 134908 KB Output is correct