Problem p02936 (python)

Fixed submission:
N, Q = map(int,input().split()) # 複数の数字を変数に格納
List_ab = [list(map(int,input().split())) for i in range(N-1)] # [[1,2],[3,4],[5,6]]
List_px = [list(map(int,input().split())) for i in range(Q)] # [[1,2],[3,4],[5,6]]

count_list = [0]*N

List_ab.sort()

for i in range(Q):
    count_list[List_px[i][0]-1] += List_px[i][1]
        
for i in range(N-1):
    count_list[List_ab[i][1]-1] += count_list[List_ab[i][0]-1]
    
print(*count_list)

Buggy submission (verdict: Runtime Error):
import sys
def input():
    return sys.stdin.readline()[:-1]
N , Q = map(int,input().split())
graph = [[] for _ in range(N)]
point = [0] * N
for _ in range(N - 1):
    a , b = map(int,input().split())
    graph[a - 1].append(b - 1)
    graph[b - 1].append(a - 1)
#print(graph)
for _ in range(Q):
    a , b = map(int,input().split())
    a = a - 1
    point[a] += b
# dfsを用いて累積和を計算する
# 初期状態だと前の値がないためデフォルト引数に-1を代入
def dfs(now , prev = -1):
    for next in graph[now]:
        # 次のノードが前に参照した値の時はcontinue
        if next == prev:
            continue
        # 現在の値を次のポイントに加算することで累積和をとる
        point[next] += point[now]
        # 次のノードと現在のノードを引数にdfsを継続する
        dfs(next , now)
 
dfs(0)
print(*point)

Buggy submission (verdict: Runtime Error):
N , Q = map(int,input().split())
graph = [[] for _ in range(N)]
point = [0] * N
for _ in range(N - 1):
    a , b = map(int,input().split())
    graph[a - 1].append(b - 1)
    graph[b - 1].append(a - 1)
#print(graph)
for _ in range(Q):
    a , b = map(int,input().split())
    a = a - 1
    point[a] += b
# dfsを用いて累積和を計算する
# 初期状態だと前の値がないためデフォルト引数に-1を代入
def dfs(now , prev = -1):
    for next in graph[now]:
        # 次のノードが前に参照した値の時はcontinue
        if next == prev:
            continue
        # 現在の値を次のポイントに加算することで累積和をとる
        point[next] += point[now]
        # 次のノードと現在のノードを引数にdfsを継続する
        dfs(next , now)
 
dfs(0)
print(*point)

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())

root = [[] for _ in range(N + 1)]
result = [0] * (N + 1)

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

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


def dfs(now, prev):
    for next in root[now]:
        if next == prev:
            continue
        result[next] += result[now]
        dfs(next, now)


dfs(1, -1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N - 1)]
px = [list(map(int, input().split())) for _ in range(Q)]

root = [[] for _ in range(N)]
result = [0] * N

for i in range(N - 1):
    a = ab[i][0] - 1
    b = ab[i][1] - 1
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0] - 1
    x = px[i][1]
    result[p] += x


def dfs(now, prev):
    for next in root[now]:
        if next == prev:
            continue
        result[next] += result[now]
        dfs(next, now)


dfs(0, -1)
print(*result)

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N - 1)]
px = [list(map(int, input().split())) for _ in range(Q)]

root = [[] for _ in range(N)]
result = [0] * N

for i in range(N - 1):
    a = ab[i][0] - 1
    b = ab[i][1] - 1
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0] - 1
    x = px[i][1]
    result[p] += x


def dfs(now, prev):
    for next in root[now]:
        if next == prev:
            continue
        else:
            result[next] += result[now]
            dfs(next, now)


dfs(0, -1)
print(*result)

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N - 1)]
px = [list(map(int, input().split())) for _ in range(Q)]

root = [[] for _ in range(N + 1)]
result = [0] * (N + 1)

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] += x


def dfs(now, prev):
    for next in root[now]:
        if next == prev:
            continue
        else:
            result[next] += result[now]
            dfs(next, now)


