oj.uz

Submission #469374

# Submission time Handle Problem Language Result Execution time Memory
469374 2021-08-31T16:23:45 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 294 ms 220900 KB 
#include <bits/stdc++.h>
#define z size()
using namespace std;int N,D,x,q=0;deque<int> c[200'000];
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(int 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(int 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(int i=1;i<N;i++){cin>>x;c[x].push_back(i);}for(int r:d(0))q=max(q,r);cout<<q<<'\n';}

Compilation message

catinatree.cpp: In function 'std::deque<int> d(int)':
catinatree.cpp:4:101: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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(int 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(int 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;}
      |                                                                                                     ^
catinatree.cpp:4:137: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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(int 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(int 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;}
      |                                                                                                                                         ^
catinatree.cpp:4:168: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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(int 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(int 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;}
      |                                                                                                                                                                        ^
catinatree.cpp:4:222: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | 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(int 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(int 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;}
      |                                                                                                                                                                                                                              ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134856 KB Output is correct
2 Correct 90 ms 134840 KB Output is correct
3 Correct 87 ms 134868 KB Output is correct
4 Correct 87 ms 134852 KB Output is correct
5 Correct 87 ms 134896 KB Output is correct
6 Correct 91 ms 134840 KB Output is correct
7 Correct 89 ms 134808 KB Output is correct
8 Correct 94 ms 134880 KB Output is correct
9 Correct 98 ms 134920 KB Output is correct
10 Correct 88 ms 134888 KB Output is correct
11 Correct 87 ms 134900 KB Output is correct
12 Correct 89 ms 134808 KB Output is correct
13 Correct 89 ms 134916 KB Output is correct
14 Correct 108 ms 134852 KB Output is correct
15 Correct 87 ms 134852 KB Output is correct
16 Correct 87 ms 134900 KB Output is correct
17 Correct 88 ms 134868 KB Output is correct
18 Correct 96 ms 134840 KB Output is correct
19 Correct 96 ms 135088 KB Output is correct
20 Correct 88 ms 134852 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134856 KB Output is correct
2 Correct 90 ms 134840 KB Output is correct
3 Correct 87 ms 134868 KB Output is correct
4 Correct 87 ms 134852 KB Output is correct
5 Correct 87 ms 134896 KB Output is correct
6 Correct 91 ms 134840 KB Output is correct
7 Correct 89 ms 134808 KB Output is correct
8 Correct 94 ms 134880 KB Output is correct
9 Correct 98 ms 134920 KB Output is correct
10 Correct 88 ms 134888 KB Output is correct
11 Correct 87 ms 134900 KB Output is correct
12 Correct 89 ms 134808 KB Output is correct
13 Correct 89 ms 134916 KB Output is correct
14 Correct 108 ms 134852 KB Output is correct
15 Correct 87 ms 134852 KB Output is correct
16 Correct 87 ms 134900 KB Output is correct
17 Correct 88 ms 134868 KB Output is correct
18 Correct 96 ms 134840 KB Output is correct
19 Correct 96 ms 135088 KB Output is correct
20 Correct 88 ms 134852 KB Output is correct
21 Correct 91 ms 136180 KB Output is correct
22 Correct 92 ms 134816 KB Output is correct
23 Correct 91 ms 134988 KB Output is correct
24 Correct 87 ms 134888 KB Output is correct
25 Correct 89 ms 134804 KB Output is correct
26 Correct 102 ms 134872 KB Output is correct
27 Correct 88 ms 134916 KB Output is correct
28 Correct 87 ms 134812 KB Output is correct
29 Correct 87 ms 134924 KB Output is correct
30 Correct 90 ms 134892 KB Output is correct
31 Correct 91 ms 134816 KB Output is correct
32 Correct 88 ms 134912 KB Output is correct
33 Correct 87 ms 134852 KB Output is correct
34 Correct 97 ms 134932 KB Output is correct
35 Correct 93 ms 134924 KB Output is correct
36 Correct 100 ms 134804 KB Output is correct
37 Correct 89 ms 134884 KB Output is correct
38 Correct 90 ms 135056 KB Output is correct
39 Correct 90 ms 135232 KB Output is correct
40 Correct 90 ms 136088 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134856 KB Output is correct
2 Correct 90 ms 134840 KB Output is correct
3 Correct 87 ms 134868 KB Output is correct
4 Correct 87 ms 134852 KB Output is correct
5 Correct 87 ms 134896 KB Output is correct
6 Correct 91 ms 134840 KB Output is correct
7 Correct 89 ms 134808 KB Output is correct
8 Correct 94 ms 134880 KB Output is correct
9 Correct 98 ms 134920 KB Output is correct
10 Correct 88 ms 134888 KB Output is correct
11 Correct 87 ms 134900 KB Output is correct
12 Correct 89 ms 134808 KB Output is correct
13 Correct 89 ms 134916 KB Output is correct
14 Correct 108 ms 134852 KB Output is correct
15 Correct 87 ms 134852 KB Output is correct
16 Correct 87 ms 134900 KB Output is correct
17 Correct 88 ms 134868 KB Output is correct
18 Correct 96 ms 134840 KB Output is correct
19 Correct 96 ms 135088 KB Output is correct
20 Correct 88 ms 134852 KB Output is correct
21 Correct 91 ms 136180 KB Output is correct
22 Correct 92 ms 134816 KB Output is correct
23 Correct 91 ms 134988 KB Output is correct
24 Correct 87 ms 134888 KB Output is correct
25 Correct 89 ms 134804 KB Output is correct
26 Correct 102 ms 134872 KB Output is correct
27 Correct 88 ms 134916 KB Output is correct
28 Correct 87 ms 134812 KB Output is correct
29 Correct 87 ms 134924 KB Output is correct
30 Correct 90 ms 134892 KB Output is correct
31 Correct 91 ms 134816 KB Output is correct
32 Correct 88 ms 134912 KB Output is correct
33 Correct 87 ms 134852 KB Output is correct
34 Correct 97 ms 134932 KB Output is correct
35 Correct 93 ms 134924 KB Output is correct
36 Correct 100 ms 134804 KB Output is correct
37 Correct 89 ms 134884 KB Output is correct
38 Correct 90 ms 135056 KB Output is correct
39 Correct 90 ms 135232 KB Output is correct
40 Correct 90 ms 136088 KB Output is correct
41 Correct 212 ms 135136 KB Output is correct
42 Correct 159 ms 134900 KB Output is correct
43 Correct 162 ms 134908 KB Output is correct
44 Correct 169 ms 134856 KB Output is correct
45 Correct 189 ms 134932 KB Output is correct
46 Correct 247 ms 134980 KB Output is correct
47 Correct 246 ms 135040 KB Output is correct
48 Correct 241 ms 134932 KB Output is correct
49 Correct 244 ms 134928 KB Output is correct
50 Correct 150 ms 135056 KB Output is correct
51 Correct 131 ms 134928 KB Output is correct
52 Correct 133 ms 134900 KB Output is correct
53 Correct 188 ms 135364 KB Output is correct
54 Correct 192 ms 135440 KB Output is correct
55 Correct 192 ms 135360 KB Output is correct
56 Correct 90 ms 135652 KB Output is correct
57 Correct 121 ms 152016 KB Output is correct
58 Correct 189 ms 212292 KB Output is correct
59 Correct 294 ms 220900 KB Output is correct
60 Correct 208 ms 135108 KB Output is correct
61 Correct 198 ms 135036 KB Output is correct