oj.uz

Submission #469736

# Submission time Handle Problem Language Result Execution time Memory
469736 2021-09-01T16:48:25 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 271 ms 220912 KB 
#include <bits/stdc++.h>
#define z size()
using namespace std;
int N,D,x,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 134852 KB Output is correct
2 Correct 99 ms 134812 KB Output is correct
3 Correct 105 ms 134880 KB Output is correct
4 Correct 94 ms 134852 KB Output is correct
5 Correct 98 ms 134832 KB Output is correct
6 Correct 95 ms 134884 KB Output is correct
7 Correct 116 ms 134908 KB Output is correct
8 Correct 96 ms 134892 KB Output is correct
9 Correct 96 ms 134892 KB Output is correct
10 Correct 95 ms 134852 KB Output is correct
11 Correct 95 ms 134912 KB Output is correct
12 Correct 90 ms 134848 KB Output is correct
13 Correct 109 ms 134860 KB Output is correct
14 Correct 97 ms 134868 KB Output is correct
15 Correct 95 ms 134836 KB Output is correct
16 Correct 114 ms 134816 KB Output is correct
17 Correct 100 ms 134916 KB Output is correct
18 Correct 111 ms 134876 KB Output is correct
19 Correct 95 ms 134868 KB Output is correct
20 Correct 98 ms 134912 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134852 KB Output is correct
2 Correct 99 ms 134812 KB Output is correct
3 Correct 105 ms 134880 KB Output is correct
4 Correct 94 ms 134852 KB Output is correct
5 Correct 98 ms 134832 KB Output is correct
6 Correct 95 ms 134884 KB Output is correct
7 Correct 116 ms 134908 KB Output is correct
8 Correct 96 ms 134892 KB Output is correct
9 Correct 96 ms 134892 KB Output is correct
10 Correct 95 ms 134852 KB Output is correct
11 Correct 95 ms 134912 KB Output is correct
12 Correct 90 ms 134848 KB Output is correct
13 Correct 109 ms 134860 KB Output is correct
14 Correct 97 ms 134868 KB Output is correct
15 Correct 95 ms 134836 KB Output is correct
16 Correct 114 ms 134816 KB Output is correct
17 Correct 100 ms 134916 KB Output is correct
18 Correct 111 ms 134876 KB Output is correct
19 Correct 95 ms 134868 KB Output is correct
20 Correct 98 ms 134912 KB Output is correct
21 Correct 93 ms 136192 KB Output is correct
22 Correct 96 ms 134992 KB Output is correct
23 Correct 104 ms 134880 KB Output is correct
24 Correct 96 ms 134916 KB Output is correct
25 Correct 96 ms 134852 KB Output is correct
26 Correct 96 ms 134920 KB Output is correct
27 Correct 99 ms 134936 KB Output is correct
28 Correct 98 ms 134832 KB Output is correct
29 Correct 100 ms 134868 KB Output is correct
30 Correct 101 ms 134864 KB Output is correct
31 Correct 95 ms 134852 KB Output is correct
32 Correct 97 ms 134820 KB Output is correct
33 Correct 102 ms 134980 KB Output is correct
34 Correct 96 ms 134828 KB Output is correct
35 Correct 95 ms 134888 KB Output is correct
36 Correct 98 ms 134908 KB Output is correct
37 Correct 97 ms 135004 KB Output is correct
38 Correct 96 ms 135140 KB Output is correct
39 Correct 97 ms 135304 KB Output is correct
40 Correct 96 ms 136076 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134852 KB Output is correct
2 Correct 99 ms 134812 KB Output is correct
3 Correct 105 ms 134880 KB Output is correct
4 Correct 94 ms 134852 KB Output is correct
5 Correct 98 ms 134832 KB Output is correct
6 Correct 95 ms 134884 KB Output is correct
7 Correct 116 ms 134908 KB Output is correct
8 Correct 96 ms 134892 KB Output is correct
9 Correct 96 ms 134892 KB Output is correct
10 Correct 95 ms 134852 KB Output is correct
11 Correct 95 ms 134912 KB Output is correct
12 Correct 90 ms 134848 KB Output is correct
13 Correct 109 ms 134860 KB Output is correct
14 Correct 97 ms 134868 KB Output is correct
15 Correct 95 ms 134836 KB Output is correct
16 Correct 114 ms 134816 KB Output is correct
17 Correct 100 ms 134916 KB Output is correct
18 Correct 111 ms 134876 KB Output is correct
19 Correct 95 ms 134868 KB Output is correct
20 Correct 98 ms 134912 KB Output is correct
21 Correct 93 ms 136192 KB Output is correct
22 Correct 96 ms 134992 KB Output is correct
23 Correct 104 ms 134880 KB Output is correct
24 Correct 96 ms 134916 KB Output is correct
25 Correct 96 ms 134852 KB Output is correct
26 Correct 96 ms 134920 KB Output is correct
27 Correct 99 ms 134936 KB Output is correct
28 Correct 98 ms 134832 KB Output is correct
29 Correct 100 ms 134868 KB Output is correct
30 Correct 101 ms 134864 KB Output is correct
31 Correct 95 ms 134852 KB Output is correct
32 Correct 97 ms 134820 KB Output is correct
33 Correct 102 ms 134980 KB Output is correct
34 Correct 96 ms 134828 KB Output is correct
35 Correct 95 ms 134888 KB Output is correct
36 Correct 98 ms 134908 KB Output is correct
37 Correct 97 ms 135004 KB Output is correct
38 Correct 96 ms 135140 KB Output is correct
39 Correct 97 ms 135304 KB Output is correct
40 Correct 96 ms 136076 KB Output is correct
41 Correct 210 ms 135024 KB Output is correct
42 Correct 169 ms 134924 KB Output is correct
43 Correct 168 ms 134832 KB Output is correct
44 Correct 170 ms 134852 KB Output is correct
45 Correct 169 ms 134936 KB Output is correct
46 Correct 261 ms 134908 KB Output is correct
47 Correct 255 ms 134940 KB Output is correct
48 Correct 261 ms 134972 KB Output is correct
49 Correct 257 ms 134816 KB Output is correct
50 Correct 143 ms 134852 KB Output is correct
51 Correct 144 ms 134956 KB Output is correct
52 Correct 140 ms 134904 KB Output is correct
53 Correct 204 ms 135508 KB Output is correct
54 Correct 203 ms 135364 KB Output is correct
55 Correct 211 ms 135408 KB Output is correct
56 Correct 108 ms 135692 KB Output is correct
57 Correct 119 ms 152116 KB Output is correct
58 Correct 189 ms 212404 KB Output is correct
59 Correct 271 ms 220912 KB Output is correct
60 Correct 228 ms 134980 KB Output is correct
61 Correct 214 ms 134980 KB Output is correct