oj.uz

Submission #469724

# Submission time Handle Problem Language Result Execution time Memory
469724 2021-09-01T16:30:41 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 253 ms 222540 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(i=0;i<a.z;i++)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;for(i=1;i<N;i++){cin>>x;c[x].push_back(i);}for(int r:d(0))q=max(q,r);cout<<q;}

Compilation message

catinatree.cpp: In function 'std::deque<int> d(int)':
catinatree.cpp:3:149: 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,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(i=0;i<a.z;i++)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;for(i=1;i<N;i++){cin>>x;c[x].push_back(i);}for(int r:d(0))q=max(q,r);cout<<q;}
      |                                                                                                                                                     ^
catinatree.cpp:3:185: 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,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(i=0;i<a.z;i++)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;for(i=1;i<N;i++){cin>>x;c[x].push_back(i);}for(int r:d(0))q=max(q,r);cout<<q;}
      |                                                                                                                                                                                         ^
catinatree.cpp:3:216: 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,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(i=0;i<a.z;i++)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;for(i=1;i<N;i++){cin>>x;c[x].push_back(i);}for(int r:d(0))q=max(q,r);cout<<q;}
      |                                                                                                                                                                                                                        ^
catinatree.cpp:3:265: 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,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(i=0;i<a.z;i++)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;for(i=1;i<N;i++){cin>>x;c[x].push_back(i);}for(int r:d(0))q=max(q,r);cout<<q;}
      |                                                                                                                                                                                                                                                                         ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 134828 KB Output is correct
