oj.uz

답안 #469713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469713 2021-09-01T16:05:34 Z blue Cat in a tree (BOI17_catinatree) C++17
100 / 100
 272 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:95: 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:131: 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:162: 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:211: 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 95 ms 134916 KB Output is correct
2 Correct 102 ms 134836 KB Output is correct
3 Correct 96 ms 134912 KB Output is correct
4 Correct 98 ms 134800 KB Output is correct
5 Correct 95 ms 134836 KB Output is correct
6 Correct 96 ms 134892 KB Output is correct
7 Correct 94 ms 134920 KB Output is correct
8 Correct 95 ms 134856 KB Output is correct
9 Correct 97 ms 134880 KB Output is correct
10 Correct 94 ms 134856 KB Output is correct
11 Correct 95 ms 134844 KB Output is correct
12 Correct 95 ms 134812 KB Output is correct
13 Correct 98 ms 134852 KB Output is correct
14 Correct 95 ms 134808 KB Output is correct
15 Correct 112 ms 134828 KB Output is correct
16 Correct 98 ms 134856 KB Output is correct
17 Correct 93 ms 134908 KB Output is correct
18 Correct 90 ms 134860 KB Output is correct
19 Correct 95 ms 134916 KB Output is correct
20 Correct 93 ms 134804 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 134916 KB Output is correct
2 Correct 102 ms 134836 KB Output is correct
3 Correct 96 ms 134912 KB Output is correct
4 Correct 98 ms 134800 KB Output is correct
5 Correct 95 ms 134836 KB Output is correct
6 Correct 96 ms 134892 KB Output is correct
7 Correct 94 ms 134920 KB Output is correct
8 Correct 95 ms 134856 KB Output is correct
9 Correct 97 ms 134880 KB Output is correct
10 Correct 94 ms 134856 KB Output is correct
11 Correct 95 ms 134844 KB Output is correct
12 Correct 95 ms 134812 KB Output is correct
13 Correct 98 ms 134852 KB Output is correct
14 Correct 95 ms 134808 KB Output is correct
15 Correct 112 ms 134828 KB Output is correct
16 Correct 98 ms 134856 KB Output is correct
17 Correct 93 ms 134908 KB Output is correct
18 Correct 90 ms 134860 KB Output is correct
19 Correct 95 ms 134916 KB Output is correct
20 Correct 93 ms 134804 KB Output is correct
21 Correct 95 ms 136204 KB Output is correct
22 Correct 95 ms 134920 KB Output is correct
23 Correct 95 ms 134908 KB Output is correct
24 Correct 93 ms 134852 KB Output is correct
25 Correct 94 ms 134868 KB Output is correct
26 Correct 87 ms 134908 KB Output is correct
27 Correct 93 ms 134892 KB Output is correct
28 Correct 92 ms 134860 KB Output is correct
29 Correct 96 ms 134856 KB Output is correct
30 Correct 95 ms 134872 KB Output is correct
31 Correct 95 ms 134848 KB Output is correct
32 Correct 94 ms 134904 KB Output is correct
33 Correct 93 ms 134928 KB Output is correct
34 Correct 96 ms 134868 KB Output is correct
35 Correct 95 ms 134956 KB Output is correct
36 Correct 94 ms 134916 KB Output is correct
37 Correct 93 ms 134936 KB Output is correct
38 Correct 97 ms 135056 KB Output is correct
39 Correct 96 ms 135316 KB Output is correct
40 Correct 97 ms 136288 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 134916 KB Output is correct
2 Correct 102 ms 134836 KB Output is correct
3 Correct 96 ms 134912 KB Output is correct
4 Correct 98 ms 134800 KB Output is correct
5 Correct 95 ms 134836 KB Output is correct
6 Correct 96 ms 134892 KB Output is correct
7 Correct 94 ms 134920 KB Output is correct
8 Correct 95 ms 134856 KB Output is correct
9 Correct 97 ms 134880 KB Output is correct
10 Correct 94 ms 134856 KB Output is correct
11 Correct 95 ms 134844 KB Output is correct
12 Correct 95 ms 134812 KB Output is correct
13 Correct 98 ms 134852 KB Output is correct
14 Correct 95 ms 134808 KB Output is correct
15 Correct 112 ms 134828 KB Output is correct
16 Correct 98 ms 134856 KB Output is correct
17 Correct 93 ms 134908 KB Output is correct
18 Correct 90 ms 134860 KB Output is correct
19 Correct 95 ms 134916 KB Output is correct
20 Correct 93 ms 134804 KB Output is correct
21 Correct 95 ms 136204 KB Output is correct
22 Correct 95 ms 134920 KB Output is correct
23 Correct 95 ms 134908 KB Output is correct
24 Correct 93 ms 134852 KB Output is correct
25 Correct 94 ms 134868 KB Output is correct
26 Correct 87 ms 134908 KB Output is correct
27 Correct 93 ms 134892 KB Output is correct
28 Correct 92 ms 134860 KB Output is correct
29 Correct 96 ms 134856 KB Output is correct
30 Correct 95 ms 134872 KB Output is correct
31 Correct 95 ms 134848 KB Output is correct
32 Correct 94 ms 134904 KB Output is correct
33 Correct 93 ms 134928 KB Output is correct
34 Correct 96 ms 134868 KB Output is correct
35 Correct 95 ms 134956 KB Output is correct
36 Correct 94 ms 134916 KB Output is correct
37 Correct 93 ms 134936 KB Output is correct
38 Correct 97 ms 135056 KB Output is correct
39 Correct 96 ms 135316 KB Output is correct
40 Correct 97 ms 136288 KB Output is correct
41 Correct 234 ms 135112 KB Output is correct
42 Correct 172 ms 134812 KB Output is correct
43 Correct 166 ms 134828 KB Output is correct
44 Correct 168 ms 134976 KB Output is correct
45 Correct 171 ms 134852 KB Output is correct
46 Correct 268 ms 134860 KB Output is correct
47 Correct 261 ms 134980 KB Output is correct
48 Correct 255 ms 134840 KB Output is correct
49 Correct 272 ms 134884 KB Output is correct
50 Correct 148 ms 134980 KB Output is correct
51 Correct 140 ms 134852 KB Output is correct
52 Correct 138 ms 134928 KB Output is correct
53 Correct 201 ms 135348 KB Output is correct
54 Correct 207 ms 135480 KB Output is correct
55 Correct 204 ms 135432 KB Output is correct
56 Correct 95 ms 135784 KB Output is correct
57 Correct 114 ms 152368 KB Output is correct
58 Correct 189 ms 213756 KB Output is correct
59 Correct 265 ms 222580 KB Output is correct
60 Correct 212 ms 135088 KB Output is correct
61 Correct 217 ms 135012 KB Output is correct