Submission #1355636

---

Source Code Expand

import sys
sys.setrecursionlimit(10 ** 6)

def dfs(now, par):
    h = 0
    global ans
    for child in g[now]:
        if child == par: continue
        h = max(h, dfs(child, now))
    if h == k - 1 and par != 0:
        ans += 1
        h = -1
    return h + 1

n, k = map(int, raw_input().split())
a = map(int, raw_input().split())
g = [[] for _ in xrange(n)]
ans = 0
if a[0] != 1:
    a[0] = 1
    ans += 1
for i in xrange(n):
    g[a[i] - 1].append(i)
dfs(0, 0)
print ans

Submission Info

Judge Result