제출 #463962

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

catinatree

#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';}

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

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 / 11
• Subtask 2: 40 / 40
• Subtask 3: 49 / 49