2 Correct 88 ms 134812 KB Output is correct
3 Correct 89 ms 134860 KB Output is correct
4 Correct 91 ms 134884 KB Output is correct
5 Correct 90 ms 134860 KB Output is correct
6 Correct 91 ms 134928 KB Output is correct
7 Correct 91 ms 134852 KB Output is correct
8 Correct 89 ms 134920 KB Output is correct
9 Correct 90 ms 134892 KB Output is correct
10 Correct 90 ms 134868 KB Output is correct
11 Correct 91 ms 134852 KB Output is correct
12 Correct 88 ms 134820 KB Output is correct
13 Correct 105 ms 134864 KB Output is correct
14 Correct 91 ms 134840 KB Output is correct
15 Correct 90 ms 134860 KB Output is correct
16 Correct 89 ms 134848 KB Output is correct
17 Correct 90 ms 134816 KB Output is correct
18 Correct 89 ms 134912 KB Output is correct
19 Correct 92 ms 134852 KB Output is correct
20 Correct 90 ms 134872 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 134828 KB Output is correct
2 Correct 88 ms 134812 KB Output is correct
3 Correct 89 ms 134860 KB Output is correct
4 Correct 91 ms 134884 KB Output is correct
5 Correct 90 ms 134860 KB Output is correct
6 Correct 91 ms 134928 KB Output is correct
7 Correct 91 ms 134852 KB Output is correct
8 Correct 89 ms 134920 KB Output is correct
9 Correct 90 ms 134892 KB Output is correct
10 Correct 90 ms 134868 KB Output is correct
11 Correct 91 ms 134852 KB Output is correct
12 Correct 88 ms 134820 KB Output is correct
13 Correct 105 ms 134864 KB Output is correct
14 Correct 91 ms 134840 KB Output is correct
15 Correct 90 ms 134860 KB Output is correct
16 Correct 89 ms 134848 KB Output is correct
17 Correct 90 ms 134816 KB Output is correct
18 Correct 89 ms 134912 KB Output is correct
19 Correct 92 ms 134852 KB Output is correct
20 Correct 90 ms 134872 KB Output is correct
21 Correct 94 ms 136132 KB Output is correct
22 Correct 92 ms 134836 KB Output is correct
23 Correct 88 ms 134884 KB Output is correct
24 Correct 90 ms 134808 KB Output is correct
25 Correct 93 ms 134844 KB Output is correct
26 Correct 96 ms 134884 KB Output is correct
27 Correct 90 ms 134884 KB Output is correct
28 Correct 89 ms 134820 KB Output is correct
29 Correct 97 ms 134816 KB Output is correct
30 Correct 90 ms 134924 KB Output is correct
31 Correct 91 ms 134848 KB Output is correct
32 Correct 89 ms 134868 KB Output is correct
33 Correct 90 ms 134828 KB Output is correct
34 Correct 90 ms 134932 KB Output is correct
35 Correct 88 ms 134808 KB Output is correct
36 Correct 89 ms 134832 KB Output is correct
37 Correct 89 ms 134980 KB Output is correct
38 Correct 84 ms 135108 KB Output is correct
39 Correct 90 ms 135240 KB Output is correct
40 Correct 91 ms 136100 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 134828 KB Output is correct
2 Correct 88 ms 134812 KB Output is correct
3 Correct 89 ms 134860 KB Output is correct
4 Correct 91 ms 134884 KB Output is correct
5 Correct 90 ms 134860 KB Output is correct
6 Correct 91 ms 134928 KB Output is correct
7 Correct 91 ms 134852 KB Output is correct
8 Correct 89 ms 134920 KB Output is correct
9 Correct 90 ms 134892 KB Output is correct
10 Correct 90 ms 134868 KB Output is correct
11 Correct 91 ms 134852 KB Output is correct
12 Correct 88 ms 134820 KB Output is correct
13 Correct 105 ms 134864 KB Output is correct
14 Correct 91 ms 134840 KB Output is correct
15 Correct 90 ms 134860 KB Output is correct
16 Correct 89 ms 134848 KB Output is correct
17 Correct 90 ms 134816 KB Output is correct
18 Correct 89 ms 134912 KB Output is correct
19 Correct 92 ms 134852 KB Output is correct
20 Correct 90 ms 134872 KB Output is correct
21 Correct 94 ms 136132 KB Output is correct
22 Correct 92 ms 134836 KB Output is correct
23 Correct 88 ms 134884 KB Output is correct
24 Correct 90 ms 134808 KB Output is correct
25 Correct 93 ms 134844 KB Output is correct
26 Correct 96 ms 134884 KB Output is correct
27 Correct 90 ms 134884 KB Output is correct
28 Correct 89 ms 134820 KB Output is correct
29 Correct 97 ms 134816 KB Output is correct
30 Correct 90 ms 134924 KB Output is correct
31 Correct 91 ms 134848 KB Output is correct
32 Correct 89 ms 134868 KB Output is correct
33 Correct 90 ms 134828 KB Output is correct
34 Correct 90 ms 134932 KB Output is correct
35 Correct 88 ms 134808 KB Output is correct
36 Correct 89 ms 134832 KB Output is correct
37 Correct 89 ms 134980 KB Output is correct
38 Correct 84 ms 135108 KB Output is correct
39 Correct 90 ms 135240 KB Output is correct
40 Correct 91 ms 136100 KB Output is correct
41 Correct 206 ms 135128 KB Output is correct
42 Correct 202 ms 134836 KB Output is correct
43 Correct 168 ms 135120 KB Output is correct
44 Correct 163 ms 134940 KB Output is correct
45 Correct 165 ms 134904 KB Output is correct
46 Correct 249 ms 134980 KB Output is correct
47 Correct 251 ms 135012 KB Output is correct
48 Correct 253 ms 134848 KB Output is correct
49 Correct 250 ms 134864 KB Output is correct
50 Correct 136 ms 134912 KB Output is correct
51 Correct 136 ms 134900 KB Output is correct
52 Correct 133 ms 134852 KB Output is correct
53 Correct 196 ms 135424 KB Output is correct
54 Correct 200 ms 135424 KB Output is correct
55 Correct 201 ms 135360 KB Output is correct
56 Correct 92 ms 135764 KB Output is correct
57 Correct 106 ms 152496 KB Output is correct
58 Correct 178 ms 213688 KB Output is correct
59 Correct 252 ms 222540 KB Output is correct
60 Correct 209 ms 135228 KB Output is correct
61 Correct 203 ms 135016 KB Output is correct