oj.uz

Submission #469711

# Submission time Handle Problem Language Result Execution time Memory
469711 2021-09-01T16:01:31 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 300 ms 264404 KB 
#include <bits/stdc++.h>
#define z size()
#define f(i,a,b) for(i=a;i<b;i++)
using namespace std;int N,D,x,q,i;deque<int>c[1<<18];
deque<int>d(int u){deque<int>q(1,1);for(int v:c[u]){auto a=d(v);if(q.z<a.z)swap(q,a);f(i,0,a.z)q[i]=max(q[i],max(a[i]+(D-i<q.z?q[max(D-i,i)]:0),q[i]+(D-i<a.z?a[max(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=max(q[i],q[i+1]);}q.push_front(q.front());return q;}
int main(){cin>>N>>D;f(i,1,N){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:3:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define f(i,a,b) for(i=a;i<b;i++)
      |                           ^
catinatree.cpp:5:86: note: in expansion of macro 'f'
    5 | deque<int>d(int u){deque<int>q(1,1);for(int v:c[u]){auto a=d(v);if(q.z<a.z)swap(q,a);f(i,0,a.z)q[i]=max(q[i],max(a[i]+(D-i<q.z?q[max(D-i,i)]:0),q[i]+(D-i<a.z?a[max(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=max(q[i],q[i+1]);}q.push_front(q.front());return q;}
      |                                                                                      ^
catinatree.cpp:5:123: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | deque<int>d(int u){deque<int>q(1,1);for(int v:c[u]){auto a=d(v);if(q.z<a.z)swap(q,a);f(i,0,a.z)q[i]=max(q[i],max(a[i]+(D-i<q.z?q[max(D-i,i)]:0),q[i]+(D-i<a.z?a[max(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=max(q[i],q[i+1]);}q.push_front(q.front());return q;}
      |                                                                                                                           ^
catinatree.cpp:5:154: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | deque<int>d(int u){deque<int>q(1,1);for(int v:c[u]){auto a=d(v);if(q.z<a.z)swap(q,a);f(i,0,a.z)q[i]=max(q[i],max(a[i]+(D-i<q.z?q[max(D-i,i)]:0),q[i]+(D-i<a.z?a[max(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=max(q[i],q[i+1]);}q.push_front(q.front());return q;}
      |                                                                                                                                                          ^
catinatree.cpp:5:203: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | deque<int>d(int u){deque<int>q(1,1);for(int v:c[u]){auto a=d(v);if(q.z<a.z)swap(q,a);f(i,0,a.z)q[i]=max(q[i],max(a[i]+(D-i<q.z?q[max(D-i,i)]:0),q[i]+(D-i<a.z?a[max(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=max(q[i],q[i+1]);}q.push_front(q.front());return q;}
      |                                                                                                                                                                                                           ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 176880 KB Output is correct
2 Correct 121 ms 176632 KB Output is correct
3 Correct 120 ms 176672 KB Output is correct
4 Correct 116 ms 176708 KB Output is correct
5 Correct 117 ms 176736 KB Output is correct
6 Correct 120 ms 176716 KB Output is correct
7 Correct 113 ms 176708 KB Output is correct
8 Correct 118 ms 176732 KB Output is correct
9 Correct 117 ms 176724 KB Output is correct
10 Correct 119 ms 176720 KB Output is correct
11 Correct 122 ms 176708 KB Output is correct
12 Correct 117 ms 176636 KB Output is correct
13 Correct 116 ms 176708 KB Output is correct
14 Correct 115 ms 176708 KB Output is correct
15 Correct 117 ms 176836 KB Output is correct
16 Correct 116 ms 176708 KB Output is correct
17 Correct 120 ms 176784 KB Output is correct
18 Correct 118 ms 176780 KB Output is correct
19 Correct 118 ms 176788 KB Output is correct
20 Correct 118 ms 176744 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 176880 KB Output is correct
2 Correct 121 ms 176632 KB Output is correct
3 Correct 120 ms 176672 KB Output is correct
4 Correct 116 ms 176708 KB Output is correct
5 Correct 117 ms 176736 KB Output is correct
6 Correct 120 ms 176716 KB Output is correct
7 Correct 113 ms 176708 KB Output is correct
8 Correct 118 ms 176732 KB Output is correct
9 Correct 117 ms 176724 KB Output is correct
10 Correct 119 ms 176720 KB Output is correct
11 Correct 122 ms 176708 KB Output is correct
12 Correct 117 ms 176636 KB Output is correct
13 Correct 116 ms 176708 KB Output is correct
14 Correct 115 ms 176708 KB Output is correct
15 Correct 117 ms 176836 KB Output is correct
16 Correct 116 ms 176708 KB Output is correct
17 Correct 120 ms 176784 KB Output is correct
18 Correct 118 ms 176780 KB Output is correct
19 Correct 118 ms 176788 KB Output is correct
20 Correct 118 ms 176744 KB Output is correct
21 Correct 119 ms 178028 KB Output is correct
22 Correct 119 ms 176752 KB Output is correct
23 Correct 121 ms 176656 KB Output is correct
24 Correct 119 ms 176712 KB Output is correct
25 Correct 121 ms 176708 KB Output is correct
26 Correct 121 ms 176668 KB Output is correct
27 Correct 118 ms 176640 KB Output is correct
28 Correct 135 ms 176704 KB Output is correct
29 Correct 121 ms 176656 KB Output is correct
30 Correct 119 ms 176724 KB Output is correct
31 Correct 118 ms 176708 KB Output is correct
32 Correct 122 ms 176732 KB Output is correct
33 Correct 120 ms 176756 KB Output is correct
34 Correct 120 ms 176648 KB Output is correct
35 Correct 117 ms 176648 KB Output is correct
36 Correct 119 ms 176632 KB Output is correct
37 Correct 121 ms 176852 KB Output is correct
38 Correct 117 ms 177000 KB Output is correct
39 Correct 111 ms 177056 KB Output is correct
40 Correct 121 ms 177992 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 176880 KB Output is correct
2 Correct 121 ms 176632 KB Output is correct
3 Correct 120 ms 176672 KB Output is correct
4 Correct 116 ms 176708 KB Output is correct
5 Correct 117 ms 176736 KB Output is correct
6 Correct 120 ms 176716 KB Output is correct
7 Correct 113 ms 176708 KB Output is correct
8 Correct 118 ms 176732 KB Output is correct
9 Correct 117 ms 176724 KB Output is correct
10 Correct 119 ms 176720 KB Output is correct
11 Correct 122 ms 176708 KB Output is correct
12 Correct 117 ms 176636 KB Output is correct
13 Correct 116 ms 176708 KB Output is correct
14 Correct 115 ms 176708 KB Output is correct
15 Correct 117 ms 176836 KB Output is correct
16 Correct 116 ms 176708 KB Output is correct
17 Correct 120 ms 176784 KB Output is correct
18 Correct 118 ms 176780 KB Output is correct
19 Correct 118 ms 176788 KB Output is correct
20 Correct 118 ms 176744 KB Output is correct
21 Correct 119 ms 178028 KB Output is correct
22 Correct 119 ms 176752 KB Output is correct
23 Correct 121 ms 176656 KB Output is correct
24 Correct 119 ms 176712 KB Output is correct
25 Correct 121 ms 176708 KB Output is correct
26 Correct 121 ms 176668 KB Output is correct
27 Correct 118 ms 176640 KB Output is correct
28 Correct 135 ms 176704 KB Output is correct
29 Correct 121 ms 176656 KB Output is correct
30 Correct 119 ms 176724 KB Output is correct
31 Correct 118 ms 176708 KB Output is correct
32 Correct 122 ms 176732 KB Output is correct
33 Correct 120 ms 176756 KB Output is correct
34 Correct 120 ms 176648 KB Output is correct
35 Correct 117 ms 176648 KB Output is correct
36 Correct 119 ms 176632 KB Output is correct
37 Correct 121 ms 176852 KB Output is correct
38 Correct 117 ms 177000 KB Output is correct
39 Correct 111 ms 177056 KB Output is correct
40 Correct 121 ms 177992 KB Output is correct
41 Correct 238 ms 176908 KB Output is correct
42 Correct 192 ms 176712 KB Output is correct
43 Correct 192 ms 176756 KB Output is correct
44 Correct 200 ms 176864 KB Output is correct
45 Correct 196 ms 176708 KB Output is correct
46 Correct 278 ms 176724 KB Output is correct
47 Correct 285 ms 176884 KB Output is correct
48 Correct 277 ms 176708 KB Output is correct
49 Correct 280 ms 176760 KB Output is correct
50 Correct 163 ms 176636 KB Output is correct
51 Correct 163 ms 176720 KB Output is correct
52 Correct 158 ms 176744 KB Output is correct
53 Correct 232 ms 177216 KB Output is correct
54 Correct 227 ms 177304 KB Output is correct
55 Correct 230 ms 177240 KB Output is correct
56 Correct 115 ms 177500 KB Output is correct
57 Correct 142 ms 194380 KB Output is correct
58 Correct 223 ms 255632 KB Output is correct
59 Correct 300 ms 264404 KB Output is correct
60 Correct 243 ms 176920 KB Output is correct
61 Correct 238 ms 176836 KB Output is correct