oj.uz

Submission #469743

# Submission time Handle Problem Language Result Execution time Memory
469743 2021-09-01T16:59:51 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 268 ms 217792 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],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=min(a.z+2,q.z);--x;)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:3:147: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | 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],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=min(a.z+2,q.z);--x;)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];}
      |                                                                                                                                                   ^
catinatree.cpp:3:180: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | 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],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=min(a.z+2,q.z);--x;)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];}
      |                                                                                                                                                                                    ^
catinatree.cpp:3:211: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | 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],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=min(a.z+2,q.z);--x;)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];}
      |                                                                                                                                                                                                                   ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134796 KB Output is correct
2 Correct 99 ms 134920 KB Output is correct
3 Correct 96 ms 134872 KB Output is correct
4 Correct 97 ms 134852 KB Output is correct
5 Correct 96 ms 134832 KB Output is correct
6 Correct 94 ms 134856 KB Output is correct
7 Correct 95 ms 134852 KB Output is correct
8 Correct 94 ms 134808 KB Output is correct
9 Correct 97 ms 134836 KB Output is correct
10 Correct 94 ms 134992 KB Output is correct
11 Correct 100 ms 134916 KB Output is correct
12 Correct 97 ms 134792 KB Output is correct
13 Correct 95 ms 134852 KB Output is correct
14 Correct 96 ms 134796 KB Output is correct
15 Correct 98 ms 134952 KB Output is correct
16 Correct 96 ms 134852 KB Output is correct
17 Correct 97 ms 134900 KB Output is correct
18 Correct 98 ms 134880 KB Output is correct
19 Correct 96 ms 134848 KB Output is correct
20 Correct 96 ms 134828 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134796 KB Output is correct
2 Correct 99 ms 134920 KB Output is correct
3 Correct 96 ms 134872 KB Output is correct
4 Correct 97 ms 134852 KB Output is correct
5 Correct 96 ms 134832 KB Output is correct
6 Correct 94 ms 134856 KB Output is correct
7 Correct 95 ms 134852 KB Output is correct
8 Correct 94 ms 134808 KB Output is correct
9 Correct 97 ms 134836 KB Output is correct
10 Correct 94 ms 134992 KB Output is correct
11 Correct 100 ms 134916 KB Output is correct
12 Correct 97 ms 134792 KB Output is correct
13 Correct 95 ms 134852 KB Output is correct
14 Correct 96 ms 134796 KB Output is correct
15 Correct 98 ms 134952 KB Output is correct
16 Correct 96 ms 134852 KB Output is correct
17 Correct 97 ms 134900 KB Output is correct
18 Correct 98 ms 134880 KB Output is correct
19 Correct 96 ms 134848 KB Output is correct
20 Correct 96 ms 134828 KB Output is correct
21 Correct 87 ms 136148 KB Output is correct
22 Correct 95 ms 134924 KB Output is correct
23 Correct 96 ms 134860 KB Output is correct
24 Correct 97 ms 134828 KB Output is correct
25 Correct 98 ms 134956 KB Output is correct
26 Correct 88 ms 134892 KB Output is correct
27 Correct 96 ms 134888 KB Output is correct
28 Correct 94 ms 134896 KB Output is correct
29 Correct 98 ms 134980 KB Output is correct
30 Correct 106 ms 134868 KB Output is correct
31 Correct 93 ms 134856 KB Output is correct
32 Correct 97 ms 134804 KB Output is correct
33 Correct 98 ms 134928 KB Output is correct
34 Correct 98 ms 134980 KB Output is correct
35 Correct 95 ms 134852 KB Output is correct
36 Correct 105 ms 134908 KB Output is correct
37 Correct 97 ms 134980 KB Output is correct
38 Correct 97 ms 135152 KB Output is correct
39 Correct 99 ms 135244 KB Output is correct
40 Correct 92 ms 136048 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 134796 KB Output is correct
2 Correct 99 ms 134920 KB Output is correct
3 Correct 96 ms 134872 KB Output is correct
4 Correct 97 ms 134852 KB Output is correct
5 Correct 96 ms 134832 KB Output is correct
6 Correct 94 ms 134856 KB Output is correct
7 Correct 95 ms 134852 KB Output is correct
8 Correct 94 ms 134808 KB Output is correct
9 Correct 97 ms 134836 KB Output is correct
10 Correct 94 ms 134992 KB Output is correct
11 Correct 100 ms 134916 KB Output is correct
12 Correct 97 ms 134792 KB Output is correct
13 Correct 95 ms 134852 KB Output is correct
14 Correct 96 ms 134796 KB Output is correct
15 Correct 98 ms 134952 KB Output is correct
16 Correct 96 ms 134852 KB Output is correct
17 Correct 97 ms 134900 KB Output is correct
18 Correct 98 ms 134880 KB Output is correct
19 Correct 96 ms 134848 KB Output is correct
20 Correct 96 ms 134828 KB Output is correct
21 Correct 87 ms 136148 KB Output is correct
22 Correct 95 ms 134924 KB Output is correct
23 Correct 96 ms 134860 KB Output is correct
24 Correct 97 ms 134828 KB Output is correct
25 Correct 98 ms 134956 KB Output is correct
26 Correct 88 ms 134892 KB Output is correct
27 Correct 96 ms 134888 KB Output is correct
28 Correct 94 ms 134896 KB Output is correct
29 Correct 98 ms 134980 KB Output is correct
30 Correct 106 ms 134868 KB Output is correct
31 Correct 93 ms 134856 KB Output is correct
32 Correct 97 ms 134804 KB Output is correct
33 Correct 98 ms 134928 KB Output is correct
34 Correct 98 ms 134980 KB Output is correct
35 Correct 95 ms 134852 KB Output is correct
36 Correct 105 ms 134908 KB Output is correct
37 Correct 97 ms 134980 KB Output is correct
38 Correct 97 ms 135152 KB Output is correct
39 Correct 99 ms 135244 KB Output is correct
40 Correct 92 ms 136048 KB Output is correct
41 Correct 217 ms 135048 KB Output is correct
42 Correct 179 ms 134856 KB Output is correct
43 Correct 176 ms 134940 KB Output is correct
44 Correct 175 ms 134936 KB Output is correct
45 Correct 174 ms 134864 KB Output is correct
46 Correct 268 ms 134936 KB Output is correct
47 Correct 254 ms 135024 KB Output is correct
48 Correct 257 ms 134932 KB Output is correct
49 Correct 267 ms 134912 KB Output is correct
50 Correct 152 ms 135012 KB Output is correct
51 Correct 145 ms 134924 KB Output is correct
52 Correct 142 ms 134856 KB Output is correct
53 Correct 200 ms 135420 KB Output is correct
54 Correct 200 ms 135356 KB Output is correct
55 Correct 195 ms 135444 KB Output is correct
56 Correct 108 ms 135620 KB Output is correct
57 Correct 114 ms 151496 KB Output is correct
58 Correct 187 ms 209588 KB Output is correct
59 Correct 267 ms 217792 KB Output is correct
60 Correct 253 ms 135060 KB Output is correct
61 Correct 210 ms 134980 KB Output is correct