# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354193 | spatarel | Cat in a tree (BOI17_catinatree) | C++17 | 0 ms | 364 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 <stdio.h>
#include <algorithm>
#include <vector>
const int MAX_N = 1500; // 200000
int N, D;
std::vector<int> children[MAX_N];
int maxN[MAX_N][1 + MAX_N];
void dfs(int u) {
for (int v : children[u]) {
dfs(v);
}
maxN[u][0] = 1;
for (int v : children[u]) {
maxN[u][0] += maxN[v][D - 1];
}
for (int d = 1; d < D; d++) {
if (d >= D / 2) {
maxN[u][d] = 0;
for (int v : children[u]) {
maxN[u][d] += maxN[v][d - 1];
}
} else {
maxN[u][d] = 0;
int maxAdd = 0;
for (int v : children[u]) {
maxN[u][d] += maxN[v][D - d - 1];
maxAdd = std::max(maxAdd, maxN[v][d - 1] - maxN[v][D - d - 1]);
}
}
}
for (int d = D - 1; d >= 1; d--) {
maxN[u][d - 1] = std::max(maxN[u][d - 1], maxN[u][d]);
}
}
int main() {
scanf("%d%d", &N, &D);
for (int i = 1; i < N; i++) {
int xi;
scanf("%d", &xi);
children[xi].push_back(i);
}
dfs(0);
int answer = maxN[0][0];
printf("%d\n", answer);
return 0;
}
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... |