Problem p02936 (python)

Fixed submission:
from collections import defaultdict
import sys
input = sys.stdin.readline

sys.setrecursionlimit(10**6)

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (N + 1)
ans = [0] * (N + 1)


def dfs(e, v, x):
    seen[v] = True
    ans[v] += x
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v, x + q[next_v])


dfs(e, 1, q[1])
print(*ans[1:])

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (N + 1)
ans = [0] * (N + 1)


def dfs(e, v, x):
    seen[v] = True
    ans[v] += x
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v, x + q[next_v])


dfs(e, 1, q[1])
print(*ans[1:])

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(2 * N)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (2 * N + 1)
ans = [0] * (2 * N + 1)


def dfs(e, v, x):
    seen[v] = True
    ans[v] += x
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v, x + q[next_v])


dfs(e, 1, q[1])
ans = ans[1:]

for i in range(1, N + 1):
    print(ans[i], end=" ")

print()

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (N + 1)
ans = [0] * (N + 1)


def dfs(e, v, x):
    seen[v] = True
    ans[v] += x
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v, x + q[next_v])


dfs(e, 1, q[1])
ans = ans[1:]

for i in ans:
    print(i, end=" ")

print()

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (N + 1)
ans = [0] * (N + 1)


def dfs(e, v, x):
    seen[v] = True
    ans[v] += x
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v, x + q[next_v])


dfs(e, 1, q[1])
ans = ans[1:]

for i in ans:
    print(i, end=" ")

print()

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (N + 1)
ans = [0] * (N + 1)


def dfs(e, v, x):
    seen[v] = True
    ans[v] += x
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v, x + q[next_v])


dfs(e, 1, q[1])

print(*ans[1:])

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (N + 1)
oya = [[] for _ in range(N + 1)]


def dfs(e, v):
    seen[v] = True
    oya[v].append(v)
    for next_v in e[v]:
        oya[next_v].extend(oya[v])
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v)


dfs(e, 1)
ans = [0] * (N + 1)
for i in range(N + 1):
    for j in oya[i]:
        ans[i] += q[j]

print(*ans[1:])

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)

q = defaultdict(int)
for i in range(Q):
    p, x = map(int, input().split())
    q[p] += x

seen = [False] * (N + 1)
subtree = [[] for _ in range(N + 1)]


def dfs(e, v):
    seen[v] = True
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v)
            subtree[v].extend(subtree[next_v])

    subtree[v].append(v)


dfs(e, 1)
ans = [0] * (N + 1)


for i in q:
    for j in subtree[i]:
        ans[j] += q[i]

print(*ans[1:])

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

N, Q = map(int, input().split())
e = [[] for _ in range(N + 1)]
for i in range(N - 1):
    a, b = map(int, input().split())
    e[a].append(b)
    e[b].append(a)

q = []
for i in range(Q):
    p, x = map(int, input().split())
    q.append((p, x))

seen = [False] * (N + 1)

subtree = [[] for _ in range(N + 1)]


def dfs(e, v):
    seen[v] = True
    for next_v in e[v]:
        if seen[next_v]:
            continue
        else:
            dfs(e, next_v)
            subtree[v].extend(subtree[next_v])

    subtree[v].append(v)


dfs(e, 1)
ans = [0] * (N + 1)
for i in q:
    for j in subtree[i[0]]:
        ans[j] += i[1]

print(*ans[1:])