Submission #5900508

---

Source Code Expand

from itertools import*
from math import*
from collections import*
from heapq import*
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf = float("inf")
mod = 10**9+7
from functools import reduce
import sys
sys.setrecursionlimit(10**7)

N,M = map(int,input().split())
P = defaultdict()
for i in range(1,N):
    pi = int(input())
    P[i] = pi
PD = [0]*(N)
BC = [list() for i in range(N)]
for i in range(M):
    b,c = map(int,input().split())
    BC[P[b]].append(c)
ans = 0
for i in range(1,N)[::-1]:
    if len(BC[i]) > 0:
        up = min(BC[i])
        ans += sum(BC[i])-up*len(BC[i])
        BC[P[i]].append(up)
print(ans+sum(BC[0]))

Submission Info

Judge Result