# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883401 | dimashhh | Cat in a tree (BOI17_catinatree) | C++17 | 1 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 >= 1;i--){
dp[v][i] = max(dp[v][i + 1],dp[v][i]);
}
}
void test(){
cin >> n >> d;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |