제출 #883404

#제출 시각아이디문제언어결과실행 시간메모리
883404dimashhhCat in a tree (BOI17_catinatree)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1501,MOD = 1e9 + 7; int n,d,dp[N][N]; vector<int> g[N]; void dfs(int v,int pr = -1){ dp[v][0] = 1; for(int to:g[v]){ if(to == pr) continue; dfs(to,v); dp[v][0] += dp[to][d - 1]; } for(int dep = 1;dep <= n;dep++){ if(d - dep - 1 < 0) continue; int mx = -1e9; for(int to:g[v]){ if(to == pr) continue; dp[v][dep] += dp[to][d - dep - 1]; mx = max(mx,dp[to][dep - 1] - dp[to][d - dep -1 ]); } dp[v][dep] += mx; } for(int i = n;i >= 0;i--){ dp[v][i] = max(dp[v][i + 1],dp[v][i]); } } void test(){ cin >> n >> d; for(int i = 1;i < n;i++){ int x; cin >> x; ++x; g[x].push_back(i); } dfs(1); cout << dp[1][0]; } main(){ ios_base::sync_with_stdio(0);cin.tie(0); int T = 1; // cin >> T; while(T--) test(); }

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

catinatree.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...