# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
355378 | 2021-01-22T12:25:06 Z | spatarel | Cat in a tree (BOI17_catinatree) | C++17 | 1 ms | 384 KB |
#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]; int depth[MAX_N]; void dfs(int u) { depth[u] = 1; //int deepestChild = -1; for (int v : children[u]) { dfs(v); if (depth[u] < 1 + depth[v]) { depth[u] = 1 + depth[v]; //deepestChild = v; } } maxN[u][0] = 1; for (int v : children[u]) { maxN[u][0] += maxN[v][D - 1]; } std::vector<int> maxAdd(1 + D); for (int v : children[u]) { for (int d = 0; d < D && d < depth[v]; d++) { maxN[u][d + 1] += maxN[v][d]; } for (int d = 0; d < D - d - 2 && d < depth[v]; d++) { maxAdd[d + 1] = std::max(maxAdd[d + 1], maxN[v][d] - maxN[v][D - d - 2]); } } for (int d = 0; d < D - d - 2; d++) { maxN[u][d + 1] = maxAdd[d + 1] + maxN[u][D - d - 1]; } for (int d = D - 1; d >= 1; d--) { maxN[u][d - 1] = std::max(maxN[u][d - 1], maxN[u][d]); } //* printf("maxN[%d] = {", u); for (int d = 0; d < D; d++) { printf("%d, ", maxN[u][d]); } printf("}\n");//*/ } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |