oj.uz

Submission #469722

# Submission time Handle Problem Language Result Execution time Memory
469722 2021-09-01T16:27:55 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 257 ms 222572 KB 
#include <bits/stdc++.h>
#define z size()
#define y max
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]=y(q[i],y(a[i]+(D-i<q.z?q[y(D-i,i)]:0),q[i]+(D-i<a.z?a[y(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=y(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=y(q,r);cout<<q;}

Compilation message

catinatree.cpp: In function 'std::deque<int> d(int)':
catinatree.cpp:4:149: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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]=y(q[i],y(a[i]+(D-i<q.z?q[y(D-i,i)]:0),q[i]+(D-i<a.z?a[y(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=y(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=y(q,r);cout<<q;}
      |                                                                                                                                                     ^
catinatree.cpp:4:181: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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]=y(q[i],y(a[i]+(D-i<q.z?q[y(D-i,i)]:0),q[i]+(D-i<a.z?a[y(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=y(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=y(q,r);cout<<q;}
      |                                                                                                                                                                                     ^
catinatree.cpp:4:210: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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]=y(q[i],y(a[i]+(D-i<q.z?q[y(D-i,i)]:0),q[i]+(D-i<a.z?a[y(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=y(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=y(q,r);cout<<q;}
      |                                                                                                                                                                                                                  ^
catinatree.cpp:4:257: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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]=y(q[i],y(a[i]+(D-i<q.z?q[y(D-i,i)]:0),q[i]+(D-i<a.z?a[y(D-i,i)]:0)));for(i=a.z;i>=0;i--)if(i+1<q.z)q[i]=y(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=y(q,r);cout<<q;}
      |                                                                                                                                                                                                                                                                 ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 134852 KB Output is correct
2 Correct 89 ms 134884 KB Output is correct
3 Correct 88 ms 134828 KB Output is correct
4 Correct 91 ms 134820 KB Output is correct
5 Correct 89 ms 134876 KB Output is correct
6 Correct 82 ms 134912 KB Output is correct
7 Correct 88 ms 134852 KB Output is correct
8 Correct 89 ms 134852 KB Output is correct
9 Correct 85 ms 134860 KB Output is correct
10 Correct 90 ms 134840 KB Output is correct
11 Correct 90 ms 134800 KB Output is correct
12 Correct 89 ms 134852 KB Output is correct
13 Correct 89 ms 134852 KB Output is correct
14 Correct 91 ms 134980 KB Output is correct
15 Correct 92 ms 134852 KB Output is correct
16 Correct 90 ms 134864 KB Output is correct
17 Correct 89 ms 134916 KB Output is correct
18 Correct 92 ms 134868 KB Output is correct
19 Correct 87 ms 134980 KB Output is correct
20 Correct 90 ms 134832 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 134852 KB Output is correct
2 Correct 89 ms 134884 KB Output is correct
3 Correct 88 ms 134828 KB Output is correct
4 Correct 91 ms 134820 KB Output is correct
5 Correct 89 ms 134876 KB Output is correct
6 Correct 82 ms 134912 KB Output is correct
7 Correct 88 ms 134852 KB Output is correct
8 Correct 89 ms 134852 KB Output is correct
9 Correct 85 ms 134860 KB Output is correct
10 Correct 90 ms 134840 KB Output is correct
11 Correct 90 ms 134800 KB Output is correct
12 Correct 89 ms 134852 KB Output is correct
13 Correct 89 ms 134852 KB Output is correct
14 Correct 91 ms 134980 KB Output is correct
15 Correct 92 ms 134852 KB Output is correct
16 Correct 90 ms 134864 KB Output is correct
17 Correct 89 ms 134916 KB Output is correct
18 Correct 92 ms 134868 KB Output is correct
19 Correct 87 ms 134980 KB Output is correct
20 Correct 90 ms 134832 KB Output is correct
21 Correct 85 ms 136136 KB Output is correct
22 Correct 92 ms 134832 KB Output is correct
23 Correct 107 ms 134832 KB Output is correct
24 Correct 91 ms 135020 KB Output is correct
25 Correct 89 ms 134848 KB Output is correct
26 Correct 85 ms 134828 KB Output is correct
27 Correct 94 ms 134880 KB Output is correct
28 Correct 93 ms 134852 KB Output is correct
29 Correct 90 ms 134896 KB Output is correct
30 Correct 91 ms 135036 KB Output is correct
31 Correct 89 ms 134848 KB Output is correct
32 Correct 92 ms 134816 KB Output is correct
33 Correct 89 ms 134916 KB Output is correct
34 Correct 90 ms 134852 KB Output is correct
35 Correct 87 ms 134912 KB Output is correct
36 Correct 84 ms 134840 KB Output is correct
37 Correct 89 ms 134980 KB Output is correct
38 Correct 92 ms 135168 KB Output is correct
39 Correct 84 ms 135236 KB Output is correct
40 Correct 94 ms 136216 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 134852 KB Output is correct
2 Correct 89 ms 134884 KB Output is correct
3 Correct 88 ms 134828 KB Output is correct
4 Correct 91 ms 134820 KB Output is correct
5 Correct 89 ms 134876 KB Output is correct
6 Correct 82 ms 134912 KB Output is correct
7 Correct 88 ms 134852 KB Output is correct
8 Correct 89 ms 134852 KB Output is correct
9 Correct 85 ms 134860 KB Output is correct
10 Correct 90 ms 134840 KB Output is correct
11 Correct 90 ms 134800 KB Output is correct
12 Correct 89 ms 134852 KB Output is correct
13 Correct 89 ms 134852 KB Output is correct
14 Correct 91 ms 134980 KB Output is correct
15 Correct 92 ms 134852 KB Output is correct
16 Correct 90 ms 134864 KB Output is correct
17 Correct 89 ms 134916 KB Output is correct
18 Correct 92 ms 134868 KB Output is correct
19 Correct 87 ms 134980 KB Output is correct
20 Correct 90 ms 134832 KB Output is correct
21 Correct 85 ms 136136 KB Output is correct
22 Correct 92 ms 134832 KB Output is correct
23 Correct 107 ms 134832 KB Output is correct
24 Correct 91 ms 135020 KB Output is correct
25 Correct 89 ms 134848 KB Output is correct
26 Correct 85 ms 134828 KB Output is correct
27 Correct 94 ms 134880 KB Output is correct
28 Correct 93 ms 134852 KB Output is correct
29 Correct 90 ms 134896 KB Output is correct
30 Correct 91 ms 135036 KB Output is correct
31 Correct 89 ms 134848 KB Output is correct
32 Correct 92 ms 134816 KB Output is correct
33 Correct 89 ms 134916 KB Output is correct
34 Correct 90 ms 134852 KB Output is correct
35 Correct 87 ms 134912 KB Output is correct
36 Correct 84 ms 134840 KB Output is correct
37 Correct 89 ms 134980 KB Output is correct
38 Correct 92 ms 135168 KB Output is correct
39 Correct 84 ms 135236 KB Output is correct
40 Correct 94 ms 136216 KB Output is correct
41 Correct 206 ms 135100 KB Output is correct
42 Correct 165 ms 134852 KB Output is correct
43 Correct 167 ms 134932 KB Output is correct
44 Correct 163 ms 134980 KB Output is correct
45 Correct 163 ms 134852 KB Output is correct
46 Correct 243 ms 134904 KB Output is correct
47 Correct 252 ms 134980 KB Output is correct
48 Correct 246 ms 134916 KB Output is correct
49 Correct 243 ms 134936 KB Output is correct
50 Correct 137 ms 134928 KB Output is correct
51 Correct 129 ms 134924 KB Output is correct
52 Correct 130 ms 134884 KB Output is correct
53 Correct 191 ms 135392 KB Output is correct
54 Correct 198 ms 135364 KB Output is correct
55 Correct 193 ms 135496 KB Output is correct
56 Correct 90 ms 135748 KB Output is correct
57 Correct 106 ms 152328 KB Output is correct
58 Correct 187 ms 213784 KB Output is correct
59 Correct 257 ms 222572 KB Output is correct
60 Correct 206 ms 135088 KB Output is correct
61 Correct 208 ms 135116 KB Output is correct