oj.uz

Submission #469727

# Submission time Handle Problem Language Result Execution time Memory
469727 2021-09-01T16:35:01 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 267 ms 220996 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+1;i;i--)if(i<q.z)q[i-1]=max(q[i-1],q[i]);}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+1;i;i--)if(i<q.z)q[i-1]=max(q[i-1],q[i]);}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+1;i;i--)if(i<q.z)q[i-1]=max(q[i-1],q[i]);}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+1;i;i--)if(i<q.z)q[i-1]=max(q[i-1],q[i]);}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:262: 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+1;i;i--)if(i<q.z)q[i-1]=max(q[i-1],q[i]);}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 87 ms 134960 KB Output is correct
2 Correct 85 ms 134916 KB Output is correct
3 Correct 88 ms 134820 KB Output is correct
4 Correct 88 ms 134924 KB Output is correct
5 Correct 87 ms 134852 KB Output is correct
6 Correct 87 ms 134952 KB Output is correct
7 Correct 87 ms 134888 KB Output is correct
8 Correct 87 ms 134804 KB Output is correct
9 Correct 83 ms 134848 KB Output is correct
10 Correct 92 ms 134816 KB Output is correct
11 Correct 88 ms 134844 KB Output is correct
12 Correct 89 ms 134896 KB Output is correct
13 Correct 88 ms 134852 KB Output is correct
14 Correct 89 ms 134868 KB Output is correct
15 Correct 86 ms 134888 KB Output is correct
16 Correct 87 ms 134852 KB Output is correct
17 Correct 84 ms 134908 KB Output is correct
18 Correct 88 ms 134852 KB Output is correct
19 Correct 89 ms 134912 KB Output is correct
20 Correct 91 ms 134852 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 134960 KB Output is correct
2 Correct 85 ms 134916 KB Output is correct
3 Correct 88 ms 134820 KB Output is correct
4 Correct 88 ms 134924 KB Output is correct
5 Correct 87 ms 134852 KB Output is correct
6 Correct 87 ms 134952 KB Output is correct
7 Correct 87 ms 134888 KB Output is correct
8 Correct 87 ms 134804 KB Output is correct
9 Correct 83 ms 134848 KB Output is correct
10 Correct 92 ms 134816 KB Output is correct
11 Correct 88 ms 134844 KB Output is correct
12 Correct 89 ms 134896 KB Output is correct
13 Correct 88 ms 134852 KB Output is correct
14 Correct 89 ms 134868 KB Output is correct
15 Correct 86 ms 134888 KB Output is correct
16 Correct 87 ms 134852 KB Output is correct
17 Correct 84 ms 134908 KB Output is correct
18 Correct 88 ms 134852 KB Output is correct
19 Correct 89 ms 134912 KB Output is correct
20 Correct 91 ms 134852 KB Output is correct
21 Correct 92 ms 136196 KB Output is correct
22 Correct 92 ms 134988 KB Output is correct
23 Correct 87 ms 134848 KB Output is correct
24 Correct 92 ms 134928 KB Output is correct
25 Correct 89 ms 134920 KB Output is correct
26 Correct 88 ms 134920 KB Output is correct
27 Correct 89 ms 135004 KB Output is correct
28 Correct 90 ms 134852 KB Output is correct
29 Correct 89 ms 134856 KB Output is correct
30 Correct 90 ms 134816 KB Output is correct
31 Correct 93 ms 134868 KB Output is correct
32 Correct 90 ms 134852 KB Output is correct
33 Correct 87 ms 134848 KB Output is correct
34 Correct 90 ms 134908 KB Output is correct
35 Correct 89 ms 134852 KB Output is correct
36 Correct 89 ms 134904 KB Output is correct
37 Correct 88 ms 134960 KB Output is correct
38 Correct 88 ms 135236 KB Output is correct
39 Correct 90 ms 135232 KB Output is correct
40 Correct 86 ms 136132 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 134960 KB Output is correct
2 Correct 85 ms 134916 KB Output is correct
3 Correct 88 ms 134820 KB Output is correct
4 Correct 88 ms 134924 KB Output is correct
5 Correct 87 ms 134852 KB Output is correct
6 Correct 87 ms 134952 KB Output is correct
7 Correct 87 ms 134888 KB Output is correct
8 Correct 87 ms 134804 KB Output is correct
9 Correct 83 ms 134848 KB Output is correct
10 Correct 92 ms 134816 KB Output is correct
11 Correct 88 ms 134844 KB Output is correct
12 Correct 89 ms 134896 KB Output is correct
13 Correct 88 ms 134852 KB Output is correct
14 Correct 89 ms 134868 KB Output is correct
15 Correct 86 ms 134888 KB Output is correct
16 Correct 87 ms 134852 KB Output is correct
17 Correct 84 ms 134908 KB Output is correct
18 Correct 88 ms 134852 KB Output is correct
19 Correct 89 ms 134912 KB Output is correct
20 Correct 91 ms 134852 KB Output is correct
21 Correct 92 ms 136196 KB Output is correct
22 Correct 92 ms 134988 KB Output is correct
23 Correct 87 ms 134848 KB Output is correct
24 Correct 92 ms 134928 KB Output is correct
25 Correct 89 ms 134920 KB Output is correct
26 Correct 88 ms 134920 KB Output is correct
27 Correct 89 ms 135004 KB Output is correct
28 Correct 90 ms 134852 KB Output is correct
29 Correct 89 ms 134856 KB Output is correct
30 Correct 90 ms 134816 KB Output is correct
31 Correct 93 ms 134868 KB Output is correct
32 Correct 90 ms 134852 KB Output is correct
33 Correct 87 ms 134848 KB Output is correct
34 Correct 90 ms 134908 KB Output is correct
35 Correct 89 ms 134852 KB Output is correct
36 Correct 89 ms 134904 KB Output is correct
37 Correct 88 ms 134960 KB Output is correct
38 Correct 88 ms 135236 KB Output is correct
39 Correct 90 ms 135232 KB Output is correct
40 Correct 86 ms 136132 KB Output is correct
41 Correct 210 ms 135124 KB Output is correct
42 Correct 167 ms 134904 KB Output is correct
43 Correct 160 ms 134852 KB Output is correct
44 Correct 190 ms 134936 KB Output is correct
45 Correct 163 ms 134852 KB Output is correct
46 Correct 264 ms 134876 KB Output is correct
47 Correct 248 ms 134908 KB Output is correct
48 Correct 243 ms 134912 KB Output is correct
49 Correct 254 ms 135032 KB Output is correct
50 Correct 125 ms 134812 KB Output is correct
51 Correct 133 ms 134860 KB Output is correct
52 Correct 139 ms 135072 KB Output is correct
53 Correct 193 ms 135440 KB Output is correct
54 Correct 190 ms 135436 KB Output is correct
55 Correct 191 ms 135412 KB Output is correct
56 Correct 93 ms 135852 KB Output is correct
57 Correct 109 ms 152012 KB Output is correct
58 Correct 176 ms 212344 KB Output is correct
59 Correct 267 ms 220996 KB Output is correct
60 Correct 203 ms 135088 KB Output is correct
61 Correct 201 ms 134912 KB Output is correct