oj.uz

답안 #469706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469706 2021-09-01T15:56:26 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 296 ms 223696 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<<'\n';}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 134916 KB Output is correct
2 Correct 91 ms 134912 KB Output is correct
3 Correct 89 ms 134852 KB Output is correct
4 Correct 91 ms 134852 KB Output is correct
5 Correct 90 ms 134800 KB Output is correct
6 Correct 92 ms 134856 KB Output is correct
7 Correct 92 ms 134980 KB Output is correct
8 Correct 90 ms 134820 KB Output is correct
9 Correct 90 ms 134896 KB Output is correct
10 Correct 90 ms 134904 KB Output is correct
11 Correct 105 ms 134828 KB Output is correct
12 Correct 88 ms 134844 KB Output is correct
13 Correct 86 ms 134852 KB Output is correct
14 Correct 86 ms 134920 KB Output is correct
15 Correct 90 ms 134928 KB Output is correct
16 Correct 88 ms 134852 KB Output is correct
17 Correct 89 ms 134828 KB Output is correct
18 Correct 87 ms 134900 KB Output is correct
19 Correct 89 ms 134896 KB Output is correct
20 Correct 90 ms 134916 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 134916 KB Output is correct
2 Correct 91 ms 134912 KB Output is correct
3 Correct 89 ms 134852 KB Output is correct
4 Correct 91 ms 134852 KB Output is correct
5 Correct 90 ms 134800 KB Output is correct
6 Correct 92 ms 134856 KB Output is correct
7 Correct 92 ms 134980 KB Output is correct
8 Correct 90 ms 134820 KB Output is correct
9 Correct 90 ms 134896 KB Output is correct
10 Correct 90 ms 134904 KB Output is correct
11 Correct 105 ms 134828 KB Output is correct
12 Correct 88 ms 134844 KB Output is correct
13 Correct 86 ms 134852 KB Output is correct
14 Correct 86 ms 134920 KB Output is correct
15 Correct 90 ms 134928 KB Output is correct
16 Correct 88 ms 134852 KB Output is correct
17 Correct 89 ms 134828 KB Output is correct
18 Correct 87 ms 134900 KB Output is correct
19 Correct 89 ms 134896 KB Output is correct
20 Correct 90 ms 134916 KB Output is correct
21 Correct 90 ms 136212 KB Output is correct
22 Correct 90 ms 134896 KB Output is correct
23 Correct 92 ms 134864 KB Output is correct
24 Correct 90 ms 134900 KB Output is correct
25 Correct 93 ms 134840 KB Output is correct
26 Correct 90 ms 134808 KB Output is correct
27 Correct 92 ms 134816 KB Output is correct
28 Correct 92 ms 134936 KB Output is correct
29 Correct 90 ms 134932 KB Output is correct
30 Correct 91 ms 134932 KB Output is correct
31 Correct 89 ms 134816 KB Output is correct
32 Correct 90 ms 134800 KB Output is correct
33 Correct 90 ms 134836 KB Output is correct
34 Correct 91 ms 134948 KB Output is correct
35 Correct 89 ms 134884 KB Output is correct
36 Correct 90 ms 134812 KB Output is correct
37 Correct 89 ms 135004 KB Output is correct
38 Correct 89 ms 135128 KB Output is correct
39 Correct 93 ms 135356 KB Output is correct
40 Correct 82 ms 136176 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 134916 KB Output is correct
2 Correct 91 ms 134912 KB Output is correct
3 Correct 89 ms 134852 KB Output is correct
4 Correct 91 ms 134852 KB Output is correct
5 Correct 90 ms 134800 KB Output is correct
6 Correct 92 ms 134856 KB Output is correct
7 Correct 92 ms 134980 KB Output is correct
8 Correct 90 ms 134820 KB Output is correct
9 Correct 90 ms 134896 KB Output is correct
10 Correct 90 ms 134904 KB Output is correct
11 Correct 105 ms 134828 KB Output is correct
12 Correct 88 ms 134844 KB Output is correct
13 Correct 86 ms 134852 KB Output is correct
14 Correct 86 ms 134920 KB Output is correct
15 Correct 90 ms 134928 KB Output is correct
16 Correct 88 ms 134852 KB Output is correct
17 Correct 89 ms 134828 KB Output is correct
18 Correct 87 ms 134900 KB Output is correct
19 Correct 89 ms 134896 KB Output is correct
20 Correct 90 ms 134916 KB Output is correct
21 Correct 90 ms 136212 KB Output is correct
22 Correct 90 ms 134896 KB Output is correct
23 Correct 92 ms 134864 KB Output is correct
24 Correct 90 ms 134900 KB Output is correct
25 Correct 93 ms 134840 KB Output is correct
26 Correct 90 ms 134808 KB Output is correct
27 Correct 92 ms 134816 KB Output is correct
28 Correct 92 ms 134936 KB Output is correct
29 Correct 90 ms 134932 KB Output is correct
30 Correct 91 ms 134932 KB Output is correct
31 Correct 89 ms 134816 KB Output is correct
32 Correct 90 ms 134800 KB Output is correct
33 Correct 90 ms 134836 KB Output is correct
34 Correct 91 ms 134948 KB Output is correct
35 Correct 89 ms 134884 KB Output is correct
36 Correct 90 ms 134812 KB Output is correct
37 Correct 89 ms 135004 KB Output is correct
38 Correct 89 ms 135128 KB Output is correct
39 Correct 93 ms 135356 KB Output is correct
40 Correct 82 ms 136176 KB Output is correct
41 Correct 204 ms 135996 KB Output is correct
42 Correct 171 ms 135364 KB Output is correct
43 Correct 174 ms 135532 KB Output is correct
44 Correct 169 ms 135404 KB Output is correct
45 Correct 192 ms 135364 KB Output is correct
46 Correct 260 ms 136004 KB Output is correct
47 Correct 296 ms 136064 KB Output is correct
48 Correct 254 ms 136136 KB Output is correct
49 Correct 257 ms 136060 KB Output is correct
50 Correct 135 ms 135240 KB Output is correct
51 Correct 139 ms 135312 KB Output is correct
52 Correct 137 ms 135304 KB Output is correct
53 Correct 197 ms 136132 KB Output is correct
54 Correct 229 ms 136188 KB Output is correct
55 Correct 192 ms 136108 KB Output is correct
56 Correct 94 ms 135688 KB Output is correct
57 Correct 111 ms 152472 KB Output is correct
58 Correct 206 ms 214340 KB Output is correct
59 Correct 265 ms 223696 KB Output is correct
60 Correct 212 ms 136124 KB Output is correct
61 Correct 246 ms 136032 KB Output is correct