dfs(1, -1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

root = [[] for _ in range(N + 1)]
result = [0] * (N + 1)

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(now, prev):
    for next in root[now]:
        if next == prev:
            continue
        else:
            result[next] = result[next] + result[now]
            dfs(next, now)


dfs(1, -1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

root = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(now, prev):
    if len(root[now]) == 0:
        return
    else:
        for i in range(len(root[now])):
            next_point = root[now][i]
            if next_point == prev:
                continue
            else:
                result[next_point] = result[next_point] + result[now]
                dfs(next_point, now)


dfs(1, -1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

root = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(num):
    if len(root[num]) == 0:
        return
    else:
        for i in range(len(root[num])):
            next_point = root[num][i]
            result[next_point] = result[next_point] + result[num]
            root[next_point].remove(num)
            dfs(next_point)


dfs(1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

root = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(num):
    next_arr = root[num]
    score = result[num]
    if len(next_arr) == 0:
        return
    else:
        for i in range(len(next_arr)):
            next_point = next_arr[i]
            result[next_point] = result[next_point] + score
            root[next_point].remove(num)
            dfs(next_point)


dfs(1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

root = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    root[a].append(b)
    root[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(num):
    next_arr = root[num]
    if len(next_arr) == 0:
        return
    else:
        for i in range(len(next_arr)):
            next_point = next_arr[i]
            score = result[num]
            result[next_point] = result[next_point] + score
            root[next_point].remove(num)
            dfs(next_point)


dfs(1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

ab.sort()
px.sort()

root = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    root[a].append(b)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(num):
    for i in range(len(root[num])):
        next = root[num][i]
        score = result[num]
        result[next] = result[next] + result[num]
        dfs(next)


dfs(1)
print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

path = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    path[a].append(b)
    path[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(point, result):
    next_arr = path[point]
    for i in range(len(next_arr)):
        next_p = next_arr[i]
        path[next_p].remove(point)
        result[next_p] = result[next_p] + result[point]
        if len(path[next_p]) != 0:
            dfs(next_p, result)


dfs(1, result)

print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

path = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    path[a].append(b)
    path[b].append(a)

for i in range(Q):
    p = px[i][0]
    x = px[i][1]
    result[p] = result[p] + x


def dfs(point, result):
    next_arr = path[point]
    for i in range(len(next_arr)):
        next_p = next_arr[i]
        path[next_p].remove(point)
        result[next_p] = result[next_p] + result[point]
        if len(path[next_p]) != 0:
            dfs(next_p, result)


dfs(1, result)

print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

p = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    p[a].append(b)
    p[b].append(a)

for i in range(Q):
    result[px[i][0]] = result[px[i][0]] + px[i][1]


def dfs(point, result):
    for i in range(len(p[point])):
        next = p[point][i]
        p[next].remove(point)
        result[next] = result[next] + result[point]
        if len(p[next]) != 0:
            dfs(next, result)
    return result


result = dfs(1, result)

print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

p = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]
flag = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    p[a].append(b)
    p[b].append(a)

for i in range(Q):
    result[px[i][0]] = result[px[i][0]] + px[i][1]


def dfs(point, result):
    flag[point] = 1
    for i in range(len(p[point])):
        next = p[point][i]
        if flag[next] != 1:
            result[next] = result[next] + result[point]
            dfs(next, result)
    return result


result = dfs(1, result)

print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

p = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]
flag = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    p[a].append(b)
    p[b].append(a)

for i in range(Q):
    result[px[i][0]] = result[px[i][0]] + px[i][1]


def dfs(point, result):
    flag[point] = 1
    for i in range(len(p[point])):
        next = p[point][i]
        if flag[next] != 1:
            result[next] = result[next] + result[point]
            dfs(next, result)
    return result


result = dfs(1, result)

print(*result[1:])

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(N - 1)]
px = [list(map(int, input().split())) for i in range(Q)]

ab.sort()

p = [[] for i in range(N + 1)]
result = [0 for i in range(N + 1)]

for i in range(N - 1):
    a = ab[i][0]
    b = ab[i][1]
    p[a].append(b)


def dfs(point, score, result):
    result[point] = result[point] + score
    for i in range(len(p[point])):
        next = p[point][i]
        dfs(next, score, result)
    return result


for i in range(Q):
    result = dfs(px[i][0], px[i][1], result)

print(*result[1:])