oj.uz

Submission #469712

# Submission time Handle Problem Language Result Execution time Memory
469712 2021-09-01T16:03:27 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 268 ms 222580 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:4:96: 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(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;}
      |                                                                                                ^
catinatree.cpp:4:132: 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(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;}
      |                                                                                                                                    ^
catinatree.cpp:4:163: 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(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;}
      |                                                                                                                                                                   ^
catinatree.cpp:4:212: 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(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;}
      |                                                                                                                                                                                                                    ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 134856 KB Output is correct
2 Correct 94 ms 134900 KB Output is correct
3 Correct 95 ms 134924 KB Output is correct
4 Correct 92 ms 134852 KB Output is correct
5 Correct 95 ms 134872 KB Output is correct
6 Correct 96 ms 134852 KB Output is correct
7 Correct 89 ms 134852 KB Output is correct
8 Correct 98 ms 134908 KB Output is correct
9 Correct 94 ms 134900 KB Output is correct
10 Correct 92 ms 134852 KB Output is correct
11 Correct 94 ms 134884 KB Output is correct
12 Correct 93 ms 134804 KB Output is correct
13 Correct 96 ms 134852 KB Output is correct
14 Correct 93 ms 134888 KB Output is correct
15 Correct 94 ms 134872 KB Output is correct
16 Correct 94 ms 134852 KB Output is correct
17 Correct 92 ms 134912 KB Output is correct
18 Correct 91 ms 134868 KB Output is correct
19 Correct 96 ms 134852 KB Output is correct
20 Correct 104 ms 134880 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 134856 KB Output is correct
2 Correct 94 ms 134900 KB Output is correct
3 Correct 95 ms 134924 KB Output is correct
4 Correct 92 ms 134852 KB Output is correct
5 Correct 95 ms 134872 KB Output is correct
6 Correct 96 ms 134852 KB Output is correct
7 Correct 89 ms 134852 KB Output is correct
8 Correct 98 ms 134908 KB Output is correct
9 Correct 94 ms 134900 KB Output is correct
10 Correct 92 ms 134852 KB Output is correct
11 Correct 94 ms 134884 KB Output is correct
12 Correct 93 ms 134804 KB Output is correct
13 Correct 96 ms 134852 KB Output is correct
14 Correct 93 ms 134888 KB Output is correct
15 Correct 94 ms 134872 KB Output is correct
16 Correct 94 ms 134852 KB Output is correct
17 Correct 92 ms 134912 KB Output is correct
18 Correct 91 ms 134868 KB Output is correct
19 Correct 96 ms 134852 KB Output is correct
20 Correct 104 ms 134880 KB Output is correct
21 Correct 100 ms 136172 KB Output is correct
22 Correct 95 ms 134892 KB Output is correct
23 Correct 93 ms 134908 KB Output is correct
24 Correct 112 ms 134924 KB Output is correct
25 Correct 98 ms 134980 KB Output is correct
26 Correct 94 ms 134852 KB Output is correct
27 Correct 93 ms 134816 KB Output is correct
28 Correct 97 ms 134848 KB Output is correct
29 Correct 96 ms 134928 KB Output is correct
30 Correct 94 ms 134924 KB Output is correct
31 Correct 95 ms 134976 KB Output is correct
32 Correct 94 ms 134828 KB Output is correct
33 Correct 96 ms 134892 KB Output is correct
34 Correct 95 ms 134836 KB Output is correct
35 Correct 107 ms 134884 KB Output is correct
36 Correct 110 ms 134920 KB Output is correct
37 Correct 96 ms 134992 KB Output is correct
38 Correct 95 ms 135088 KB Output is correct
39 Correct 90 ms 135268 KB Output is correct
40 Correct 95 ms 136132 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 134856 KB Output is correct
2 Correct 94 ms 134900 KB Output is correct
3 Correct 95 ms 134924 KB Output is correct
4 Correct 92 ms 134852 KB Output is correct
5 Correct 95 ms 134872 KB Output is correct
6 Correct 96 ms 134852 KB Output is correct
7 Correct 89 ms 134852 KB Output is correct
8 Correct 98 ms 134908 KB Output is correct
9 Correct 94 ms 134900 KB Output is correct
10 Correct 92 ms 134852 KB Output is correct
11 Correct 94 ms 134884 KB Output is correct
12 Correct 93 ms 134804 KB Output is correct
13 Correct 96 ms 134852 KB Output is correct
14 Correct 93 ms 134888 KB Output is correct
15 Correct 94 ms 134872 KB Output is correct
16 Correct 94 ms 134852 KB Output is correct
17 Correct 92 ms 134912 KB Output is correct
18 Correct 91 ms 134868 KB Output is correct
19 Correct 96 ms 134852 KB Output is correct
20 Correct 104 ms 134880 KB Output is correct
21 Correct 100 ms 136172 KB Output is correct
22 Correct 95 ms 134892 KB Output is correct
23 Correct 93 ms 134908 KB Output is correct
24 Correct 112 ms 134924 KB Output is correct
25 Correct 98 ms 134980 KB Output is correct
26 Correct 94 ms 134852 KB Output is correct
27 Correct 93 ms 134816 KB Output is correct
28 Correct 97 ms 134848 KB Output is correct
29 Correct 96 ms 134928 KB Output is correct
30 Correct 94 ms 134924 KB Output is correct
31 Correct 95 ms 134976 KB Output is correct
32 Correct 94 ms 134828 KB Output is correct
33 Correct 96 ms 134892 KB Output is correct
34 Correct 95 ms 134836 KB Output is correct
35 Correct 107 ms 134884 KB Output is correct
36 Correct 110 ms 134920 KB Output is correct
37 Correct 96 ms 134992 KB Output is correct
38 Correct 95 ms 135088 KB Output is correct
39 Correct 90 ms 135268 KB Output is correct
40 Correct 95 ms 136132 KB Output is correct
41 Correct 209 ms 135124 KB Output is correct
42 Correct 172 ms 134836 KB Output is correct
43 Correct 167 ms 134900 KB Output is correct
44 Correct 170 ms 134908 KB Output is correct
45 Correct 166 ms 134936 KB Output is correct
46 Correct 261 ms 134928 KB Output is correct
47 Correct 254 ms 135000 KB Output is correct
48 Correct 256 ms 134824 KB Output is correct
49 Correct 253 ms 134880 KB Output is correct
50 Correct 158 ms 134940 KB Output is correct
51 Correct 143 ms 134864 KB Output is correct
52 Correct 142 ms 134876 KB Output is correct
53 Correct 202 ms 135440 KB Output is correct
54 Correct 205 ms 135436 KB Output is correct
55 Correct 199 ms 135344 KB Output is correct
56 Correct 95 ms 135724 KB Output is correct
57 Correct 114 ms 152400 KB Output is correct
58 Correct 193 ms 213768 KB Output is correct
59 Correct 268 ms 222580 KB Output is correct
60 Correct 209 ms 135008 KB Output is correct
61 Correct 215 ms 134980 KB Output is correct