oj.uz

Submission #469718

# Submission time Handle Problem Language Result Execution time Memory
469718 2021-09-01T16:16:18 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 269 ms 222532 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 97 ms 134848 KB Output is correct
2 Correct 94 ms 134896 KB Output is correct
3 Correct 94 ms 134860 KB Output is correct
4 Correct 94 ms 134868 KB Output is correct
5 Correct 102 ms 134904 KB Output is correct
6 Correct 93 ms 134924 KB Output is correct
7 Correct 92 ms 134852 KB Output is correct
8 Correct 95 ms 134984 KB Output is correct
9 Correct 96 ms 134816 KB Output is correct
10 Correct 94 ms 134816 KB Output is correct
11 Correct 95 ms 134880 KB Output is correct
12 Correct 94 ms 134868 KB Output is correct
13 Correct 95 ms 134980 KB Output is correct
14 Correct 91 ms 134824 KB Output is correct
15 Correct 96 ms 134836 KB Output is correct
16 Correct 93 ms 134856 KB Output is correct
17 Correct 86 ms 134916 KB Output is correct
18 Correct 98 ms 134996 KB Output is correct
19 Correct 94 ms 134852 KB Output is correct
20 Correct 93 ms 134864 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 134848 KB Output is correct
2 Correct 94 ms 134896 KB Output is correct
3 Correct 94 ms 134860 KB Output is correct
4 Correct 94 ms 134868 KB Output is correct
5 Correct 102 ms 134904 KB Output is correct
6 Correct 93 ms 134924 KB Output is correct
7 Correct 92 ms 134852 KB Output is correct
8 Correct 95 ms 134984 KB Output is correct
9 Correct 96 ms 134816 KB Output is correct
10 Correct 94 ms 134816 KB Output is correct
11 Correct 95 ms 134880 KB Output is correct
12 Correct 94 ms 134868 KB Output is correct
13 Correct 95 ms 134980 KB Output is correct
14 Correct 91 ms 134824 KB Output is correct
15 Correct 96 ms 134836 KB Output is correct
16 Correct 93 ms 134856 KB Output is correct
17 Correct 86 ms 134916 KB Output is correct
18 Correct 98 ms 134996 KB Output is correct
19 Correct 94 ms 134852 KB Output is correct
20 Correct 93 ms 134864 KB Output is correct
21 Correct 94 ms 136108 KB Output is correct
22 Correct 95 ms 135108 KB Output is correct
23 Correct 94 ms 134920 KB Output is correct
24 Correct 93 ms 134920 KB Output is correct
25 Correct 93 ms 134852 KB Output is correct
26 Correct 86 ms 134872 KB Output is correct
27 Correct 88 ms 134924 KB Output is correct
28 Correct 97 ms 134924 KB Output is correct
29 Correct 92 ms 134864 KB Output is correct
30 Correct 93 ms 134812 KB Output is correct
31 Correct 94 ms 134852 KB Output is correct
32 Correct 94 ms 134836 KB Output is correct
33 Correct 96 ms 134808 KB Output is correct
34 Correct 90 ms 134840 KB Output is correct
35 Correct 95 ms 134876 KB Output is correct
36 Correct 90 ms 134900 KB Output is correct
37 Correct 92 ms 134980 KB Output is correct
38 Correct 94 ms 135056 KB Output is correct
39 Correct 96 ms 135348 KB Output is correct
40 Correct 95 ms 136224 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 134848 KB Output is correct
2 Correct 94 ms 134896 KB Output is correct
3 Correct 94 ms 134860 KB Output is correct
4 Correct 94 ms 134868 KB Output is correct
5 Correct 102 ms 134904 KB Output is correct
6 Correct 93 ms 134924 KB Output is correct
7 Correct 92 ms 134852 KB Output is correct
8 Correct 95 ms 134984 KB Output is correct
9 Correct 96 ms 134816 KB Output is correct
10 Correct 94 ms 134816 KB Output is correct
11 Correct 95 ms 134880 KB Output is correct
12 Correct 94 ms 134868 KB Output is correct
13 Correct 95 ms 134980 KB Output is correct
14 Correct 91 ms 134824 KB Output is correct
15 Correct 96 ms 134836 KB Output is correct
16 Correct 93 ms 134856 KB Output is correct
17 Correct 86 ms 134916 KB Output is correct
18 Correct 98 ms 134996 KB Output is correct
19 Correct 94 ms 134852 KB Output is correct
20 Correct 93 ms 134864 KB Output is correct
21 Correct 94 ms 136108 KB Output is correct
22 Correct 95 ms 135108 KB Output is correct
23 Correct 94 ms 134920 KB Output is correct
24 Correct 93 ms 134920 KB Output is correct
25 Correct 93 ms 134852 KB Output is correct
26 Correct 86 ms 134872 KB Output is correct
27 Correct 88 ms 134924 KB Output is correct
28 Correct 97 ms 134924 KB Output is correct
29 Correct 92 ms 134864 KB Output is correct
30 Correct 93 ms 134812 KB Output is correct
31 Correct 94 ms 134852 KB Output is correct
32 Correct 94 ms 134836 KB Output is correct
33 Correct 96 ms 134808 KB Output is correct
34 Correct 90 ms 134840 KB Output is correct
35 Correct 95 ms 134876 KB Output is correct
36 Correct 90 ms 134900 KB Output is correct
37 Correct 92 ms 134980 KB Output is correct
38 Correct 94 ms 135056 KB Output is correct
39 Correct 96 ms 135348 KB Output is correct
40 Correct 95 ms 136224 KB Output is correct
41 Correct 213 ms 135036 KB Output is correct
42 Correct 173 ms 134852 KB Output is correct
43 Correct 169 ms 135020 KB Output is correct
44 Correct 169 ms 134852 KB Output is correct
45 Correct 172 ms 134872 KB Output is correct
46 Correct 258 ms 134852 KB Output is correct
47 Correct 257 ms 134920 KB Output is correct
48 Correct 251 ms 134852 KB Output is correct
49 Correct 260 ms 135032 KB Output is correct
50 Correct 144 ms 134904 KB Output is correct
51 Correct 139 ms 134820 KB Output is correct
52 Correct 140 ms 134980 KB Output is correct
53 Correct 194 ms 135436 KB Output is correct
54 Correct 198 ms 135364 KB Output is correct
55 Correct 200 ms 135532 KB Output is correct
56 Correct 93 ms 135748 KB Output is correct
57 Correct 110 ms 152376 KB Output is correct
58 Correct 185 ms 213756 KB Output is correct
59 Correct 269 ms 222532 KB Output is correct
60 Correct 207 ms 135076 KB Output is correct
61 Correct 214 ms 134980 KB Output is correct