Problem p02936 (python)

Fixed submission:
import sys
sys.setrecursionlimit(10**9)
input=lambda :sys.stdin.readline()

def sol():

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

  for _ in range(Q):
    p, x = map(int,input().split())
    ans[p-1] += x 
 
  def dfs(v,p=-1):
    for u in graph[v]:
      if u == p: continue
      ans[u] += ans[v]
      dfs(u,v)
  dfs(0)
  print(*ans)

sol()

Buggy submission (verdict: Runtime Error):
def dfs(v,p=-1):
  for u in graph[v]:
    if u == p: continue
    ans[u] += ans[v]
    dfs(u,v)

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

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

dfs(1)
print(' '.join([str(a) for a in ans[1:]]))

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

def dfs(v,p=-1):
  for u in graph[v]:
    if u == p: continue
    ans[u] += ans[v]
    dfs(u,v)

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

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

dfs(1)
print(' '.join([str(a) for a in ans[1:]]))

Buggy submission (verdict: Runtime Error):
def get_ends():
  ends = []
  for key, value in graph.items():
    if len(value) == 0: ends.append(key)
  return ends

def get_acm_graph():
  acm_graph =  {i:[i] for i in range(1,N+1)}
  for end in ends:
    tmp_node = end
    while tmp_node != 1:
      for node in acm_graph[tmp_node]:
        if node not in acm_graph[rev_graph[tmp_node]]:
          acm_graph[rev_graph[tmp_node]].append(node)
      tmp_node = rev_graph[tmp_node]
  return acm_graph
  
N,Q = map(int,input().split())
graph = {i:[] for i in range(1,N+1)}
rev_graph = {i:-1 for i in range(1,N+1)}
counter = {i:0 for i in range(1,N+1)}
for _ in range(N-1):
  a,b = map(int,input().split())
  graph[a].append(b)
  rev_graph[b] = a

ends = get_ends()
acm_graph = get_acm_graph()

prc = {}
for _ in range(Q):
  p, x = map(int,input().split())
  if p not in prc: prc[p] = x
  else: prc[p] += x

for p, x in prc.items():
  for node in acm_graph[p]:
    counter[node] += x

print(' '.join([str(counter[i]) for i in range(1,N+1)]))

Buggy submission (verdict: Runtime Error):
import bisect

n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n-1):a[i+1]+= a[i]
  
cnt = 0
for i in range(n)[::-1]:
  if a[i]<k:
    break
  t = bisect.bisect_right(a,a[i]-k)
  print(t)
  cnt+=t+1
print(cnt)

Buggy submission (verdict: Runtime Error):
import bisect

n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n-1):a[i+1]+= a[i]
  
cnt = 0
for i in range(n)[::-1]:
  if a[i]<k:
    break
  t = bisect.bisect_right(a,a[i]-k)
  print(t)
  cnt+=t+1
print(cnt)

Buggy submission (verdict: Runtime Error):
import sys

def add_count(addnum, relations, counters, nodelist):
  new_nodelist = []
  for node in nodelist:
    if node not in relations:
      continue
    else:
      new_nodelist = new_nodelist + relations[node]
      for child in relations[node]:
        counters[child-1] += addnum
  
  if len(new_nodelist) == 0:
    return counters
  else:
    return add_count(addnum, relations, counters, new_nodelist)

N, Q = map(int, sys.stdin.readline().split())
alist = list(list(map(int, sys.stdin.readline().split())) for i in range(N-1))
qlist = list(list(map(int, sys.stdin.readline().split())) for i in range(Q))

counters = [0 for i in range(N)]
relations = {}
for a in alist:
  if a[0] not in relations:
    relations[a[0]] = [a[1]]
  else:
    relations[a[0]].append(a[1])
    
for q in qlist:
  counters[q[0]-1] += q[1]
  counters = add_count(q[1], relations, counters, [q[0]])

print(' '.join(map(str,counters)))

Buggy submission (verdict: Runtime Error):
import sys

