oj.uz

Submission #463962

# Submission time Handle Problem Language Result Execution time Memory
463962 2021-08-12T05:44:46 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 276 ms 221112 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:5:107: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | 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:5:143: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | 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:5:174: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | 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:5:229: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | 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 134852 KB Output is correct
2 Correct 89 ms 134900 KB Output is correct
3 Correct 90 ms 134988 KB Output is correct
4 Correct 89 ms 134936 KB Output is correct
5 Correct 93 ms 134832 KB Output is correct
6 Correct 92 ms 134900 KB Output is correct
7 Correct 89 ms 134804 KB Output is correct
8 Correct 91 ms 134848 KB Output is correct
9 Correct 89 ms 134916 KB Output is correct
10 Correct 89 ms 134920 KB Output is correct
11 Correct 90 ms 134864 KB Output is correct
12 Correct 88 ms 134872 KB Output is correct
13 Correct 89 ms 134792 KB Output is correct
14 Correct 92 ms 134824 KB Output is correct
15 Correct 92 ms 134916 KB Output is correct
16 Correct 90 ms 134984 KB Output is correct
17 Correct 89 ms 134872 KB Output is correct
18 Correct 92 ms 134792 KB Output is correct
19 Correct 88 ms 134852 KB Output is correct
20 Correct 90 ms 134912 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134852 KB Output is correct
2 Correct 89 ms 134900 KB Output is correct
3 Correct 90 ms 134988 KB Output is correct
4 Correct 89 ms 134936 KB Output is correct
5 Correct 93 ms 134832 KB Output is correct
6 Correct 92 ms 134900 KB Output is correct
7 Correct 89 ms 134804 KB Output is correct
8 Correct 91 ms 134848 KB Output is correct
9 Correct 89 ms 134916 KB Output is correct
10 Correct 89 ms 134920 KB Output is correct
11 Correct 90 ms 134864 KB Output is correct
12 Correct 88 ms 134872 KB Output is correct
13 Correct 89 ms 134792 KB Output is correct
14 Correct 92 ms 134824 KB Output is correct
15 Correct 92 ms 134916 KB Output is correct
16 Correct 90 ms 134984 KB Output is correct
17 Correct 89 ms 134872 KB Output is correct
18 Correct 92 ms 134792 KB Output is correct
19 Correct 88 ms 134852 KB Output is correct
20 Correct 90 ms 134912 KB Output is correct
21 Correct 91 ms 136164 KB Output is correct
22 Correct 90 ms 134852 KB Output is correct
23 Correct 89 ms 134920 KB Output is correct
24 Correct 94 ms 134924 KB Output is correct
25 Correct 89 ms 134852 KB Output is correct
26 Correct 92 ms 134856 KB Output is correct
27 Correct 87 ms 134928 KB Output is correct
28 Correct 91 ms 134844 KB Output is correct
29 Correct 95 ms 134924 KB Output is correct
30 Correct 94 ms 134876 KB Output is correct
31 Correct 93 ms 134852 KB Output is correct
32 Correct 93 ms 134820 KB Output is correct
33 Correct 100 ms 134964 KB Output is correct
34 Correct 85 ms 134812 KB Output is correct
35 Correct 95 ms 134860 KB Output is correct
36 Correct 88 ms 134852 KB Output is correct
37 Correct 92 ms 135028 KB Output is correct
38 Correct 103 ms 135108 KB Output is correct
39 Correct 91 ms 135296 KB Output is correct
40 Correct 90 ms 136184 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 134852 KB Output is correct
2 Correct 89 ms 134900 KB Output is correct
3 Correct 90 ms 134988 KB Output is correct
4 Correct 89 ms 134936 KB Output is correct
5 Correct 93 ms 134832 KB Output is correct
6 Correct 92 ms 134900 KB Output is correct
7 Correct 89 ms 134804 KB Output is correct
8 Correct 91 ms 134848 KB Output is correct
9 Correct 89 ms 134916 KB Output is correct
10 Correct 89 ms 134920 KB Output is correct
11 Correct 90 ms 134864 KB Output is correct
12 Correct 88 ms 134872 KB Output is correct
13 Correct 89 ms 134792 KB Output is correct
14 Correct 92 ms 134824 KB Output is correct
15 Correct 92 ms 134916 KB Output is correct
16 Correct 90 ms 134984 KB Output is correct
17 Correct 89 ms 134872 KB Output is correct
18 Correct 92 ms 134792 KB Output is correct
19 Correct 88 ms 134852 KB Output is correct
20 Correct 90 ms 134912 KB Output is correct
21 Correct 91 ms 136164 KB Output is correct
22 Correct 90 ms 134852 KB Output is correct
23 Correct 89 ms 134920 KB Output is correct
24 Correct 94 ms 134924 KB Output is correct
25 Correct 89 ms 134852 KB Output is correct
26 Correct 92 ms 134856 KB Output is correct
27 Correct 87 ms 134928 KB Output is correct
28 Correct 91 ms 134844 KB Output is correct
29 Correct 95 ms 134924 KB Output is correct
30 Correct 94 ms 134876 KB Output is correct
31 Correct 93 ms 134852 KB Output is correct
32 Correct 93 ms 134820 KB Output is correct
33 Correct 100 ms 134964 KB Output is correct
34 Correct 85 ms 134812 KB Output is correct
35 Correct 95 ms 134860 KB Output is correct
36 Correct 88 ms 134852 KB Output is correct
37 Correct 92 ms 135028 KB Output is correct
38 Correct 103 ms 135108 KB Output is correct
39 Correct 91 ms 135296 KB Output is correct
40 Correct 90 ms 136184 KB Output is correct
41 Correct 206 ms 135116 KB Output is correct
42 Correct 165 ms 134856 KB Output is correct
43 Correct 164 ms 134932 KB Output is correct
44 Correct 163 ms 134860 KB Output is correct
45 Correct 161 ms 134852 KB Output is correct
46 Correct 242 ms 134920 KB Output is correct
47 Correct 276 ms 134944 KB Output is correct
48 Correct 250 ms 134904 KB Output is correct
49 Correct 245 ms 134852 KB Output is correct
50 Correct 135 ms 134924 KB Output is correct
51 Correct 132 ms 134908 KB Output is correct
52 Correct 133 ms 134900 KB Output is correct
53 Correct 199 ms 135364 KB Output is correct
54 Correct 197 ms 135532 KB Output is correct
55 Correct 195 ms 135420 KB Output is correct
56 Correct 93 ms 135744 KB Output is correct
57 Correct 112 ms 152132 KB Output is correct
58 Correct 188 ms 212348 KB Output is correct
59 Correct 263 ms 221112 KB Output is correct
60 Correct 205 ms 135084 KB Output is correct
61 Correct 203 ms 134980 KB Output is correct