input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
sys.setrecursionlimit(5 * 10**5)
N, Q = list(map(int, input().split()))
M = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
M[a-1].append(b-1)
M[b-1].append(a-1)
ans = [0] * N
for _ in range(Q):
p, x = list(map(int, input().split()))
... | import sys
sys.setrecursionlimit(5 * 10**5)
input=sys.stdin.readline
N, Q = list(map(int, input().split()))
M = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
M[a-1].append(b-1)
M[b-1].append(a-1)
ans = [0] * N
for _ in range(Q):
p, x = list(map(in... | p02936 |
import sys
sys.setrecursionlimit(5 * 10**5)
input=sys.stdin.readline
N, Q = list(map(int, input().split()))
M = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
M[a-1].append(b-1)
M[b-1].append(a-1)
X = [0] * N
for _ in range(Q):
p, x = list(map(int,... | import sys
sys.setrecursionlimit(5 * 10**5)
input=sys.stdin.readline
N, Q = list(map(int, input().split()))
M = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
M[a-1].append(b-1)
M[b-1].append(a-1)
ans = [0] * N
for _ in range(Q):
p, x = list(map(in... | p02936 |
import sys
from collections import deque
sys.setrecursionlimit(5 * 10**5)
input=sys.stdin.readline
N, Q = list(map(int, input().split()))
M = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
M[a-1].append(b-1)
M[b-1].append(a-1)
ans = [0] * N
for _ in ran... | import sys
sys.setrecursionlimit(5 * 10**5)
input=sys.stdin.readline
N, Q = list(map(int, input().split()))
M = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
M[a-1].append(b-1)
M[b-1].append(a-1)
ans = [0] * N
for _ in range(Q):
p, x = list(map(int... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
# 遅延評価で加えてあげるだけ
N,Q = list(map(int,input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].ap... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N, Q = list(map(int, input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
g = [[] for _ in range(N+1)]
for a,b in AB:
g[a].append(b)
g[b].append(a... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N, Q = list(map(int, input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
g = [[] for _ in range(N+1)]
for a,b in AB:
g[a].append(b)
g[b].append(a... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N, Q = list(map(int, input().split()))
g = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
g[a].append(b)
g[b].append(a)
cnt = [0] * (N+1)
for i in range(Q):
p, x = list(map(int, inpu... | p02936 |
import sys
sys.setrecursionlimit(10**6)
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
P = [0] * N
for _ in range(Q):
p, x = list(map(int, input().split()))
P[p-1] += x
... | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
P = [0] * N
for _ in range(Q):
p, x = list(map(int, input().... | p02936 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): retur... | import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return ... | p02936 |
import sys
sys.setrecursionlimit(1000000)
n, q = [int(i) for i in input().split()]
ab = [[] for _ in range(n)]
for _ in range(n - 1):
i, j = [int(i)-1 for i in input().split()]
ab[i].append(j)
ab[j].append(i)
p = [0]*n
for _ in range(q):
i, j = [int(i) for i in input().split()]
p[i-... | import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n, q = [int(i) for i in input().split()]
ab = [[] for _ in range(n)]
for _ in range(n - 1):
i, j = [int(i)-1 for i in input().split()]
ab[i].append(j)
ab[j].append(i)
p = [0]*n
for _ in range(q):
... | p02936 |
import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n, q = [int(i) for i in input().split()]
e = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
p = [0] * n
for _ in range(q):
pp, ... | import sys
sys.setrecursionlimit(1000000)
n, q = [int(i) for i in input().split()]
e = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
p = [0] * n
for _ in range(q):
pp, x = [int(i) for i in input().split()]
p[pp... | p02936 |
import sys
sys.setrecursionlimit(10**7)
from collections import deque
seen=[]
#seen=dict()
path=[]
def dfs(g, v,add):
xx[v]+=add
# path.append(v)
seen[v]=True
for next_v in g[v]:
if seen[next_v]:
continue
dfs(g, next_v,xx[v])
# path.append(v)
re... | import sys
sys.setrecursionlimit(10**7)
from collections import deque
input = sys.stdin.readline
seen=[]
#seen=dict()
path=[]
def dfs(g, v,add):
xx[v]+=add
# path.append(v)
seen[v]=True
for next_v in g[v]:
if seen[next_v]:
continue
dfs(g, next_v,xx[v])
#... | p02936 |
import sys
sys.setrecursionlimit(10**7)
from collections import deque
input = sys.stdin.readline
seen=[]
#seen=dict()
path=[]
def dfs(g, v,add):
xx[v]+=add
# path.append(v)
seen[v]=True
for next_v in g[v]:
if seen[next_v]:
continue
dfs(g, next_v,xx[v])
#... |
from collections import deque
icase=0
if icase==0:
n,q=list(map(int,input().split()))
g = [set() for _ in range(n)]
for i in range(n-1):
ai,bi=list(map(int,input().split()))
g[ai-1].add(bi-1)
g[bi-1].add(ai-1)
g=tuple(g)
xx=[0]*n
for i in range(q):
... | p02936 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | p02936 |
import sys
from collections import deque
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return list(map(int, input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int, in... | import sys
from collections import deque
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return list(map(int, input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int, in... | p02936 |
from collections import deque
N, Q = list(map(int, input().split(' ')))
queue = deque()
for _ in range(1, N):
queue.append(tuple(map(int, input().split(' '))))
tree = {
1: set()
}
while len(queue) > 0:
a, b = queue.popleft()
if a in tree:
tree[a].add(b)
tree[b] = se... | from collections import deque, defaultdict
N, Q = list(map(int, input().split(' ')))
tree = defaultdict(set)
for _ in range(1, N):
a, b = list(map(int, input().split(' ')))
tree[a].add(b)
tree[b].add(a)
results = [0] * (N + 1)
for _ in range(Q):
p, x = list(map(int, input().split(' ')))
... | p02936 |
import sys
sys.setrecursionlimit(10000000)
N, Q = [int(x) for x in input().split()]
# V = [set() for _ in range(N)]
V = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
# V[a].add(b)
V[a].append(b)
C = [0] * N
for _ in range(Q):... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
N, Q = [int(x) for x in input().split()]
# V = [set() for _ in range(N)]
V = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
# V[a].add(b)
V[a].append(b)
C = [... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,Q = list(map(int,input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[... | import sys
sys.setrecursionlimit(10 ** 7)
N,Q = list(map(int,input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
value = [0] ... | p02936 |
import sys
sys.setrecursionlimit(10 ** 7)
N,Q = list(map(int,input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
value = [0] ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,Q = list(map(int,input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[... | p02936 |
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def f(ab: list, parent: list, i: int = 0):
if len(ab[i]) == 1 and i != 0:
return
for j in ab[i]:
if j != parent[i]:
parent[j] = i
f(ab, parent, j)
def g(ab: list, parent: list, ans: list, i: ... | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def g(ab: list, ans: list, check: list, i: int = 0):
if len(ab[i]) == 1 and i != 0:
return
check[i] = False
for j in ab[i]:
if check[j]:
ans[j] += ans[i]
g(ab, ans, check, j)
def main():... | p02936 |
import sys
from collections import deque
sys.setrecursionlimit(500000)
n,q=list(map(int,input().split()))
edge=[[] for i in range(n)]
cost=[0]*n
for i in range(n-1):
p,s=list(map(int,input().split()))
p-=1;s-=1
edge[p].append(s)
edge[s].append(p)
for i in range(q):
x,c=list(map(int,input().split()... | import sys
from collections import deque
sys.setrecursionlimit(500000)
input=sys.stdin.readline
n,q=list(map(int,input().split()))
edge=[[] for i in range(n)]
cost=[0]*n
for i in range(n-1):
p,s=list(map(int,input().split()))
p-=1;s-=1
edge[p].append(s)
edge[s].append(p)
for i in range(q):
x,c=li... | p02936 |
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | p02936 |
N, Q = list(map(int, input().split(" ")))
ns= [list(map(int, input().split(" "))) for _ in range(N-1)]
vs = [list(map(int, input().split(" "))) for _ in range(Q)]
dic = dict.fromkeys(list(range(1,N+1)), 1)
rlt = dict.fromkeys(list(range(1,N+1)), 0)
for i in range(N-1):
dic[ns[i][1]] = ns[i][0]
for q in... | N, Q = list(map(int, input().split(" ")))
ns= [list(map(int, input().split(" "))) for _ in range(N-1)]
vs = [list(map(int, input().split(" "))) for _ in range(Q)]
dic = [[] for _ in range(N)]
rlt = [0]*N
for i in range(N-1):
dic[ns[i][0]-1] += [ns[i][1]-1]
for j in range(Q):
rlt[vs[j][0]-1] +... | p02936 |
N, Q = list(map(int, input().split(" ")))
ns= [list(map(int, input().split(" "))) for _ in range(N-1)]
vs = [list(map(int, input().split(" "))) for _ in range(Q)]
ns = sorted(ns)
flags = [True]+[False]*(N-1)
dic = [[] for _ in range(N)]
rlt = [0]*N
for i in range(N-1):
if flags[ns[i][1]-1]:
dic... | N, Q = list(map(int, input().split(" ")))
ns= [list(map(int, input().split(" "))) for _ in range(N-1)]
vs = [list(map(int, input().split(" "))) for _ in range(Q)]
flags = [True]+[False]*(N-1)
dic = [[] for _ in range(N)]
rlt = [0]*N
for i in range(N-1):
dic[ns[i][1]-1] += [ns[i][0]-1]
dic[ns[i][0... | p02936 |
from collections import deque
from collections import defaultdict
def getlist():
return list(map(int, input().split()))
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, a, b):
sel... | from collections import deque
from collections import defaultdict
def getlist():
return list(map(int, input().split()))
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, a, b):
sel... | p02936 |
from collections import deque
from collections import defaultdict
def getlist():
return list(map(int, input().split()))
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, a, b):
sel... | from collections import deque
from collections import defaultdict
def getlist():
return list(map(int, input().split()))
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, a, b):
sel... | p02936 |
n, q = list(map(int, input().split()))
AB = [[int(x) for x in input().split()] for _ in range(n - 1)]
PX = [[int(x) for x in input().split()] for _ in range(q)]
graph = [[] for _ in range(n + 1)]
# 各ノードと連結するノードを要素に持つ配列
# e.g., graph[1] -> ノード１と連結するノードを要素に持つ
for a, b in AB:
graph[a].append(b)
graph[b].appe... | import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
AB = [[int(x) for x in input().split()] for _ in range(n - 1)]
PX = [[int(x) for x in input().split()] for _ in range(q)]
graph = [[] for _ in range(n + 1)]
# 各ノードと連結するノードを要素に持つ配列
# e.g., graph[1] -> ノード１と連結するノードを要素に持つ
for a, b i... | p02936 |
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
def init(n):
for i in range(N):
par[i]=i
num... | import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
def init(n):
for i in range(N):
par[i]=i
num... | p02936 |
n, q = list(map(int, input().split()))
link = dict()
counter = list([0]*n)
for i in range(n-1):
a, b = list(map(int, input().split()))
link[b-1] = a-1
for i in range(q):
p,pp = list(map(int, input().split()))
counter[p-1] += pp
ans = ""
for i in range(n):
isChild = True
now = i
... | n, q = list(map(int, input().split()))
link = dict()
counter = list([0]*n)
for i in range(n-1):
a,b = list(map(int, input().split()))
link[b-1] = a-1
for i in range(q):
p,pp = list(map(int, input().split()))
counter[p-1] += pp
for i in range(n):
if i in link:
counter[i] +=... | p02936 |
import sys
sys.setrecursionlimit(10**8)
N, Q = list(map(int, input().split()))
a = []
p = []
x = [0]*(N)
A = [0]*(N)
for i in range(N-1):
t=list(map(int,input().split()))
if t[0]>t[1]:
swap = t[1]
t[1] = t[0]
t[0] =swap
a.append((int(t[0]),int(t[1])))
for i in range... |
N, Q = list(map(int, input().split()))
a = []
p = []
x = [0]*(N)
A = [0]*(N)
for i in range(N-1):
t=list(map(int,input().split()))
if t[0]>t[1]:
swap = t[1]
t[1] = t[0]
t[0] =swap
a.append((int(t[0]),int(t[1])))
for i in range(Q):
t=list(map(int,input().split()))... | p02936 |
N, Q = list(map(int, input().split()))
value = [0]*(N+1)
tree = [[i] for i in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
for rel in tree:
if a in rel:
rel.append(b)
for i in range(Q):
a, b = list(map(int, input().split()))
for arg in tree[a]:
value[arg] += b... | N, Q = list(map(int, input().split()))
value = [0]*(N+1)
ab_list = []
for i in range(N-1):
a, b = list(map(int, input().split()))
ab_list.append([a, b])
ab_list.sort(key=lambda x:x[0])
for i in range(Q):
p, q = list(map(int, input().split()))
value[p] += q
for a, b in ab_list:
value[b] += value[a]
... | p02936 |
while True:
try:
N, Q = list(map(int, input().split()))
verts = [None] * N
qs = [0] * N
results = [0] * N
for i in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
if verts[a] is None:
... | while True:
try:
N, Q = list(map(int, input().split()))
verts = [None] * N
qs = [0] * N
results = [0] * N
for i in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
if verts[a] is None:
... | p02936 |
import sys
sys.setrecursionlimit(10**6)
def dfs(ve, add):
global seen
global r
seen[ve] = True
r[ve] = add
a = len(ki[ve])
for i in range(a):
b = ki[ve][i]
if not seen[b]:
dfs(b, add+ook[b])
N,Q = list(map(int, input().split()))
side = [list(map(int, input().split())) for _ in... | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def dfs(ve, add):
global seen
global r
seen[ve] = True
r[ve] = add
a = len(ki[ve])
for i in range(a):
b = ki[ve][i]
if not seen[b]:
dfs(b, add+ook[b])
N,Q = list(map(int, input().split()))
side = [list(map(int... | p02936 |
'''
pythonの再帰は10^5timesですら厳しい
import sys
sys.setrecursionlimit(10000000)
def dfs(v,p,G,c):
for u in G[v]:
if u!=p:
c[u]+=c[v]
dfs(u,v,G,c)
'''
from collections import deque
N,Q = list(map(int,input().split()))
G=[]
for i in range(N):
G.append([])
for i in ra... | '''
pythonの再帰は10^5timesですら厳しい
import sys
sys.setrecursionlimit(10000000)
def dfs(v,p,G,c):
for u in G[v]:
if u!=p:
c[u]+=c[v]
dfs(u,v,G,c)
'''
from collections import deque
N,Q = list(map(int,input().split()))
G=[]
for i in range(N):
G.append([])
for i in ra... | p02936 |
'''
pythonの再帰は10^5timesですら厳しい
import sys
sys.setrecursionlimit(10000000)
def dfs(v,p,G,c):
for u in G[v]:
if u!=p:
c[u]+=c[v]
dfs(u,v,G,c)
'''
from collections import deque
N,Q = list(map(int,input().split()))
G=[]
for i in range(N):
G.append([])
for i in ... | N,Q = list(map(int,input().split()))
G=[]
for i in range(N):
G.append([])
for i in range(N-1):
a,b = list(map(int,input().split()))
a-=1
b-=1
G[a].append(b)
G[b].append(a)
p=[0]*Q
x=[0]*Q
c=[0]*N
for i in range(Q):
p,x = list(map(int,input().split()))
p-=1
c[p] +=... | p02936 |
n,q = list(map(int,input().split()))
ki = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
ki[a - 1].append(b-1)
ki[b - 1].append(a-1)
counter = [0 for _ in range(n)]
for _ in range(q):
p, x = list(map(int, input().split()))
counter[p-1] += x
q... | n,q = list(map(int,input().split()))
ki = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
ki[a - 1].append(b-1)
ki[b - 1].append(a-1)
counter = [0 for _ in range(n)]
for _ in range(q):
p, x = list(map(int, input().split()))
counter[p-1] += x
q... | p02936 |
import sys
sys.setrecursionlimit(10**6)
N,Q = [int(i) for i in input().split()] #N個の頂点、Q回の操作
aaabbb = [[int(i) for i in input().split()] for j in range(N-1)] #木の辺
pppxxx = [[int(i) for i in input().split()] for j in range(Q)] #操作
tree = [[] for i in range(N+1)]
for a,b in aaabbb:
tree[a].append(b)
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N,Q = [int(i) for i in input().split()] #N個の頂点、Q回の操作
aaabbb = [[int(i) for i in input().split()] for j in range(N-1)] #木の辺
pppxxx = [[int(i) for i in input().split()] for j in range(Q)] #操作
tree = [[] for i in range(N+1)]
for a,b in aaabbb:... | p02936 |
# ki
from collections import deque
# input
n, q = list(map(int, input().split()))
ln = [list(map(int, input().split())) for i in range(n-1)]
lq = [list(map(int, input().split())) for i in range(q)]
edge = [[] for i in range(n+1)]
for next in ln:
parent = next[0]
child = next[1]
edge[parent... | # ki
from collections import deque
# input
n, q = list(map(int, input().split()))
edge = [[] for i in range(n+1)]
for i in range(n-1):
a, b = list(map(int, input().split()))
edge[a].append(b)
edge[b].append(a)
lq = [list(map(int, input().split())) for i in range(q)]
score = [0]*(n+1)
vi... | p02936 |
import sys
sys.setrecursionlimit(10000000)
class tree:
def __init__(self):
self.baby_list=[]
self.counter=0
def add_value(self, value):
self.counter += value
for i in self.baby_list:
hoge[i].add_value(value)
N,Q=list(map(int, input().split() ))
... | import sys
sys.setrecursionlimit(10000000)
class tree:
def __init__(self):
self.baby_list=[]
self.counter=0
def add_value(self):
for i in self.baby_list:
hoge[i].counter += self.counter
hoge[i].add_value()
N,Q=list(map(int, input().split() ))... | p02936 |
import sys
from collections import deque
class tree:
def __init__(self):
self.baby_list=deque()
self.counter=0
def add_value(self):
for i in self.baby_list:
hoge[i].counter+=self.counter
hoge[i].add_value()
N,Q=list(map(int, input()... | import sys
sys.setrecursionlimit(10000000)
N,Q=list(map(int, input().split() ))
data={i+1:0 for i in range(N)}
# for i in range(N-1):
# a,b=list(map(int, input().split() ))
# hoge[a].baby_list.append(b)
relate = [list(map(int, input().split() )) for i in range(N-1)]
relate.sort(key=lambda x ... | p02936 |
### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(50000000)
class check():
def __init__(self):
readline=sys.stdin.readline
n,q=list(map(int, readline().rstrip().split()))
self.tree=[[] for i in range(n... | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(50000000)
def do(root,next,tree,ans):
if root >= 0:
ans[next]+=ans[root]
for a in tree[next]:
if a==root:
continue
do(next,a,tree,ans... | p02936 |
from heapq import heappush, heappop, heapify, heapreplace
from collections import defaultdict
from bisect import bisect_left
class Solution:
def main(self):
path = defaultdict(list)
N, Q = list(map(int, input().split()))
freq = [0] * N
for i in range(N-1):
ai... | from heapq import heappush, heappop, heapify, heapreplace
from collections import defaultdict
from bisect import bisect_left
class Solution:
def main(self):
path = defaultdict(list)
N, Q = list(map(int, input().split()))
freq = [0] * N
for i in range(N-1):
ai... | p02936 |
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
n, q = map(int, input().split())
edges = [[] for _ in range(n)]
cnt = [0 for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
edges[a - 1].append(b - 1)
for i in range(q):
p, x = map(int, input().split()... | import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
n, q = map(int, input().split())
edges = [[] for _ in range(n)]
cnt = [0 for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
edges[a - 1].append(b - 1)
for i in range(q):
p, x = map(int, input().split()... | p02936 |
import sys
sys.setrecursionlimit(10 ** 9)
n,q=list(map(int,input().split()))
graph=[[] for _ in range(n+1)]
ab=[list(map(int,input().split())) for _ in range(n-1)]
for a,b in ab:
graph[a].append(b)
graph[b].append(a)
px=[list(map(int,input().split())) for _ in range(q)]
seen=[0]*(n+1)
ans=[0]*(n+1)
f... | import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
def main():
n,q=list(map(int,input().split()))
graph=[[] for _ in range(n+1)]
ab=[list(map(int,input().split())) for _ in range(n-1)]
for a,b in ab:
graph[a].append(b)
graph[b].append(a)
px=[list(map(int,i... | p02936 |
def main(n,ab,px):
import sys
sys.setrecursionlimit(10**7)
g=[[]for _ in range(n)]
for a,b in ab:
g[a-1].append(b-1)
g[b-1].append(a-1)
ans=[0]*n
for p,x in px:
ans[p-1]+=x
def dfs(seen,i):
seen[i]=1
l=g[i]
for li in [li for li in l if seen[li]==0]:
ans[li... | def main(n,ab,px):
import sys
sys.setrecursionlimit(10**7)
g=[[]for _ in range(n)]
for a,b in ab:
g[a-1].append(b-1)
g[b-1].append(a-1)
ans=[0 for _ in range(n)]
for p,x in px:
ans[p-1]+=x
def dfs(seen,i):
seen[i]=1
l=g[i]
for li in [li for li in l if seen[li]==0]:
... | p02936 |
def main(n,ab,px):
import sys
sys.setrecursionlimit(10**7)
g=[[]for _ in range(n)]
for a,b in ab:
g[a-1].append(b-1)
g[b-1].append(a-1)
ans=[0 for _ in range(n)]
for p,x in px:
ans[p-1]+=x
def dfs(seen,i):
seen[i]=1
l=g[i]
for li in [li for li in l if seen[li]==0]:
... | import sys
input = sys.stdin.readline
import sys
sys.setrecursionlimit(10**7)
def main(n,ab,px):
g=[[]for _ in range(n)]
for a,b in ab:
g[a-1].append(b-1)
g[b-1].append(a-1)
ans=[0 for _ in range(n)]
for p,x in px:
ans[p-1]+=x
def dfs(seen,i):
seen[i]=1
for li in g[i]:
... | p02936 |
import sys
sys.setrecursionlimit(200005)
n, q = list(map(int, input().split()))
to = [[] for i in range(n+1)]
for i in range(n-1):
a, b = list(map(int, input().split()))
to[a].append(b)
to[b].append(a)
score = [0]*(n+1)
for i in range(q):
p, x = list(map(int, input().split()))
sco... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(200005)
n, q = list(map(int, input().split()))
to = [[] for i in range(n+1)]
for i in range(n-1):
a, b = list(map(int, input().split()))
to[a].append(b)
to[b].append(a)
score = [0]*(n+1)
for i in range(q):
p, x = list(map(int... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, Q = list(map(int, input().split()))
link = [[0]*(N+1) for _ in range(N+1)]
for n in range(N-1):
a, b = list(map(int, input().split()))
link[a][b] = 1
link[b][a] = 1
V = [0] * (N+1)
ans = [0] * (N+1)
for q in range(Q):
p,... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(int(1E+7))
def main():
N, Q = list(map(int, input().split()))
link = [[] for _ in range(N+1)]
for n in range(N-1):
a, b = list(map(int, input().split()))
link[a].append(b)
link[b].append(a)
V = [0] * (N+1)
... | p02936 |
import sys
sys.setrecursionlimit(10**6)
N,Q=list(map(int,input().split()))
L=[[] for _ in range(N)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
a-=1
b-=1
L[a].append(b)
L[b].append(a)
CL=[0]*N
for _ in range(Q):
p,x=list(map(int,input().split()))
CL[p-1]+=x
AL=[0]... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**6)
N,Q=list(map(int,input().split()))
L=[[] for _ in range(N)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
a-=1
b-=1
L[a].append(b)
L[b].append(a)
CL=[0]*N
for _ in range(Q):
p,x=list(map(int,input().split()))... | p02936 |
n, q = list(map(int,input().split()))
ikeru = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
ikeru[a-1].append(b-1)
ikeru[b-1].append(a-1)
fukasa = [0 for _ in range(n)]
fukasamoto = [set([]) for _ in range(n)]
fukasamoto[0].add(0)
kaisuu = 0
settansaku = set([])
setm... | n, q = list(map(int,input().split()))
ikeru = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
ikeru[a-1].append(b-1)
ikeru[b-1].append(a-1)
kasan = [0 for _ in range(n)]
for i in range(q):
p, x = list(map(int,input().split()))
kasan[p-1] += x
ansl = [0 for _ in rang... | p02936 |
N, Q = list(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)]
graph = [[] for _ in range(N)]
for i, (ai, bi) in enumerate(ab):
graph[ai - 1].append(bi - 1)
graph[bi - 1].append(ai - 1)
from collections im... | N, Q = list(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)]
# graph = [[] for _ in range(N)]
# for i, (ai, bi) in enumerate(ab):
# graph[ai - 1].append(bi - 1)
# graph[bi - 1].append(ai - 1)
from co... | p02936 |
import sys
sys.setrecursionlimit(10**6)
def main():
N, Q = list(map(int, input().split()))
E = [[] for i in range(N+1)]
counter = [0] * (N+1)
for i in range(N-1):
a, b = list(map(int, input().split()))
E[a].append(b)
E[b].append(a)
for i in range(Q):
# ... | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
N, Q = list(map(int, input().split()))
E = [[] for i in range(N+1)]
counter = [0] * (N+1)
for i in range(N-1):
a, b = list(map(int, input().split()))
E[a].append(b)
E[b].append(a)
... | p02936 |
from collections import deque
n, q = list(map(int, input().split()))
g = [[] for i in range(n)]
k = []
for i in range(n-1):
a,b = list(map(int, input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
for i in range(q):
a,b = list(map(int, input().split()))
k.append([a-1,b])
m = [-1]*n
m[0] = 0
q ... | from collections import deque
n, q = list(map(int, input().split()))
g = [[] for i in range(n)]
k = []
for i in range(n-1):
a,b = list(map(int, input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
for i in range(q):
a,b = list(map(int, input().split()))
k.append([a-1,b])
m = [-1]*n
m[0] = 0
m1... | p02936 |
from collections import deque
n, q = list(map(int, input().split()))
g = [[] for i in range(n)]
k = []
for i in range(n-1):
a,b = list(map(int, input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
for i in range(q):
a,b = list(map(int, input().split()))
k.append([a-1,b])
m = [-1]*n
m[0] = 0
m1... | from collections import deque
n, q = list(map(int, input().split()))
g = [[] for i in range(n)]
k = []
for i in range(n-1):
a,b = list(map(int, input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
for i in range(q):
a,b = list(map(int, input().split()))
k.append([a-1,b])
m = [-1]*n
m[0] = 0
m1... | p02936 |
N,Q=list(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)]
eda=[[] for i in range(N+1)]
pt= [0 for i in range(N+1)]
for a,b in AB:
eda[a].append(b)
eda[b].append(a)
for p,x in PX:
pt[p]+=x
eda=[sorted(i) for ... | N,Q=list(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)]
eda=[[] for i in range(N+1)]
pt= [0 for i in range(N+1)]
for a,b in AB:
eda[a].append(b)
eda[b].append(a)
for p,x in PX:
pt[p]+=x
stack=[[1,eda[1... | p02936 |
class Node:
def __init__(self):
self.counter = 0
self.childs = []
self.parents = set()
def add_child(self, node):
self.childs.append(node)
def add_parents(self, node):
self.parents.add(node)
N, Q = [int(i) for i in input().split()]
ndic = {}
for i in range(1, N+1):
ndic[i] = No... | n, q = list(map(int, input().split()))
tree = {i:[] for i in range(1, n + 1)}
for _ in range(1, n):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
cnt = [0]*n
for _ in range(q):
p, x = list(map(int, input().split()))
cnt[p-1] += x
check = [0]*n
tmp ... | p02936 |
# ABC138D
import sys
sys.setrecursionlimit(1000000000)
def dfs(kol,adj,v,p):
for nv in adj[v]:
if nv==p:
continue
else:
dfs(kol,adj,nv,v)
kol[v]+=[v]
if p!=-1:
kol[p]+=kol[v]
N,Q=map(int,input().split())
adj=[[] for i in range(N)]
for i in rang... | # ABC138D
import sys
sys.setrecursionlimit(1000000000)
def dfs(adj,v,p,px,x,ct):
x+=px[v]
for nv in adj[v]:
if nv==p:
continue
else:
dfs(adj,nv,v,px,x,ct)
ct[v]+=x
N,Q=map(int,input().split())
adj=[[] for i in range(N)]
for i in range(N-1):
a,b... | p02936 |
# ABC138D
import sys
sys.setrecursionlimit(1000000000)
def dfs(adj,v,p,px,x,ct):
x+=px[v]
for nv in adj[v]:
if nv==p:
continue
else:
dfs(adj,nv,v,px,x,ct)
ct[v]+=x
N,Q=map(int,input().split())
adj=[[] for i in range(N)]
for i in range(N-1):
a,b... | # ABC138D
import sys
input=sys.stdin.readline
sys.setrecursionlimit(1000000000)
def dfs(adj,v,p,px,x,ct):
x+=px[v]
for nv in adj[v]:
if nv==p:
continue
else:
dfs(adj,nv,v,px,x,ct)
ct[v]+=x
def main():
N,Q=map(int,input().split())
adj=[[] fo... | p02936 |
import sys
sys.setrecursionlimit(10**7)
def main():
N, Q = [int(i) for i in input().split()]
V = [set() for _ in range(N)]
for _ in range(N - 1):
a, b = [int(i) - 1 for i in input().split()]
V[a].add(b)
V[b].add(a)
C = [0] * N
for _ in range(Q):
p, x = [i... | def main():
N, Q = [int(i) for i in input().split()]
V = [set() for _ in range(N)]
for _ in range(N - 1):
a, b = [int(i) - 1 for i in input().split()]
V[a].add(b)
V[b].add(a)
C = [0] * N
for _ in range(Q):
p, x = [int(i) for i in input().split()]
C[p... | p02936 |
def main():
N, Q = [int(i) for i in input().split()]
V = [set() for _ in range(N)]
for _ in range(N - 1):
a, b = [int(i) - 1 for i in input().split()]
V[a].add(b)
V[b].add(a)
C = [0] * N
for _ in range(Q):
p, x = [int(i) for i in input().split()]
C[p... | def main():
N, Q = [int(i) for i in input().split()]
V = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = [int(i) - 1 for i in input().split()]
V[a].append(b)
V[b].append(a)
C = [0] * N
for _ in range(Q):
p, x = [int(i) for i in input().split()]
... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
val = [0] * (N)
for _ in range(Q):
p, ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
val = [0] * (N)
for _ in range(Q):
p, ... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
val = [0] * (N)
for _ in range(Q):
p, ... | import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
val = [0] * (N)
for _ in range(Q):
p, x = list(map(int, input().split(... | p02936 |
import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
val = [0] * (N)
for _ in range(Q):
p, x = list(map(int, input().split(... | import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
val = [0] * (N)
for _ in range(Q):
p, x = list(map(int, input().split(... | p02936 |
import sys
input = sys.stdin.readline #入力行数が多いから高速化が必要
sys.setrecursionlimit(int(1E+7))
#小さすぎるデフォルト値を変え再起処理の上限を引き上げる(だいたい1000やから)
def main():
n ,q = list(map(int,input().split()))
link = [[] for i in range(n + 1)]
for i in range(n - 1):
a,b = list(map(int,input().split()))
link[a]... | #<D>
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
def main():
N, Q = list(map(int ,input().split()))
link = [[] for n in range(N + 1)]
for n in range(N - 1):
a, b = list(map(int, input().split()))
link[a].append(b)
link[b].append(a)
V = [0] * (N... | p02936 |
from collections import deque
import sys
sys.setrecursionlimit(10**7)
N, Q = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
count = [0 for i in range(N)]
for i in range(Q):
p, x... | from collections import deque
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
count = [0 for i in range(N)]
... | p02936 |
from collections import deque
N, Q = list(map(int, input().split()))
adj = [[] for _ in range(N + 1)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
adj[a].append(b)
adj[b].append(a)
point = [0] * (N + 1)
for _ in range(Q):
p, x = list(map(int, input().split()))
point[p] +... | from collections import deque
N, Q = list(map(int, input().split()))
adj = [[] for _ in range(N + 1)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
adj[a].append(b)
adj[b].append(a)
point = [0] * (N + 1)
for _ in range(Q):
p, x = list(map(int, input().split()))
point[p] +... | p02936 |
from collections import defaultdict
def calc_parents(N, adj_nodes, root=0):
parents = [-1 for _ in range(N)]
frontier = [root]
parents[root] = root
while len(frontier) > 0:
node = frontier.pop()
for child in adj_nodes[node]:
if parents[child] >= 0:
... | from collections import defaultdict
def sum_counter(N, adj_nodes, counter_roots, root=0):
parents = [-1 for _ in range(N)]
counter = [0 for _ in range(N)]
frontier = [root]
counter[root] += counter_roots[root]
parents[root] = root
while len(frontier) > 0:
parent = frontier.po... | p02936 |
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
inpl = lambda: list(map(int,input().split()))
N, Q = inpl()
neighbor = [[] for i in range(N)]
for i in range(N-1):
a, b = inpl()
a -= 1
b -= 1
neighbor[a].append(b)
neighbor[b].append(a)
X = [0] * N
for _ in range(Q):
... | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
inpl = lambda: list(map(int,input().split()))
N, Q = inpl()
neighbor = [[] for i in range(N)]
for i in range(N-1):
a, b = inpl()
a -= 1
b -= 1
neighbor[a].append(b)
neighbor[b].append(a)
X = [0] * N
for _ in range(Q):
... | p02936 |
from queue import Queue
n , q = list(map(int, input().split()))
lab = []
points = [0]*n
for i in range(n-1):
lab.append(list(map(int, input().split())))
lpx = []
for i in range(q):
lpx.append(list(map(int, input().split())))
lll = []
for i in range(n):
childs = Queue()
inc = []
pare... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,Q = list(map(int,input().split()))
aLst = [[int(x) for x in input().split()] for _ in range(N-1)]
pLst = [[int(x) for x in input().split()] for _ in range(Q)]
tmpLst = [[] for _ in range(N+1)]
for i, j in aLst:
tmpLst[i].append(j)
... | p02936 |
import sys
sys.setrecursionlimit(1000000)
s=sys.stdin.readlines()
n,q=list(map(int,s[0].split()))
G=[[]*n for i in range(n)]
P=[0]*n
V=[0]*n
R=[0]*n
for e in s[1:n]:
a,b=list(map(int,e.split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
for e in s[n:]:
c,d=list(map(int,e.split()))
P[c-1]+=... | import sys
sys.setrecursionlimit(1000000)
s=sys.stdin.readlines()
n,q=list(map(int,s[0].split()))
G=[[]*n for i in range(n)]
P=[0]*n
V=[0]*n
R=[0]*n
for e in s[1:n]:
a,b=list(map(int,e.split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
for e in s[n:]:
c,d=list(map(int,e.split()))
P[c-1]+=... | p02936 |
import sys
sys.setrecursionlimit(1000000)
s=sys.stdin.readlines()
n,q=list(map(int,s[0].split()))
G=[[]*n for i in range(n)]
P=[0]*n
V=[0]*n
R=[0]*n
for e in s[1:n]:
a,b=list(map(int,e.split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
for e in s[n:]:
c,d=list(map(int,e.split()))
P[c-1]+=... | import sys
sys.setrecursionlimit(1000000)
s=sys.stdin.readlines()
n,q=list(map(int,s[0].split()))
G=[[]*n for i in range(n)]
P=[0]*n
V=[0]*n
for e in s[1:n]:
a,b=list(map(int,e.split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
for e in s[n:]:
c,d=list(map(int,e.split()))
P[c-1]+=d
def ds... | p02936 |
# -*- coding: utf-8 -*-
N, Q = list(map(int,input().split()))
Node = [-1] * N
Counter = [0] * N
Result = [0] * N
for i in range(N-1):
a, b = list(map(int,input().split()))
Node[b-1] = a-1
for i in range(Q):
p, x = list(map(int,input().split()))
Counter[p-1] += x
for i in range(N):
... | # -*- coding: utf-8 -*-
N, Q = list(map(int,input().split()))
Node = [-1] * N
Counter = [0] * N
Result = [0] * N
for i in range(N-1):
a, b = list(map(int,input().split()))
Node[b-1] = a-1
for i in range(Q):
p, x = list(map(int,input().split()))
Counter[p-1] += x
for i in range(N):
... | p02936 |
import sys
input = sys.stdin.readline
n, q = [int(x) for x in input().split()]
edge = [[] for _ in range(n)]
counter = [0] * n
for _ in range(n-1):
a, b = [int(x) for x in input().split()]
edge[a-1].append(b-1)
edge[b-1].append(a-1)
for _ in range(q):
a, b = [int(x) for x in input(... |
import sys
input = sys.stdin.readline
n, q = [int(x) for x in input().split()]
edge = [[] for _ in range(n)]
counter = [0] * n
for _ in range(n-1):
a, b = [int(x) for x in input().split()]
edge[a-1].append(b-1)
edge[b-1].append(a-1)
for _ in range(q):
a, b = [int(x) for x in input(... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def dfs(G, v, p, C):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
for c in G[v]:
if c == p:
continue
dfs(G, c, v, C)
C[v].extend(C[c])
def main():
N, Q = list(map(... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def dfs(G, v, p, point):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
for c in G[v]:
if c == p:
continue
point[c] += point[v]
dfs(G, c, v, point)
def main():
N, Q ... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def dfs(G, v, p, point):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
for c in G[v]:
if c == p:
continue
point[c] += point[v]
dfs(G, c, v, point)
def main():
N, Q ... | import sys
input = sys.stdin.readline # NOQA
sys.setrecursionlimit(10 ** 7) # NOQA
def dfs(G, v, p, counter):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
counter_v = counter[v]
for c in G[v]:
if c == p:
continue # Avoid multiple access to parent
... | p02936 |
n,q = list(map(int,input().split()))
hen = [[0,0]]*n
for i in range(n-1) :
hen[i] = list(map(int,input().split()))
xlist = [0]*n
for k in range(q) :
p,x = list(map(int,input().split()))
xlist[p-1] += x
y = [0]*n
for i in range(n) :
y[i] += xlist[i]
r = i
while True :
... | n,q = list(map(int,input().split()))
hen = [[0,0]]*(n-1)
for i in range(n-1) :
hen[i] = list(map(int,input().split()))
xlist = [0]*n
for k in range(q) :
p,x = list(map(int,input().split()))
xlist[p-1] += x
#---
hen = sorted(hen, key=lambda x:x[1])
hen = sorted(hen, key=lambda x:x[0])
fo... | p02936 |
import sys
sys.setrecursionlimit(10 ** 7)
n, q = map(int, input().split())
ab = [tuple(map(int,input().split())) for i in range(n-1)]
px = [tuple(map(int,input().split())) for i in range(q)]
es = [[] for i in range(n)]
for a,b in ab:
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
visited = ... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, q = map(int, input().split())
ab = [tuple(map(int,input().split())) for i in range(n-1)]
px = [tuple(map(int,input().split())) for i in range(q)]
es = [[] for i in range(n)]
for a,b in ab:
a,b = a-1,b-1
es[a].append(b)
es[... | p02936 |
import sys
sys.setrecursionlimit(10**7)
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
P = [0 for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
for _ in range(Q):
p, x = list(map(int, ... | import sys
input = sys.stdin.readline #for input speed
sys.setrecursionlimit(10**6) #for deep recursion
N, Q = list(map(int, input().split()))
v = [[] for i in range(N)]
score = [0]*N
def dfs(cur,par):
for chi in v[cur]:
if chi == par:
continue
score[chi] += score[cur]
dfs(chi, cur)... | p02936 |
import sys
sys.setrecursionlimit(10**9)
def dfs(now, prev):
ans[now]+=(h[now]+ans[prev])
# 今いる頂点から行ける頂点を順に next に入れてループ
for next in g[now]:
if next != prev:
if memo[next]==True:
# 過去に訪れていれば終わらせる
return False
else:
... | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def dfs(now, prev):
ans[now]+=(h[now]+ans[prev])
# 今いる頂点から行ける頂点を順に next に入れてループ
for next in g[now]:
if next != prev:
if memo[next]==True:
# 過去に訪れていれば終わらせる
return False
... | p02936 |
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def dfs(now, prev):
ans[now]+=(h[now]+ans[prev])
# 今いる頂点から行ける頂点を順に next に入れてループ
for next in g[now]:
if next != prev:
if memo[next]==True:
# 過去に訪れていれば終わらせる
return False
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def dfs(now, prev):
ans[now]+=(h[now]+ans[prev])
# 今いる頂点から行ける頂点を順に next に入れてループ
for next in g[now]:
if next != prev:
dfs(next, now)
n, q = list(map(int, input().split()))
g = [[] * n for i in range(n)]
... | p02936 |
n, q = [int(x) for x in input().split()]
vs = []
us = [1]
xs = None
for _ in range(0, n + 1):
vs.append([])
xs = [0] * (n + 1)
for _ in range(0, n - 1):
a, b = [int(x) for x in input().split()]
vs[a].append(b)
vs[b].append(a)
for _ in range(0, q):
p, x = [int(x) for x in input().split()... | n, q = [int(x) for x in input().split()]
vs = []
for _ in range(0, n + 1):
vs.append([])
xs = [0] * (n + 1)
fs = [False] * (n + 1)
us = [0] * n
fs[1] = True
us[0] = 1
ui = 0
for _ in range(0, n - 1):
a, b = [int(x) for x in input().split()]
vs[a].append(b)
vs[b].append(a)
... | p02936 |
n,q=list(map(int,input().split()))
node=[0 for i in range(n)]
tree=[]
for i in range(n-1):
tree.append(list(map(int,input().split())))
def counter(p,x,cnt):
for i in range(n-1):
if tree[i][0]==p:
if cnt[tree[i][1]-1]!=1:
node[tree[i][1]-1]+=x
cnt[tre... | n,q=list(map(int,input().split()))
c=[0 for i in range(n)]
tree=sorted([list(map(int,input().split())) for i in range(n-1)])
for j in range(q):
p,x=list(map(int,input().split()))
c[p-1]+=x
for i in range(n-1):
c[tree[i][1]-1]+=c[tree[i][0]-1]
for i in range(n):
c[i]=str(c[i])
print((' '.join(c... | p02936 |
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000)
# N <= 2*10^5
# Q <= 2*10^5
N, Q = [int(x) for x in stdin.readline().rstrip().split()]
#ab = [list(map(int, stdin.re... | from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
INF = 10 ** 10
# N <= 2*10^5
# Q <= 2*10^5
N, Q = [int(x) for x in stdin.readline().rstrip().split()]
ab = [list(map(int, stdin.readline().rstrip().split())) for _ in range(N-1... | p02936 |
import sys
sys.setrecursionlimit(10**6)
n,q = list(map(int,input().split()))
a=[[] for i in range(n)]
l=[0 for _ in range(n)]
ans=[0 for _ in range(n)]
def dfs(parent,current,value):
value += l[current]
ans[current] = value
for i in a[current]:
if i == parent:
continue
... | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,q = list(map(int,readline().split()))
a=[[] for i in range(n)]
l=[0 for _ in range(n)]
ans=[0 for _ in range(n)]
def dfs(parent,current,value):
value += l[current]
ans[current] = value
for i in a[current]:
if i ... | p02936 |
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,q = list(map(int,readline().split()))
a=[[] for i in range(n)]
l=[0 for _ in range(n)]
ans=[0 for _ in range(n)]
def dfs(parent,current,value):
value += l[current]
ans[current] = value
for i in a[current]:
if i ... | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,q = list(map(int,readline().split()))
a=[[] for i in range(n)]
l=[0]*n
ans=[0]*n
def dfs(parent,current,value):
value += l[current]
ans[current] = value
for i in a[current]:
if i != parent:
dfs(curr... | p02936 |
from collections import deque
N,Q=map(int,input().split())
nondirtree=[[] for _ in range(N)]
dirtree=[[] for _ in range(N)]
rootflag=[0]*N
rootflag[0]=1
for i in range(N-1):
a,b=map(int,input().split())
nondirtree[a-1].append(b-1)
nondirtree[b - 1].append(a - 1)
points=[list(map(int,input().split(... | from collections import deque
N,Q=map(int,input().split())
nondirtree=[[] for _ in range(N)]
dirtree=[[] for _ in range(N)]
rootflag=[0]*N
rootflag[0]=1
for i in range(N-1):
a,b=map(int,input().split())
nondirtree[a-1].append(b-1)
nondirtree[b - 1].append(a - 1)
points=[list(map(int,input().split(... | p02936 |
import itertools
while 1:
n=int(eval(input()))
if n==0:break
l=[int(eval(input())) for _ in range(n)]
print((sum([sum(sorted(l)[:len(l)-1][:i]) for i in range(1,len(l))])))
| import itertools
while 1:
n=int(eval(input()))
if n==0:break
l=[int(eval(input())) for _ in range(n)]
ll=len(l)
m=sorted(l)[:ll-1]
print((sum([sum(m[:i]) for i in range(1,ll)])))
| p00112 |
while True:
n = int(eval(input()))
if not n:
break
else:
lst = [int(eval(input())) for _ in range(n)]
lst.sort()
acc = ans = 0
for i in lst:
ans += acc
acc += i
print(ans)
| while True:
n = int(eval(input()))
if not n:
break
lst = sorted([int(eval(input())) for _ in range(n)])
print((sum([(n - i - 1) * lst[i] for i in range(n)])))
| p00112 |
while 1:
n = eval(input())
if n == 0: break
que = sorted([int(input()) for i in range(n)])
print(sum([sum(que[:i]) for i in range(1,n)])) | while 1:
n = eval(input())
if n == 0: break
q = sorted([int(input()) for i in range(n)])
t = [0]*n
for i in range(1,n):
t[i] = t[i-1] + q[i-1]
print(sum(t)) | p00112 |
while 1:
n=eval(input())
if n==0: break
x=sorted([eval(input()) for _ in [0]*n])
s=0
a=0
for e in x[:-1]: a+=e; s+=a
print(s) | while 1:
n=eval(input())
if n==0: break
x=sorted([int(input()) for _ in [0]*n])
s=0
a=0
for e in x[:-1]: a+=e; s+=a
print(s) | p00112 |
while 1:
n=int(input())
if n==0: break
x=sorted([int(input()) for _ in [0]*n])
s=0
a=0
for e in x[:-1]: a+=e; s+=a
print(s) | while 1:
n=int(input())
if n==0: break
x=sorted(map(int,[input() for _ in [0]*n]))
s=a=0
for e in x[:-1]: a+=e; s+=a
print(s) | p00112 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | p03076 |
import math
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
ceil = lambda number: math.ceil(number / 10) * 10
minutes = [A, B, C, D, E]
ceiled_minutes = list(map(ceil, minutes))
maximum_diff = 0
for minute in minutes:
ceiled = cei... | import math
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
ceil = lambda number: math.ceil(number / 10) * 10
minutes = [A, B, C, D, E]
ceiled_minutes = list(map(ceil, minutes))
minimum = 10
for minute in minutes:
digit_1st = minu... | p03076 |
a = [ int(eval(input())) for _ in range(5)]
n = float("inf")
for i in range(5):
if 0 < a[i] % 2 < 10:
n = min(n,a[i] % 10)
else:
if n == float("inf"):
n = 10
print((sum([(-a[i]//10)*-10 for i in range(5)]) -(10-n))) | a = [int(eval(input())) for _ in range(5)]
b = 10-min([a[i]%10 for i in range(5) if 0 < a[i]%10] or [10])
print((sum([(-(-a[i]//10)) for i in range(5)])*10-b)) | p03076 |
A = sorted( [input()[::-1] for i in range(5)] )
while (A[0][0] == "0"):
tmp = A.pop(0)
A.append(tmp)
A = [int(a[::-1]) for a in A][::-1]
def roundUp(n):
return n if n%10==0 else n + (10-n%10)
print((sum([roundUp(A[i]) for i in range(4)]) + A[4]))
| A = sorted( [input()[::-1] for i in range(5)] )
c = 0
while (A[0][0] == "0" and c<5):
tmp = A.pop(0)
A.append(tmp)
c+=1
A = [int(a[::-1]) for a in A][::-1]
def roundUp(n):
return n if n%10==0 else n + (10-n%10)
print((sum([roundUp(A[i]) for i in range(4)]) + A[4]))
| p03076 |
from itertools import permutations
l = [int(eval(input())) for _ in range(5)]
minT = 10000
for a in permutations(l,5):
t = 0
for dish in a:
if t%10 != 0:
t += 10 - t%10
t += dish
minT = min(minT,t)
print(minT)
|
a = [int(eval(input())) for _ in range(5)]
b = []
for i in range(len(a)):
if a[i] % 10 == 0:
b.append(0)
else:
b.append(10 - (a[i] % 10))
c = b.index(max(b))
ans = 0
for i in range(5):
if i !=c:
if a[i] % 10 == 0:
ans += a[i]
else:
an... | p03076 |
A=list(int(eval(input()))for i in range(5))
ans=0
num=0
com=0
for a in A:
if a%10==0:
ans+=a
else:
tmp=10-a%10
ans+=(a//10+1)*10
if com<tmp:
com=tmp
num=a
if num==0:
print(ans)
else:
ans-=(num//10+1)*10
ans+=num
print(ans)... | A=list(int(eval(input()))for i in range(5))
B=[a-a%10+10 if a%10!=0 else a for a in A]
diff=[(b-a)for a,b in zip(A,B)]
print((sum(B)-max(diff)))
| p03076 |
from itertools import permutations
foods = [int(eval(input())) for i in range(5)]
ans = 1230
for i in permutations(foods):
tmp = 0
for j in range(4):
tmp += -(-i[j] // 10)
tmp *= 10
tmp += i[4]
ans = min(ans, tmp)
print(ans) | foods = [int(eval(input())) for i in range(5)]
amari = [i % 10 for i in foods]
kiriage = [-(-i//10) for i in foods]
min_amari = 10
for i in amari:
if 1 <= i < min_amari:
min_amari = i
print((sum(kiriage) * 10 - (10 - (10 if max(amari) == 0 else min_amari)))) | p03076 |
#!/usr/bin/env python3
import re
a = []
b = []
for i in range(5):
x = int(eval(input()))
a.append(x)
x = x%10
b.append(x)
count = 0
min = 123
k = 0
for i in range(5):
if(b[i] != 0 and min > b[i]):
min = b[i]
k = i
for i in range(5):
if(i != k and b[i] != 0)... | #!/usr/bin/env python3
#ABC123 B
LI = [int(eval(input())) for _ in range(5)]
LI2 = [LI[i] % 10 for i in range(5)]
x = [(LI[i],LI2[i]) for i in range(5)]
#print(x)
ans = 0
x = sorted(x, key = lambda x:x[1],reverse = True)
for i in range(5):
if x[i][1] == 0:
t = x[i]
x.remove(t)
... | p03076 |
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
l=[a,b,c,d,e]
ansl=[]
import itertools
for v in itertools.permutations(l,5):
orderl=list(v)
#print(orderl)
t=0
for order_time in orderl:
if t%10!=0:
t=((t//10)+1)*10
t+=order_t... | tl=[int(eval(input())) for i in range(5)]
import itertools
ansl=[]
for tup in itertools.permutations(tl):
t=list(tup)
c=0
for i in range(4):
c+=t[i]
if c%10!=0:
c=(c//10 +1)*10
ansl.append(c+t[-1])
print((min(ansl))) | p03076 |
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
def time(x):
return (x+9)//10*10
def last(x):
return time(x)-x
sum_time=time(a)+time(b)+time(c)+time(d)+time(e)
ans=sum_time-max(last(a),last(b),last(c),last(d),last(e))
print(ans) | a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
def time(x):
return (x+9)//10*10
def last(x):
return time(x)-x
sum_tim=time(a)+time(b)+time(c)+time(d)+time(e)
ans=sum_tim-max(last(a),last(b),last(c),last(d),last(e))
print(ans) | p03076 |
def round_up(i):
if i % 10 == 0:
return i
return 10 - i % 10 + i
minutes = [int(eval(input())) for i in range(5)]
m = [round_up(i) for i in minutes]
last = min((minutes[l] - 1) % 10 for l in range(5)) + 1
print((sum(m) + last - 10))
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
arr = [i_i() for _ in range(5)]
arr.sort(key=lambda a: a%10)
flag = True
ans = 0
for x in arr:
if flag and x % 10 >= 1:... | p03076 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.