oj.uz

Submission #469734

# Submission time Handle Problem Language Result Execution time Memory
469734 2021-09-01T16:45:46 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 266 ms 220964 KB 
#include <bits/stdc++.h>
#define z size()
using namespace std;
int N,D,x,q,i;deque<int>c[200000];
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);for(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
int main(){cin>>N>>D;for(i=1;i<N;i++){cin>>x;c[x].push_back(i);}cout<<d(0)[0];}

Compilation message

catinatree.cpp: In function 'std::deque<int> d(int)':
catinatree.cpp:5:95: 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);for(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                               ^
catinatree.cpp:5:131: 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);for(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                                                                   ^
catinatree.cpp:5:162: 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);for(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                                                                                                  ^
catinatree.cpp:5:208: 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);for(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                                                                                                                                                ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134900 KB Output is correct
2 Correct 108 ms 134864 KB Output is correct
3 Correct 97 ms 134820 KB Output is correct
4 Correct 99 ms 135044 KB Output is correct
5 Correct 93 ms 134868 KB Output is correct
6 Correct 94 ms 134880 KB Output is correct
7 Correct 96 ms 134808 KB Output is correct
8 Correct 99 ms 134808 KB Output is correct
9 Correct 100 ms 134804 KB Output is correct
10 Correct 93 ms 134912 KB Output is correct
11 Correct 94 ms 134916 KB Output is correct
12 Correct 93 ms 134804 KB Output is correct
13 Correct 95 ms 134880 KB Output is correct
14 Correct 98 ms 134912 KB Output is correct
15 Correct 100 ms 134916 KB Output is correct
16 Correct 94 ms 134852 KB Output is correct
17 Correct 99 ms 134800 KB Output is correct
18 Correct 143 ms 134916 KB Output is correct
19 Correct 95 ms 134924 KB Output is correct
20 Correct 95 ms 134852 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134900 KB Output is correct
2 Correct 108 ms 134864 KB Output is correct
3 Correct 97 ms 134820 KB Output is correct
4 Correct 99 ms 135044 KB Output is correct
5 Correct 93 ms 134868 KB Output is correct
6 Correct 94 ms 134880 KB Output is correct
7 Correct 96 ms 134808 KB Output is correct
8 Correct 99 ms 134808 KB Output is correct
9 Correct 100 ms 134804 KB Output is correct
10 Correct 93 ms 134912 KB Output is correct
11 Correct 94 ms 134916 KB Output is correct
12 Correct 93 ms 134804 KB Output is correct
13 Correct 95 ms 134880 KB Output is correct
14 Correct 98 ms 134912 KB Output is correct
15 Correct 100 ms 134916 KB Output is correct
16 Correct 94 ms 134852 KB Output is correct
17 Correct 99 ms 134800 KB Output is correct
18 Correct 143 ms 134916 KB Output is correct
19 Correct 95 ms 134924 KB Output is correct
20 Correct 95 ms 134852 KB Output is correct
21 Correct 98 ms 136212 KB Output is correct
22 Correct 96 ms 134852 KB Output is correct
23 Correct 101 ms 134852 KB Output is correct
24 Correct 96 ms 134800 KB Output is correct
25 Correct 100 ms 134920 KB Output is correct
26 Correct 96 ms 134824 KB Output is correct
27 Correct 94 ms 134872 KB Output is correct
28 Correct 98 ms 134852 KB Output is correct
29 Correct 102 ms 134836 KB Output is correct
30 Correct 93 ms 134836 KB Output is correct
31 Correct 106 ms 134848 KB Output is correct
32 Correct 92 ms 134904 KB Output is correct
33 Correct 98 ms 134912 KB Output is correct
34 Correct 99 ms 134860 KB Output is correct
35 Correct 98 ms 134956 KB Output is correct
36 Correct 97 ms 134964 KB Output is correct
37 Correct 95 ms 134872 KB Output is correct
38 Correct 95 ms 135096 KB Output is correct
39 Correct 96 ms 135308 KB Output is correct
40 Correct 99 ms 136132 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134900 KB Output is correct
2 Correct 108 ms 134864 KB Output is correct
3 Correct 97 ms 134820 KB Output is correct
4 Correct 99 ms 135044 KB Output is correct
5 Correct 93 ms 134868 KB Output is correct
6 Correct 94 ms 134880 KB Output is correct
7 Correct 96 ms 134808 KB Output is correct
8 Correct 99 ms 134808 KB Output is correct
9 Correct 100 ms 134804 KB Output is correct
10 Correct 93 ms 134912 KB Output is correct
11 Correct 94 ms 134916 KB Output is correct
12 Correct 93 ms 134804 KB Output is correct
13 Correct 95 ms 134880 KB Output is correct
14 Correct 98 ms 134912 KB Output is correct
15 Correct 100 ms 134916 KB Output is correct
16 Correct 94 ms 134852 KB Output is correct
17 Correct 99 ms 134800 KB Output is correct
18 Correct 143 ms 134916 KB Output is correct
19 Correct 95 ms 134924 KB Output is correct
20 Correct 95 ms 134852 KB Output is correct
21 Correct 98 ms 136212 KB Output is correct
22 Correct 96 ms 134852 KB Output is correct
23 Correct 101 ms 134852 KB Output is correct
24 Correct 96 ms 134800 KB Output is correct
25 Correct 100 ms 134920 KB Output is correct
26 Correct 96 ms 134824 KB Output is correct
27 Correct 94 ms 134872 KB Output is correct
28 Correct 98 ms 134852 KB Output is correct
29 Correct 102 ms 134836 KB Output is correct
30 Correct 93 ms 134836 KB Output is correct
31 Correct 106 ms 134848 KB Output is correct
32 Correct 92 ms 134904 KB Output is correct
33 Correct 98 ms 134912 KB Output is correct
34 Correct 99 ms 134860 KB Output is correct
35 Correct 98 ms 134956 KB Output is correct
36 Correct 97 ms 134964 KB Output is correct
37 Correct 95 ms 134872 KB Output is correct
38 Correct 95 ms 135096 KB Output is correct
39 Correct 96 ms 135308 KB Output is correct
40 Correct 99 ms 136132 KB Output is correct
41 Correct 218 ms 135032 KB Output is correct
42 Correct 178 ms 134928 KB Output is correct
43 Correct 181 ms 134852 KB Output is correct
44 Correct 177 ms 134932 KB Output is correct
45 Correct 169 ms 134852 KB Output is correct
46 Correct 260 ms 134908 KB Output is correct
47 Correct 265 ms 134852 KB Output is correct
48 Correct 262 ms 134980 KB Output is correct
49 Correct 265 ms 134936 KB Output is correct
50 Correct 144 ms 134908 KB Output is correct
51 Correct 152 ms 134852 KB Output is correct
52 Correct 140 ms 134920 KB Output is correct
53 Correct 201 ms 135436 KB Output is correct
54 Correct 205 ms 135444 KB Output is correct
55 Correct 206 ms 135440 KB Output is correct
56 Correct 97 ms 135752 KB Output is correct
57 Correct 117 ms 152008 KB Output is correct
58 Correct 195 ms 212392 KB Output is correct
59 Correct 266 ms 220964 KB Output is correct
60 Correct 211 ms 134980 KB Output is correct
61 Correct 210 ms 134908 KB Output is correct