Submission #463960

# Submission time Handle Problem Language Result Execution time Memory
463960 2021-08-12T05:41:15 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
255 ms 220924 KB
#include <iostream>
#include <deque>
#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:9:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         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)));
      |                      ^
catinatree.cpp:9:58: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         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)));
      |                                                          ^
catinatree.cpp:9:89: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         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)));
      |                                                                                         ^
catinatree.cpp:10:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |         for(int i=a.z;i>=0;i--) if(i+1<q.z) q[i]=max(q[i],q[i+1]);}
      |                                       ^
catinatree.cpp: In function 'int main()':
catinatree.cpp:14:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   14 |     for(int r:d(0))q=max(q,r);cout<<q<<'\n';}
      |     ^~~
catinatree.cpp:14:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   14 |     for(int r:d(0))q=max(q,r);cout<<q<<'\n';}
      |                               ^~~~
# Verdict Execution time Memory Grader output
1 Correct 90 ms 134852 KB Output is correct
2 Correct 92 ms 134808 KB Output is correct
3 Correct 89 ms 134896 KB Output is correct
4 Correct 89 ms 134852 KB Output is correct
5 Correct 89 ms 134920 KB Output is correct
6 Correct 89 ms 134880 KB Output is correct
7 Correct 89 ms 134852 KB Output is correct
8 Correct 90 ms 134868 KB Output is correct
9 Correct 89 ms 134904 KB Output is correct
10 Correct 86 ms 134904 KB Output is correct
11 Correct 88 ms 134916 KB Output is correct
12 Correct 90 ms 134940 KB Output is correct
13 Correct 90 ms 134840 KB Output is correct
14 Correct 90 ms 134988 KB Output is correct
15 Correct 89 ms 134860 KB Output is correct
16 Correct 89 ms 134916 KB Output is correct
17 Correct 89 ms 134872 KB Output is correct
18 Correct 89 ms 134896 KB Output is correct
19 Correct 90 ms 134880 KB Output is correct
20 Correct 89 ms 134796 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 90 ms 134852 KB Output is correct
2 Correct 92 ms 134808 KB Output is correct
3 Correct 89 ms 134896 KB Output is correct
4 Correct 89 ms 134852 KB Output is correct
5 Correct 89 ms 134920 KB Output is correct
6 Correct 89 ms 134880 KB Output is correct
7 Correct 89 ms 134852 KB Output is correct
8 Correct 90 ms 134868 KB Output is correct
9 Correct 89 ms 134904 KB Output is correct
10 Correct 86 ms 134904 KB Output is correct
11 Correct 88 ms 134916 KB Output is correct
12 Correct 90 ms 134940 KB Output is correct
13 Correct 90 ms 134840 KB Output is correct
14 Correct 90 ms 134988 KB Output is correct
15 Correct 89 ms 134860 KB Output is correct
16 Correct 89 ms 134916 KB Output is correct
17 Correct 89 ms 134872 KB Output is correct
18 Correct 89 ms 134896 KB Output is correct
19 Correct 90 ms 134880 KB Output is correct
20 Correct 89 ms 134796 KB Output is correct
21 Correct 89 ms 136096 KB Output is correct
22 Correct 89 ms 134860 KB Output is correct
23 Correct 92 ms 134920 KB Output is correct
24 Correct 91 ms 134912 KB Output is correct
25 Correct 91 ms 135032 KB Output is correct
26 Correct 92 ms 134964 KB Output is correct
27 Correct 90 ms 134864 KB Output is correct
28 Correct 92 ms 134884 KB Output is correct
29 Correct 81 ms 134852 KB Output is correct
30 Correct 94 ms 134940 KB Output is correct
31 Correct 91 ms 134856 KB Output is correct
32 Correct 92 ms 134848 KB Output is correct
33 Correct 91 ms 134880 KB Output is correct
34 Correct 90 ms 134848 KB Output is correct
35 Correct 92 ms 134872 KB Output is correct
36 Correct 90 ms 134820 KB Output is correct
37 Correct 89 ms 134980 KB Output is correct
38 Correct 89 ms 135108 KB Output is correct
39 Correct 90 ms 135236 KB Output is correct
40 Correct 91 ms 136092 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 90 ms 134852 KB Output is correct
2 Correct 92 ms 134808 KB Output is correct
3 Correct 89 ms 134896 KB Output is correct
4 Correct 89 ms 134852 KB Output is correct
5 Correct 89 ms 134920 KB Output is correct
6 Correct 89 ms 134880 KB Output is correct
7 Correct 89 ms 134852 KB Output is correct
8 Correct 90 ms 134868 KB Output is correct
9 Correct 89 ms 134904 KB Output is correct
10 Correct 86 ms 134904 KB Output is correct
11 Correct 88 ms 134916 KB Output is correct
12 Correct 90 ms 134940 KB Output is correct
13 Correct 90 ms 134840 KB Output is correct
14 Correct 90 ms 134988 KB Output is correct
15 Correct 89 ms 134860 KB Output is correct
16 Correct 89 ms 134916 KB Output is correct
17 Correct 89 ms 134872 KB Output is correct
18 Correct 89 ms 134896 KB Output is correct
19 Correct 90 ms 134880 KB Output is correct
20 Correct 89 ms 134796 KB Output is correct
21 Correct 89 ms 136096 KB Output is correct
22 Correct 89 ms 134860 KB Output is correct
23 Correct 92 ms 134920 KB Output is correct
24 Correct 91 ms 134912 KB Output is correct
25 Correct 91 ms 135032 KB Output is correct
26 Correct 92 ms 134964 KB Output is correct
27 Correct 90 ms 134864 KB Output is correct
28 Correct 92 ms 134884 KB Output is correct
29 Correct 81 ms 134852 KB Output is correct
30 Correct 94 ms 134940 KB Output is correct
31 Correct 91 ms 134856 KB Output is correct
32 Correct 92 ms 134848 KB Output is correct
33 Correct 91 ms 134880 KB Output is correct
34 Correct 90 ms 134848 KB Output is correct
35 Correct 92 ms 134872 KB Output is correct
36 Correct 90 ms 134820 KB Output is correct
37 Correct 89 ms 134980 KB Output is correct
38 Correct 89 ms 135108 KB Output is correct
39 Correct 90 ms 135236 KB Output is correct
40 Correct 91 ms 136092 KB Output is correct
41 Correct 212 ms 135136 KB Output is correct
42 Correct 161 ms 134880 KB Output is correct
43 Correct 173 ms 134980 KB Output is correct
44 Correct 162 ms 134932 KB Output is correct
45 Correct 161 ms 134900 KB Output is correct
46 Correct 243 ms 134968 KB Output is correct
47 Correct 242 ms 134932 KB Output is correct
48 Correct 246 ms 134836 KB Output is correct
49 Correct 244 ms 134964 KB Output is correct
50 Correct 135 ms 134904 KB Output is correct
51 Correct 131 ms 134924 KB Output is correct
52 Correct 132 ms 134812 KB Output is correct
53 Correct 189 ms 135360 KB Output is correct
54 Correct 198 ms 135368 KB Output is correct
55 Correct 194 ms 135416 KB Output is correct
56 Correct 91 ms 135688 KB Output is correct
57 Correct 108 ms 152168 KB Output is correct
58 Correct 185 ms 212308 KB Output is correct
59 Correct 255 ms 220924 KB Output is correct
60 Correct 202 ms 135120 KB Output is correct
61 Correct 206 ms 135008 KB Output is correct