oj.uz

Submission #463961

# Submission time Handle Problem Language Result Execution time Memory
463961 2021-08-12T05:43:05 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 253 ms 220920 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:7:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |         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:7:58: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |         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:7:89: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |         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:8:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |         for(int i=a.z;i>=0;i--) if(i+1<q.z) q[i]=max(q[i],q[i+1]);}
      |                                       ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134916 KB Output is correct
2 Correct 90 ms 134868 KB Output is correct
3 Correct 90 ms 134852 KB Output is correct
4 Correct 90 ms 135004 KB Output is correct
5 Correct 90 ms 134916 KB Output is correct
6 Correct 89 ms 134920 KB Output is correct
7 Correct 90 ms 134852 KB Output is correct
8 Correct 94 ms 134968 KB Output is correct
9 Correct 92 ms 134888 KB Output is correct
10 Correct 91 ms 134836 KB Output is correct
11 Correct 89 ms 134868 KB Output is correct
12 Correct 90 ms 134840 KB Output is correct
13 Correct 89 ms 134824 KB Output is correct
14 Correct 89 ms 134884 KB Output is correct
15 Correct 91 ms 134904 KB Output is correct
16 Correct 89 ms 134908 KB Output is correct
17 Correct 103 ms 134876 KB Output is correct
18 Correct 89 ms 134900 KB Output is correct
19 Correct 92 ms 134864 KB Output is correct
20 Correct 88 ms 134916 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134916 KB Output is correct
2 Correct 90 ms 134868 KB Output is correct
3 Correct 90 ms 134852 KB Output is correct
4 Correct 90 ms 135004 KB Output is correct
5 Correct 90 ms 134916 KB Output is correct
6 Correct 89 ms 134920 KB Output is correct
7 Correct 90 ms 134852 KB Output is correct
8 Correct 94 ms 134968 KB Output is correct
9 Correct 92 ms 134888 KB Output is correct
10 Correct 91 ms 134836 KB Output is correct
11 Correct 89 ms 134868 KB Output is correct
12 Correct 90 ms 134840 KB Output is correct
13 Correct 89 ms 134824 KB Output is correct
14 Correct 89 ms 134884 KB Output is correct
15 Correct 91 ms 134904 KB Output is correct
16 Correct 89 ms 134908 KB Output is correct
17 Correct 103 ms 134876 KB Output is correct
18 Correct 89 ms 134900 KB Output is correct
19 Correct 92 ms 134864 KB Output is correct
20 Correct 88 ms 134916 KB Output is correct
21 Correct 93 ms 136108 KB Output is correct
22 Correct 94 ms 134832 KB Output is correct
23 Correct 90 ms 134912 KB Output is correct
24 Correct 96 ms 135036 KB Output is correct
25 Correct 90 ms 134852 KB Output is correct
26 Correct 84 ms 134876 KB Output is correct
27 Correct 90 ms 134824 KB Output is correct
28 Correct 89 ms 134844 KB Output is correct
29 Correct 85 ms 134852 KB Output is correct
30 Correct 87 ms 134896 KB Output is correct
31 Correct 91 ms 134828 KB Output is correct
32 Correct 91 ms 134920 KB Output is correct
33 Correct 89 ms 134888 KB Output is correct
34 Correct 90 ms 134828 KB Output is correct
35 Correct 93 ms 134852 KB Output is correct
36 Correct 92 ms 135048 KB Output is correct
37 Correct 93 ms 134948 KB Output is correct
38 Correct 89 ms 135084 KB Output is correct
39 Correct 92 ms 135220 KB Output is correct
40 Correct 105 ms 136104 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134916 KB Output is correct
2 Correct 90 ms 134868 KB Output is correct
3 Correct 90 ms 134852 KB Output is correct
4 Correct 90 ms 135004 KB Output is correct
5 Correct 90 ms 134916 KB Output is correct
6 Correct 89 ms 134920 KB Output is correct
7 Correct 90 ms 134852 KB Output is correct
8 Correct 94 ms 134968 KB Output is correct
9 Correct 92 ms 134888 KB Output is correct
10 Correct 91 ms 134836 KB Output is correct
11 Correct 89 ms 134868 KB Output is correct
12 Correct 90 ms 134840 KB Output is correct
13 Correct 89 ms 134824 KB Output is correct
14 Correct 89 ms 134884 KB Output is correct
15 Correct 91 ms 134904 KB Output is correct
16 Correct 89 ms 134908 KB Output is correct
17 Correct 103 ms 134876 KB Output is correct
18 Correct 89 ms 134900 KB Output is correct
19 Correct 92 ms 134864 KB Output is correct
20 Correct 88 ms 134916 KB Output is correct
21 Correct 93 ms 136108 KB Output is correct
22 Correct 94 ms 134832 KB Output is correct
23 Correct 90 ms 134912 KB Output is correct
24 Correct 96 ms 135036 KB Output is correct
25 Correct 90 ms 134852 KB Output is correct
26 Correct 84 ms 134876 KB Output is correct
27 Correct 90 ms 134824 KB Output is correct
28 Correct 89 ms 134844 KB Output is correct
29 Correct 85 ms 134852 KB Output is correct
30 Correct 87 ms 134896 KB Output is correct
31 Correct 91 ms 134828 KB Output is correct
32 Correct 91 ms 134920 KB Output is correct
33 Correct 89 ms 134888 KB Output is correct
34 Correct 90 ms 134828 KB Output is correct
35 Correct 93 ms 134852 KB Output is correct
36 Correct 92 ms 135048 KB Output is correct
37 Correct 93 ms 134948 KB Output is correct
38 Correct 89 ms 135084 KB Output is correct
39 Correct 92 ms 135220 KB Output is correct
40 Correct 105 ms 136104 KB Output is correct
41 Correct 203 ms 135072 KB Output is correct
42 Correct 162 ms 134908 KB Output is correct
43 Correct 174 ms 134852 KB Output is correct
44 Correct 162 ms 135096 KB Output is correct
45 Correct 166 ms 134880 KB Output is correct
46 Correct 252 ms 134908 KB Output is correct
47 Correct 251 ms 134912 KB Output is correct
48 Correct 241 ms 134816 KB Output is correct
49 Correct 252 ms 135036 KB Output is correct
50 Correct 132 ms 134852 KB Output is correct
51 Correct 134 ms 134908 KB Output is correct
52 Correct 147 ms 134828 KB Output is correct
53 Correct 192 ms 135452 KB Output is correct
54 Correct 192 ms 135376 KB Output is correct
55 Correct 190 ms 135440 KB Output is correct
56 Correct 86 ms 135748 KB Output is correct
57 Correct 104 ms 152024 KB Output is correct
58 Correct 180 ms 212304 KB Output is correct
59 Correct 253 ms 220920 KB Output is correct
60 Correct 200 ms 135040 KB Output is correct
61 Correct 214 ms 134956 KB Output is correct