Submission #6001992

---

Source Code Expand

import sys
sys.setrecursionlimit(10**9)

ans=0
def dfs(v):
  global ans
  if v==0:
    tmp=0
    for i in g[v]:
      tmp+=dfs(i)
    ans+=tmp
    return tmp
  else:
    if len(g[v])==0:
      return c[v]
    else:
      m=10**10
      s=0
      for i in g[v]:
        tmp=dfs(i)
        m=min(m,tmp)
        s+=tmp
      ans+=s-m*len(g[v])
      return m

n,m=map(int,input().split())
g=[[] for _ in range(n)]
c=[0]*n
for i in range(n-1):
  tmp=int(input())
  g[tmp].append(i+1)
for i in range(m):
  v,w=map(int,input().split())
  c[v]=w
dfs(0)
print(ans)

Submission Info

Judge Result