제출 #469734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
469734		blue	Cat in a tree (BOI17_catinatree)	C++17	100 / 100	266 ms	220964 KiB

catinatree

#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(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}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);}cout<<d(0)[0];}

컴파일 시 표준 에러 (stderr) 메시지

catinatree.cpp: In function 'std::deque<int> d(int)':
catinatree.cpp:5:95: 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(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                               ^
catinatree.cpp:5:131: 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(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                                                                   ^
catinatree.cpp:5:162: 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(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                                                                                                  ^
catinatree.cpp:5:208: 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(x=0;x<a.z;x++)q[x]=max(q[x],max(a[x]+(D-x<q.z?q[max(D-x,x)]:0),q[x]+(D-x<a.z?a[max(D-x,x)]:0)));for(x=a.z+1;x;x--)if(x<q.z)q[x-1]=max(q[x-1],q[x]);}q.push_front(q.front());return q;}
      |                                                                                                                                                                                                                ^

• Subtask 1: 11 / 11
• Subtask 2: 40 / 40
• Subtask 3: 49 / 49