def add_count(addnum, relations, counters, nodelist):
  new_nodelist = []
  for node in nodelist:
    if node not in relations:
      continue
    else:
      new_nodelist = new_nodelist + relations[node]
      for child in relations[node]:
        counters[child-1] += addnum
  
  if len(new_nodelist) == 0:
    return counters
  else:
    return add_count(addnum, relations, counters, new_nodelist)

N, Q = map(int, sys.stdin.readline().split())
alist = list(list(map(int, sys.stdin.readline().split())) for i in range(N-1))
qlist = list(list(map(int, sys.stdin.readline().split())) for i in range(Q))

counters = [0 for i in range(N)]
relations = {}
for a in alist:
  if a[0] not in relations:
    relations[a[0]] = [a[1]]
  else:
    if a[1] not in relations[a[0]]:
      relations[a[0]].append(a[1])
    
for q in qlist:
  counters[q[0]-1] += q[1]
  counters = add_count(q[1], relations, counters, [q[0]])

print(' '.join(map(str,counters)))

Buggy submission (verdict: Runtime Error):
import sys

def add_count(addnum, relations, counters, nodelist):
  new_nodelist = []
  for node in nodelist:
    if node not in relations:
      continue
    else:
      new_nodelist = new_nodelist + relations[node]
      for child in relations[node]:
        counters[child-1] += addnum
  
  if len(new_nodelist) == 0:
    return counters
  else:
    return add_count(addnum, relations, counters, new_nodelist)

N, Q = map(int, sys.stdin.readline().split())
alist = list(list(map(int, sys.stdin.readline().split())) for i in range(N-1))
qlist = list(list(map(int, sys.stdin.readline().split())) for i in range(Q))

counters = [0 for i in range(N)]
relations = {}
for a in alist:
  if a[0] not in relations:
    relations[a[0]] = [a[1]]
  else:
    relations[a[0]].append(a[1])
    
for q in qlist:
  counters[q[0]-1] += q[1]
  counters = add_count(q[1], relations, counters, [q[0]])

print(' '.join(map(str,counters)))

Buggy submission (verdict: Runtime Error):
import sys

def add_count(addnum, relations, counters, nodelist):
  new_nodelist = []
  for node in nodelist:
    if node not in relations:
      continue
    else:
      new_nodelist = new_nodelist + relations[node]
      for child in relations[node]:
        counters[child-1] += addnum
  
  if len(new_nodelist) == 0:
    return counters
  else:
    return add_count(addnum, relations, counters, new_nodelist)

N, Q = map(int, sys.stdin.readline().split())
alist = list(list(map(int, sys.stdin.readline().split())) for i in range(N-1))
qlist = list(list(map(int, sys.stdin.readline().split())) for i in range(Q))

counters = [0 for i in range(N)]
relations = {}
for a in alist:
  if a[0] not in relations:
    relations[a[0]] = [a[1]]
  else:
    relations[a[0]].append(a[1])
    
for q in qlist:
  if q[0] <= N-1:
    counters[q[0]-1] += q[1]
    counters = add_count(q[1], relations, counters, [q[0]])

print(' '.join(map(str,counters)))

Buggy submission (verdict: Runtime Error):
import sys

def add_count(addnum, relations, counters, nodelist):
  new_nodelist = []
  for node in nodelist:
    if node not in relations:
      continue
    else:
      new_nodelist = new_nodelist + relations[node]
      for child in relations[node]:
        counters[child-1] += addnum
  
  if len(new_nodelist) == 0:
    return counters
  else:
    return add_count(addnum, relations, counters, new_nodelist)

N, Q = map(int, sys.stdin.readline().split())
alist = list(list(map(int, sys.stdin.readline().split())) for i in range(N-1))
qlist = list(list(map(int, sys.stdin.readline().split())) for i in range(Q))

counters = [0 for i in range(N)]
relations = {}
for a in alist:
  if a[0] not in relations:
    relations[a[0]] = [a[1]]
  else:
    relations[a[0]].append(a[1])

for q in qlist:
  counters[q[0]-1] += q[1]
  if q[0] in relations:
    counters = add_count(q[1], relations, counters, [q[0]])

print(' '.join(map(str,counters)))