# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463941 | blue | Cat in a tree (BOI17_catinatree) | C++17 | 0 ms | 0 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 <iostream>
#include <deque>
#include <vector>
int maxN = 200'000, N, D, x, res = 0;
std::vector<int> children[std::maxN];
std::deque<int> dfs(int u) {
std::deque<int> res(1, 1);
for(int v: children[u]) {
auto add = dfs(v);
add.push_front(add.front());
if(res.size() < add.size()) swap(res, add);
for(int i = 0; i < add.size(); i++) res[i] = std::max(res[i], std::max(add[i] + (D-i < res.size() ? res[std::max(D-i, i)] : 0), res[i] + (D-i < add.size() ? add[std::max(D-i, i)] : 0)));
for(int i = add.size(); i >= 0; i--) if(i+1 < res.size()) res[i] = std::max(res[i], res[i+1]); }
return res; }
int main() {
std::cin >> N >> D;
for(int i = 1; i < N; i++) { std::cin >> x; children[x].push_back(i); }
for(int r: dfs(0)) res = std::max(res, r);
std::cout << res << '\n'; }