input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# dp[n][i][j]=(頂点iから頂点jへ行く長さnのパスの個数)
# dp[n][i][j]=sum(dp[n-1][i][k]*a[k][j])⇒DP[n]=DP[n-1]*A DP[0]=Eより DP[n]=A^n
n,k=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(n)]
dp=[[0]*n for i in range(n)]
mod=10**9+7
for i in range(n):
for j in range(n):
dp[i][i]=1
def dot... | # dp[n][i][j]=(頂点iから頂点jへ行く長さnのパスの個数)
# dp[n][i][j]=sum(dp[n-1][i][k]*a[k][j])⇒DP[n]=DP[n-1]*A DP[0]=Eより DP[n]=A^n
import sys
input = sys.stdin.readline
def dot(A,B,MOD=1000000007):
N,M,L = len(A),len(A[0]),len(B[0])
res = [[0]*L for i in range(N)]
for i in range(N):
for j in range(L):
... | p03177 |
def matDot(A,B,MOD):
N,M,L = len(A),len(A[0]),len(B[0])
res = [[0]*L for i in range(N)]
for i in range(N):
for j in range(L):
s = 0
for k in range(M):
s = (s + A[i][k]*B[k][j]) % MOD
res[i][j] = s
return res
def matPow... | def matDot(A,B,MOD):
N,M,L = len(A),len(A[0]),len(B[0])
res = [[0]*L for i in range(N)]
for i in range(N):
for j in range(L):
s = 0
for k in range(M):
s = (s + A[i][k]*B[k][j]) % MOD
res[i][j] = s
return res
def matPow... | p03177 |
def solve():
MOD = 10**9 + 7
N, K = list(map(int, input().split()))
Ass = [tuple(map(int, input().split())) for _ in range(N)]
maxD = K.bit_length() - 1
dp = [[[0]*(N) for j in range(N)] for i in range(maxD+1)]
for v, As in enumerate(Ass):
nums = [0] * N
for v2, A i... | from operator import mul
def solve():
MOD = 10**9 + 7
N, K = list(map(int, input().split()))
Ass = [tuple(map(int, input().split())) for _ in range(N)]
def getMatrixProduct(Ass, Bss, MOD):
BssTr = list(map(list, list(zip(*Bss))))
Ax = len(Ass)
By = len(Bss[0])
... | p03177 |
N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
MOD = 10**9+7
def dot(A, B):
N = len(A)
K = len(A[0])
assert len(B) == K
M = len(B[0])
C = [[0] * M for _ in range(N)]
for i in range(N):
for j in range(M):
for k in ... | N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
MOD = 10**9+7
def dot(A, B):
N = len(A)
K = len(A[0])
assert len(B) == K
M = len(B[0])
C = [[0] * M for _ in range(N)]
for i in range(N):
for j in range(M):
C[i][j] =... | p03177 |
N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
MOD = 10**9+7
def dot(A, B):
N = len(A)
K = len(A[0])
assert len(B) == K
M = len(B[0])
C = [[0] * M for _ in range(N)]
for i in range(N):
for j in range(M):
for k in ... | N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
MOD = 10**9+7
def dot(A, B):
N = len(A)
K = len(A[0])
assert len(B) == K
M = len(B[0])
C = [[0] * M for _ in range(N)]
for i in range(N):
for j in range(M):
for k in ... | p03177 |
import sys
input = sys.stdin.readline
def dot(a, b):
c = [[0] * n for _ in range(n)]
for i, ai in enumerate(a):
for j, bj in enumerate(zip(*b)):
ck = 0
for ak, bk in zip(ai, bj):
ck += ak * bk
c[i][j] = ck % md
return c
def... | import sys
input = sys.stdin.readline
def dot(a, b):
c = [[0] * n for _ in range(n)]
for i, ai in enumerate(a):
for j, bj in enumerate(zip(*b)):
c[i][j] = sum(ak * bk for ak, bk in zip(ai, bj)) % md
return c
def pwr(a, k):
c = None
while c == None:
if... | p03177 |
import sys
sys.setrecursionlimit(10**9)
N,K=list(map(int,input().strip().split(' ')))
A=[]
for _ in range(N):
A+=[list(map(int,input().strip().split(' ')))]
dic={}
MOD=10**9+7
def findout(i,j,k):
if k==1:
if A[i][j]==1:
return 1
else:
return 0
if (... | N,K=list(map(int,input().strip().split(' ')))
A=[]
for _ in range(N):
A+=[list(map(int,input().strip().split(' ')))]
dic={}
MOD=10**9+7
power=1
while 2**power<=K:
power+=1
dp=[[[0 for j in range(N)] for i in range(N)] for p in range(power+1) ]
for p in range(0,power+1):
if p==0:
... | p03177 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**7)
n,k = list(map(int,input().split()))
A = [list(map(int,input().spli... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,k = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(n)]
def ... | p03177 |
MOD = 10**9 + 7
def mul(a, b):
return [
[sum(aij * bij for aij, bij in zip(ai, bi)) % MOD for bi in zip(*b)]
for ai in a]
def pow(b, k):
if k == 1:
return b
i = 0
while 2 ** (i + 1)<= k:
i += 1
k -= 2 ** i
if k > 0:
t = pow(b, k)
fo... | MOD = 10**9 + 7
def mul(a, b):
return [
[sum(aij * bij for aij, bij in zip(ai, bi)) % MOD for bi in zip(*b)]
for ai in a]
def pow(b, k):
r = [[1 if i == j else 0 for i in range(len(b))] for j in range(len(b))]
while k:
if k & 1:
r = mul(r, b)
k >>= 1... | p03177 |
# coding: utf-8
# Your code here!
MOD=10**9+7
def dot(a, b):
res = [[0] * n for _ in range(n)]
for i in range(n):
for k, aik in enumerate(a[i]):
for j,bkj in enumerate(b[k]):
res[i][j] += aik*bkj
res[i][j] %= MOD
return res
n,k = [int(i) f... | # coding: utf-8
# Your code here!
MOD=10**9+7
def matmul(A, B, mod): # A,B: 行列
res = [[0] * len(B[0]) for _ in range(len(A))]
for i, resi in enumerate(res):
for k, aik in enumerate(A[i]):
for j,bkj in enumerate(B[k]):
resi[j] += aik*bkj
resi[j] %= m... | p03177 |
# @author
import sys
class RWalk:
def solve(self):
MOD = 10 ** 9 + 7
def mult(A, B):
n, m, p = len(A), len(A[0]), len(B[0])
assert(len(B) == m)
C = [[0] * p for _ in range(n)]
for i in range(n):
for j in range(p):
... | # @author
import sys
class RWalk:
def solve(self):
MOD = 10 ** 9 + 7
def mult(A, B):
n, m, p = len(A), len(A[0]), len(B[0])
assert(len(B) == m)
C = [[0] * p for _ in range(n)]
for i in range(n):
for k in range(m):
... | p03177 |
N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
MOD = 10**9 + 7
def dot(M1, M2, mod=10**9+7):
n = len(M1)
res = [[0]*n for _ in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
res[i][j] += M1[i][k] * M2[k][j] % MOD
... | N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
MOD = 10**9 + 7
def dot(M1, M2, mod=10**9+7):
n = len(M1)
res = [[0]*n for _ in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
res[i][j] = (res[i][j] + M1[i][k] * M2[k]... | p03177 |
import sys
sys.setrecursionlimit(10 ** 6)
def main():
N, Q = list(map(int, input().split()))
G = []
for i in range(N):
G.append([False] * N)
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a-1][b-1] = True
G[b-1][a-1] = True
c = [0] * ... | import sys
sys.setrecursionlimit(10 ** 6)
def main():
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()))
# G[a-1][b-1] = True
# G[b-1][a-1] = True
G[a-1].append... | p02936 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5 * 2)
N, Q = list(map(int, input().split()))
V = {i: [] for i in range(1,N+1)}
for _ in range(N-1):
a, b = list(map(int, input().split()))
V[a].append(b)
V[b].append(a)
C = {i: 0 for i in range(1,N+1)}
for _ in range(Q):
p... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N, Q = list(map(int, input().split()))
V = {i: [] for i in range(1,N+1)}
for _ in range(N-1):
a, b = list(map(int, input().split()))
V[a].append(b)
V[b].append(a)
C = {i: 0 for i in range(1,N+1)}
for _ in range(Q):
p, x ... | p02936 |
import copy
n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
L4=[]
for i in range(n):... | n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
L4=[]
for i in range(n):
L4.appen... | p02936 |
n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
L4=[]
for i in range(n):
L4.appen... | import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
... | p02936 |
import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
... | import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[]
for i in range(n):
connection.append([])
for i in range(n-1):
connection[l[i][0]... | p02936 |
n,q=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n-1)]
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
connection[l[i][1]-1].append(l[i][0]-1)
L=[list(map(int,input().split())) for i in range(q)]
ctL=[0]*n
for i in range(q):... | import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n-1)]
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
connection[l[i][1]-1].append(l[i][0]-1)
L=[list(map(int,input().split())) for i in ra... | p02936 |
import sys
sys.setrecursionlimit(10 ** 7)
N,Q = list(map(int,input().split()))
AB = [[int(i) for i in input().split()] for _ in range(N-1)]
PX = [[int(j) for j 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)
counters... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,Q = list(map(int,input().split()))
AB = [[int(i) for i in input().split()] for _ in range(N-1)]
PX = [[int(j) for j in input().split()] for _ in range(Q)]
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[... | 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)]
temp=[[i+1] for i in range(n)]
for i in range(n-2,-1,-1):
if len(temp[ab[i][1]-1]) >= 2:
temp[ab[i][0]-1].extend(temp[ab[i][1]-1])
else:
temp... | 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)]
parent=[0 for i in range(n)]
for i in range(n-1):
parent[ab[i][1]-1]=ab[i][0]
ans=[0 for i in range(n)]
for i in range(q):
ans[px[i][0]-1]+=px[i][1]
for i i... | p02936 |
from pprint import pprint
import queue
def solve(n, q, a, b, p, x):
counter = [0] * n
q_sum = [0] * n
for i in range(q):
q_sum[p[i]] += x[i]
# pprint(q_sum)
edges = {}
for i in range(n-1):
if a[i] not in edges:
edges[a[i]] = []
edges[a[i]].ap... | from collections import deque
def solve(n, q, a, b, p, x):
counter = [0] * n
q_sum = [0] * n
for i in range(q):
q_sum[p[i]] += x[i]
# pprint(q_sum)
edges = {}
for i in range(n-1):
if a[i] not in edges:
edges[a[i]] = []
edges[a[i]].append(b[i])... | p02936 |
from pprint import pprint
from collections import deque, defaultdict
def solve(n, q, edges, p):
counter = defaultdict(int)
parents = deque()
parents.append(0)
while parents:
parent = parents.popleft()
counter[parent] += p[parent]
# print("parent")
# print(... | from pprint import pprint
from collections import deque, defaultdict
def solve(n, q, edges, p):
counter = defaultdict(int)
parents = deque()
parents.append(0)
while parents:
parent = parents.popleft()
counter[parent] += p[parent]
# print("parent")
# print(... | p02936 |
from pprint import pprint
from collections import deque, defaultdict
n, q = list(map(int, input().strip().split(" ")))
edges = defaultdict(set)
for _ in range(n-1):
a_i, b_i = list(map(int, input().strip().split(" ")))
# edges[a_i-1].append(b_i-1)
# edges[b_i-1].append(a_i-1)
edges[a_i-1].add(... | from pprint import pprint
from collections import deque, defaultdict
n, q = list(map(int, input().strip().split(" ")))
# edges = defaultdict(set)
edges = [[] for _ in range(n)]
for _ in range(n-1):
a_i, b_i = list(map(int, input().strip().split(" ")))
edges[a_i-1].append(b_i-1)
edges[b_i-1].append... | p02936 |
from pprint import pprint
from collections import deque, defaultdict
n, q = list(map(int, input().strip().split(" ")))
edges = [[] for _ in range(n)]
for _ in range(n-1):
a_i, b_i = list(map(int, input().strip().split(" ")))
edges[a_i-1].append(b_i-1)
edges[b_i-1].append(a_i-1)
counter = [0] * n... | from pprint import pprint
from collections import deque, defaultdict
import sys
# n, q = map(int, input().strip().split(" "))
n, q = list(map(int, sys.stdin.readline().strip().split(" ")))
edges = [[] for _ in range(n)]
for _ in range(n-1):
# a_i, b_i = map(int, input().strip().split(" "))
a_i, b_i ... | p02936 |
from pprint import pprint
from collections import deque, defaultdict
import sys
# n, q = map(int, input().strip().split(" "))
n, q = list(map(int, sys.stdin.readline().strip().split(" ")))
edges = [[] for _ in range(n)]
for _ in range(n-1):
# a_i, b_i = map(int, input().strip().split(" "))
a_i, b_... | import sys
from collections import deque
N, Q = list(map(int, sys.stdin.readline().split(" ")))
edges = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, sys.stdin.readline().split(" ")))
# print(a, b)
edges[a-1].append(b-1)
edges[b-1].append(a-1)
# print(edges)
# sys.exit()... | p02936 |
import queue
N, Q = list(map(int, input().split()))
tree = [[] for _ in range(N+1)]
value = [0] * (N+1)
visit = [False] * (N+1)
# make_tree
for _ in range(N-1):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
# make_value
for _ in range(Q):
p, x = list(map(in... | import sys
import queue
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
tree = [[] for _ in range(N+1)]
value = [0] * (N+1)
visit = [False] * (N+1)
# make_tree
for _ in range(N-1):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
# make_value
fo... | p02936 |
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
n, q = [int(item) for item in input().split()]
edge = [[] for _ in range(n)]
for i in range(n-1):
a, b = [int(item) for item in input().split()]
a -= 1; b -= 1
edge[a].append(b)
edge[b].append(a)
cost = [0] * n
for i in ... | import sys
sys.setrecursionlimit(10**6)
n, q = [int(item) for item in input().split()]
edge = [[] for _ in range(n)]
for i in range(n-1):
a, b = [int(item) for item in input().split()]
a -= 1; b -= 1
edge[a].append(b)
edge[b].append(a)
cost = [0] * n
for i in range(q):
p, x = [in... | p02936 |
import sys
sys.setrecursionlimit(1000000)
n, q = list(map(int, input().split()))
adj = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
adj[a].append(b)
adj[b].append(a)
p = [0] * n
for _ in range(q):
i, x = list(map(int, input().... | import sys
n, q = list(map(int, input().split()))
adj = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
adj[a].append(b)
res = [0] * n
for _ in range(q):
i, x = list(map(int, input().split()))
res[i-1] += x
parent = [0] * n
stac... | p02936 |
import sys
import collections
sys.setrecursionlimit(1000000)
n, q = list(map(int, input().split()))
cost = collections.deque([])
tree = collections.deque([])
level = collections.deque([])
parent = collections.deque([])
for i in range(210000):
tree.append(collections.deque([]))
level = collections.deque(... | edge = []
n, q = list(map(int, input().split()))
for _ in range(n+100):
edge.append([])
for _ in range(n-1):
a,b = list(map(int, input().split()))
edge[a].append(b)
edge[b].append(a)
res = [0] * (n+1)
cost = [0] * (n+1)
for _ in range(q):
a,b = list(map(int, input().split()))
res[a] ... | p02936 |
N, Q = map(int, input().split())
T = [[] for i in range(N)]
for i in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
T[a].append(b)
T[b].append(a)
Point = [0] * N
for q in range(Q):
p, x = map(int, input().split())
p -= 1
Point[p] += x
ans = [0] * N
stac... | N, Q = map(int, input().split())
T = [[] for i in range(N)]
for i in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
T[a].append(b)
T[b].append(a)
ans = [None] * N
V = [0] * N
for q in range(Q):
p, x = map(int, input().split())
p -= 1
V[p] += x
stack =... | p02936 |
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
root = {}
for i in range(n-1):
a, b = list(map(int, input().split()))
if a in root:
root[a] += [b]
else:
root.setdefault(a, [b])
if b in root:
root[b] += [a]
else:
root.setde... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(300000)
n, q = list(map(int, input().split()))
root = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = list(map(int, input().split()))
root[a].append(b)
root[b].append(a)
cnt = [0 for _ in range(n+1)]
for i in range(q):
... | p02936 |
import sys
from collections import deque
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
def bfs():
visited[0] = True
ans[0] = counter[0]
deq = deque()
deq.append(0)
while deq:
v = deq.popleft()
for nv in edge[v]:
... | from collections import deque
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
def bfs():
visited[0] = True
ans[0] = counter[0]
deq = deque()
deq.append(0)
while deq:
v = deq.popleft()
f... | p02936 |
import sys
input = sys.stdin.readline
N, Q = [int(x) for x in input().split()]
edge = [[] for _ in range(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)
cost = [0] * N
for _ in range(Q):
p, x = [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)]
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)
cost = [0] * N
for _ in range(Q):
p, x = [int(x) for x in input... | p02936 |
N, Q = list(map(int, input().split()))
order_dict = {}
reversed_dict = {}
Q_dict = {}
have_relationlist = {}
ans = []
for i in range(N):
if i != 0:
a, b = list(map(int, input().split()))
if not a in order_dict:
order_dict[a] = set()
if not b in reversed_dict:
... | N, Q = list(map(int, input().split()))
order_dict = {}
ans = [0]*N
for i in range(N):
if i != 0:
a, b = list(map(int, input().split()))
if not a in order_dict:
order_dict[a] = set()
order_dict[a].add(b)
for i in range(Q):
p, x = list(map(int, input().split... | 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
readline = sys.stdin.readline
readlines = sys.stdin.readlines
# 遅延評価で加えてあげるだけ
N,Q = list(map(int,readline().split()))
lines = readlines()
AB = (tuple(int(x) for x in line.split()) for line in lines[:N-1])
PX = (tuple(int(x) for x in line.split()) for line in lines[-Q:])
graph = [[] for _ in ran... | p02936 |
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
# 遅延評価で加えてあげるだけ
N,Q = list(map(int,readline().split()))
AB = (tuple(int(x) for x in readline().split()) for _ in range(N-1))
PX = (tuple(int(x) for x in readline().split()) for _ in range(Q))
graph = [[] for _ in range(N+1)]
for a,b ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,Q = list(map(int,readline().split()))
ABPX = list(map(int,read().split()))
AB = iter(ABPX[:N+N-2])
PX = iter(ABPX[N+N-2:])
graph = [[] for _ in range(N+1)]
for a,b in zip(AB,AB):
graph... | p02936 |
def main():
N, Q = list(map(int, input().split()))
graph = dict()
for i in range(N-1):
a, b = list(map(int, input().split()))
if a not in graph: graph[a] = [b]
else: graph[a].append(b)
# if b not in graph: graph[b] = [a]
# else: graph[b].append(a)
ops... | def main():
N, Q = list(map(int, input().split()))
graph = dict()
for i in range(N-1):
a, b = list(map(int, input().split()))
if a not in graph: graph[a] = [b]
else: graph[a].append(b)
# if b not in graph: graph[b] = [a]
# else: graph[b].append(a)
ops... | p02936 |
import sys
import heapq
import bisect
mod = 10**9+7
dd = ((-1,0),(1,0),(0,-1),(0,1))
def I(): return(int(sys.stdin.readline()))
def LI(): return([int(x) for x in sys.stdin.readline().split()])
def S(): return(sys.stdin.readline()[:-1])
def IR(n): return([I() for _ in range(n)])
def GCD(a,b):
while b... | import sys
import heapq
import bisect
mod = 10**9+7
dd = ((-1,0),(1,0),(0,-1),(0,1))
def I(): return(int(sys.stdin.readline()))
def LI(): return([int(x) for x in sys.stdin.readline().split()])
def S(): return(sys.stdin.readline()[:-1])
def IR(n): return([I() for _ in range(n)])
def GCD(a,b):
while b... | p02936 |
import sys
import heapq
import bisect
mod = 10**9+7
dd = ((-1,0),(1,0),(0,-1),(0,1))
def I(): return(int(sys.stdin.readline()))
def LI(): return([int(x) for x in sys.stdin.readline().split()])
def S(): return(sys.stdin.readline()[:-1])
def IR(n): return([I() for _ in range(n)])
def GCD(a,b):
while b... | import sys
def I(): return(int(sys.stdin.readline()))
def LI(): return([int(x) for x in sys.stdin.readline().split()])
def main():
N,Q = LI()
node=[[] for _ in range(N)]
flag = [True for _ in range(N)]
for _ in range(N-1):
a,b = LI()
node[a-1].append(b-1)
node[b-1].... | p02936 |
import sys
sys.setrecursionlimit(200005)
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, q = na()
g = [[] for _ in range(n)]
for i in range(n-1):
a, b = na()
a -= 1
b -= 1
... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, q = na()
g = [[] for _ in range(n)]
for i in range(n-1):
a, b = na()
a -= 1
b -= 1
g[a].append(b)
g[b].appen... | p02936 |
from collections import defaultdict, deque
N, Q = list(map(int, input().split()))
connect_dic = defaultdict(list)
for _ in range(N - 1):
a, b = list(map(int, input().split()))
connect_dic[a].append(b)
connect_dic[b].append(a)
query_weight = defaultdict(int)
for _ in range(Q):
q, x = lis... | from collections import deque
N, Q = list(map(int, input().split()))
connect_lst = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
connect_lst[a].append(b)
connect_lst[b].append(a)
query_weight = [0] * (N + 1)
for _ in range(Q):
q, x = list(map(i... | p02936 |
from collections import defaultdict
import sys
sys.setrecursionlimit(300000)
N, Q = list(map(int, input().split()))
tree = defaultdict(list)
counter = [0] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
tree[a-1].append(b-1)
tree[b-1].append(a-1)
for j in range(Q):
p, x ... | from collections import defaultdict, deque
N, Q = list(map(int, input().split()))
tree = defaultdict(list)
counter = [0] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
tree[a-1].append(b-1)
tree[b-1].append(a-1)
for j in range(Q):
p, x = list(map(int, input().split()))
... | p02936 |
import queue
import sys
sys.setrecursionlimit(5*10**5)
N, Q = list(map(int, input().split()))
ab=[]
for _ in range(N-1):
ab.append(tuple(map(int, input().split())))
px=[]
for _ in range(Q):
px.append(tuple(map(int, input().split())))
cnt=[0]*(N+1)
for el in px:
cnt[el[0]]+=el[1]
#print(cnt)... | import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
ab=[]
for _ in range(N-1):
ab.append(tuple(map(int, input().split())))
px=[]
for _ in range(Q):
px.append(tuple(map(int, input().split())))
cnt=[0]*(N+1)
for el in px:
cnt[el[0]] += el... | p02936 |
import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
ab=[]
for _ in range(N-1):
ab.append(tuple(map(int, input().split())))
px=[]
for _ in range(Q):
px.append(tuple(map(int, input().split())))
cnt=[0]*(N+1)
for el in px:
cnt[el[0]] += el... | import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
ab=[]
for _ in range(N-1):
ab.append(tuple(map(int, input().split())))
px=[]
for _ in range(Q):
px.append(tuple(map(int, input().split())))
cnt=[0]*(N+1)
for el in px:
cnt[el[0]] += ... | p02936 |
import collections
n, q = list(map(int, input().split()))
edge = [tuple(map(int, input().split())) for _ in range(n - 1)]
counter = [0] * n
for _ in range(q):
p, x = list(map(int, input().split()))
counter[p - 1] += x
tree = [[] for _ in range(n)]
edge = collections.deque(edge)
flag = [False] * n
... | import collections
n, q = list(map(int, input().split()))
edge = [tuple(map(int, input().split())) for _ in range(n - 1)]
counter = [0] * n
for _ in range(q):
p, x = list(map(int, input().split()))
counter[p - 1] += x
tree = [[] for _ in range(n)]
edge = collections.deque(edge)
while len(edge) != 0... | p02936 |
import sys
sys.setrecursionlimit(10 ** 7)
def dfs(tree, count, p):
# print(p, tree[p])
for i in tree[p]:
count[i] += count[p]
dfs(tree, count, i)
def solve(tree, count):
from collections import deque
stk = deque([1])
while stk:
p = stk.pop()
for ... | from collections import defaultdict, deque
def main():
N, Q = list(map(int, input().split()))
tree = defaultdict(list)
counter = defaultdict(int)
for _ in range(N-1):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
for _ in range(Q):
... | p02936 |
import queue
n,q = list(map(int, input().split()))
d = [[] for i in range(n)]
for i in range(n-1):
a,b = list(map(int, input().split()))
d[a-1].append(b-1)
d[b-1].append(a-1)
c = [0]*n
for i in range(q):
p,x = list(map(int,input().split()))
c[p-1]+=x
ans = [0]*n
visited = [0]*n... | n,q = list(map(int, input().split()))
d = [[] for i in range(n)]
for i in range(n-1):
a,b = list(map(int, input().split()))
d[a-1].append(b-1)
d[b-1].append(a-1)
c = [0]*n
for i in range(q):
p,x = list(map(int,input().split()))
c[p-1]+=x
ans = [0]*n
visited = [0]*n
que = []
... | p02936 |
import sys
sys.setrecursionlimit(20000000)
N, Q = [int(i) for i in input().split()]
tree = {i:[] for i in range(1,N+1)}
cost_ls = {i:0 for i in range(1,N+1)}
for _ in range(N-1):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
def plus(node, _from):
#cost_ls[node] ... | import sys
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
N, Q = [int(i) for i in input().split()]
tree = {i:[] for i in range(1,N+1)}
cost_ls = {i:0 for i in range(1,N+1)}
for _ in range(N-1):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
def plus(node, ... | p02936 |
n, q = list(map(int, input().split()))
tl = [list() for _ in range(n)]
ab = []
ans = [0] * n
for i in range(n-1):
a, b = list(map(int, input().split()))
ab.append((a, b))
ab.sort(reverse=True)
for a, b in ab:
a -= 1
b -= 1
tl[a].append(b)
tl[a].extend(tl[b])
for i in range(q... | n, q = list(map(int, input().split()))
tl = [list() for _ in range(n)]
ab = [None] * (n-1)
ans = [0] * n
for i in range(n-1):
ab[i] = tuple(map(int, input().split()))
ab.sort(reverse=True)
for a, b in ab:
a -= 1
b -= 1
tl[a].append(b)
tl[a].extend(tl[b])
for _ in range(q):
p... | p02936 |
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
from collections import deque
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, Q = list(map(int, readline().split()))
path = [[] for _ in range(N)]
for _ in range(N-1):
a, b = lis... | import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
from collections import deque
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, Q = list(map(int, readline().split()))
AB = list(list(map(int, readline().split())) for _ in range(N-1))
PX = l... | p02936 |
import sys
sys.setrecursionlimit(10**7)
def cur(x):
for i in neighbor[x]:
ans[i]+=ans[x]
neighbor[i].remove(x)
cur(i)
n,q=list(map(int,input().split()))
neighbor=[[] for _ in range(n+1)]
ans=[0]*(n+1)
for _ in range(n-1):
a,b=list(map(int,input().split()))
neighbor[a... | n,q=list(map(int,input().split()))
neighbor=[[] for _ in range(n+1)]
ans=[0]*(n+1)
for _ in range(n-1):
a,b=list(map(int,input().split()))
neighbor[a].append(b)
neighbor[b].append(a)
for _ in range(q):
p,x=list(map(int,input().split()))
ans[p]+=x
visit=[True]*(n+1)
tmp=[1]
for x... | p02936 |
import sys
sys.setrecursionlimit(10000000)
N,Q=list(map(int, input().split()))
tree_dist={}
for i in range(N):
tree_dist[i+1] = []
for i in range(N-1):
a,b = list(map(int, input().split()))
tree_dist[a].append(b)
tree_dist[b].append(a)
z=[0]*N
for i in range(Q):
p,x = list(map(int,... | import sys
sys.setrecursionlimit(10000000)
input=lambda :sys.stdin.readline()
N,Q=list(map(int, input().split()))
tree_dist={}
for i in range(N):
tree_dist[i+1] = []
for i in range(N-1):
a,b = list(map(int, input().split()))
tree_dist[a].append(b)
tree_dist[b].append(a)
z=[0]*N
for i i... | p02936 |
from collections import deque
N,Q = list(map(int, input().split()))
g = [[] for i in range(N)]
q,s,c = [0]*N,[False]*N,[0]*N
d = deque()
for _ in range(N-1):
a,b = list(map(int, input().split()))
a,b = a-1,b-1
g[a].append(b)
g[b].append(a)
for _ in range(Q):
p,x = list(map(int, input().split()))
... | from collections import deque
N,Q = list(map(int, input().split()))
g,q,s,c,d = [[] for i in range(N)],[0]*N,[False]*N,[0]*N,deque()
for _ in range(N-1):
a,b = [int(x)-1 for x in input().split()]
g[a].append(b)
g[b].append(a)
for _ in range(Q):
p,x = list(map(int, input().split()))
q[p-1] += x
d.... | p02936 |
from sys import setrecursionlimit
setrecursionlimit(10**6)
N, Q = list(map(int, input().split()))
def update(v, p):
for next in tree[v]:
if next == p:
continue
counter[next] += counter[v]
update(next, v)
tree = [[] for _ in range(N)]
counter = [0] * N
for _ in ... | from sys import setrecursionlimit
from sys import stdin
input = stdin.readline
setrecursionlimit(10**7)
N, Q = list(map(int, input().split()))
def update(v, p):
for next in tree[v]:
if next == p:
continue
counter[next] += counter[v]
update(next, v)
tree = [[] for... | 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)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
value = [0] * (N+1)
for p,x in PX:
value[p] += x
... | 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 |
n, q = list(map(int, input().split()))
# 各ノードのリンクを記録
link_dict = dict()
keys = []
for i in range(n-1):
a,b = list(map(int, input().split()))
if a in keys:
link_dict[str(a-1)].add(b)
else:
keys.append(a)
link_dict[str(a-1)] = {b}
# 各ノードの部分木の全てのノードをリストアップ
link_set = [set() for i in ran... | n, q = list(map(int, input().split()))
# 各ノードのリンクを記録
link_set = [set() for _ in range(n-1)]
for i in range(n-1):
a, b = list(map(int, input().split()))
link_set[a - 1].add(b)
# カウンターの計算を実施 (O(QN)の計算を避けることがポイント)
## O(Q)の計算
counters = [0] * n
for i in range(q):
p, x = list(map(int, input().split()))... | p02936 |
# 2019-11-17 10:52:21(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import a... | import sys
n, q = map(int, sys.stdin.readline().split())
g = [[] for _ in range(n+1)]
for _ in range(n-1):
a, b = map(int, sys.stdin.readline().split())
g[a].append(b)
g[b].append(a)
px = zip(*[map(int, sys.stdin.read().split())] * 2)
def main():
value = [0] * (n + 1)
for p, x in px:... | p02936 |
# 早くなるおまじない
import sys
input = sys.stdin.buffer.readline
# 再帰関数の呼び出し制限
sys.setrecursionlimit(10**6)
n,q = map(int,input().split())
dic = {}
for i in range(n-1):
aa, bb = map(int,input().split())
if aa not in dic:
dic[aa] = set()
dic[aa].add(bb)
else:
dic[aa].add(... | # 早くなるおまじない
import sys
input = sys.stdin.buffer.readline
# 再帰関数の呼び出し制限
sys.setrecursionlimit(3 * 10 ** 5)
# 深さが一つ前のやつのresの値を足す
# dfsはおk，ここで累積和を使う発想が出てこなかった
# def dfs(node, prev):
# visited.add(node)
# if prev != 0:
# res[node-1] += res[prev-1]
# for i in dic[node]:
# if i not... | p02936 |
N,Q = map(int,input().split())
Edge = [[] for _ in range(N+1)]
for _ in range(N-1):
a,b, = map(int,input().split())
Edge[a].append(b)
Edge[b].append(a)
PX = [list(map(int,input().split())) for _ in range(Q)]
visited = [True for _ in range(N+1)]
visited[1] = False
stack = [1]
Ans = [0]*(N+1)
... | N, Q = map(int,input().split())
E = [[] for _ in range(N+1)]
for _ in range(N-1):
a,b = map(int,input().split())
E[a].append(b)
E[b].append(a)
PX = [list(map(int,input().split())) for _ in range(Q)]
def main():
V = [0]*(N+1)
for p,x in PX:
V[p] += x
stack = [1]
gone = [... | p02936 |
import collections
def solve(N, Q, ABs, PXs):
# print(N, ",", Q, ",", ABs, ",", PXs)
vertexes = {}
values = {i: 0 for i in range(N + 1)}
for a, b in ABs:
vertexes.setdefault(a, []).append(b)
vertexes.setdefault(b, []).append(a)
for p, x in PXs:
values[p] += x
... |
def solve(N, Q, ABs, PXs):
values = {i: 0 for i in range(N + 1)}
ans = [-1 for i in range(N + 1)]
vertexes = {}
for a, b in ABs:
vertexes.setdefault(a, []).append(b)
vertexes.setdefault(b, []).append(a)
for p, x in PXs:
values[p] += x
queue = []
queue.... | p02936 |
def solve(N, Q, ABs, PXs):
values = {i: 0 for i in range(N + 1)}
ans = [-1 for i in range(N + 1)]
vertexes = {}
for a, b in ABs:
vertexes.setdefault(a, []).append(b)
vertexes.setdefault(b, []).append(a)
for p, x in PXs:
values[p] += x
queue = []
queue.... |
def solve(N, Q, ABs, PXs):
values = {i: 0 for i in range(N + 1)}
ans = [-1 for i in range(N + 1)]
vertexes = {}
for a, b in ABs:
vertexes.setdefault(a, []).append(b)
vertexes.setdefault(b, []).append(a)
for p, x in PXs:
values[p] += x
queue = []
queue.... | p02936 |
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def solve():
N, Q = list(map(int, input().split()))
adjL = [[] for _ in range(N)]
for _ in range(N-1):
A, B = list(map(int, input().split()))
A, B = A-1, B-1
adjL[A].append(B)
adjL[B].append(A)
... | def solve():
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
adjL = [[] for _ in range(N)]
for _ in range(N-1):
A, B = list(map(int, input().split()))
A, B = A-1, B-1
adjL[A].append(B)
adjL[B].a... | p02936 |
# https://atcoder.jp/contests/abc138/tasks/abc138_d
from collections import deque
def bfs(graph, start, query, n):
queue = deque([])
acc = query[start] if start in query else 0
queue.append([start, acc])
ans = [-1] * n
ans[start] = acc
while queue:
idx, acc = queue.popleft... | # https://atcoder.jp/contests/abc138/tasks/abc138_d
from collections import deque
def dfs(graph, start, ans, n):
queue = deque([])
queue.append(start)
visited = [False] * n
visited[start] = True
while queue:
parent = queue.popleft()
for child in list(graph[parent].keys... | p02936 |
# Input N, Q
N, Q = [int(c) for c in input().split()]
# Input edges
edges = [[] for i in range(N)]
for i in range(N-1):
u, v = [int(c)-1 for c in input().split()]
edges[u].append(v)
edges[v].append(u)
# Form tree
parent = [None for i in range(N)]
childs = [[] for i in range(N)]
def dfs(root):... | def main():
# Input N, Q
N, Q = [int(c) for c in input().split()]
# Input edges
edges = [[] for i in range(N)]
for i in range(N-1):
u, v = [int(c)-1 for c in input().split()]
edges[u].append(v)
edges[v].append(u)
# Form tree
parent = [None for i in ran... | p02936 |
#/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
N, Q = map(int, input().split())
adj = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a, b = (a - 1, b - 1)
adj[a].append(b)
adj[b].append(a)
values = [0 for _ in range(N)]
for _ in... | #/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.readline()
N, Q = list(map(int, input().split()))
adj = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a, b = (a - 1, b - 1)
adj[a].append(b)
adj[b].ap... | p02936 |
import sys
sys.setrecursionlimit(2 *(10**5) + 1)
def main():
N, Q = list(map(int, input().split()))
d = {}
for _ in range(N-1):
a, b = list(map(int, input().split()))
if a in d:
d[a].append(b)
else:
d[a] = [b]
if b in d:
d[b].ap... | def main():
N, Q = list(map(int, input().split()))
d = {}
for _ in range(N-1):
a, b = list(map(int, input().split()))
if a in d:
d[a].append(b)
else:
d[a] = [b]
if b in d:
d[b].append(a)
else:
d[b] = [a]
... | p02936 |
n, q = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(n-1)]
P = [list(map(int,input().split())) for i in range(q)]
ANS = [0] * (n+1)
C_plus = [0] * (n+1)
for i in range(q):
C_plus[P[i][0]] += P[i][1]
oya = [0] * (n+1)
E = [[] for i in range(n+1)]
V = [0] * (n+1)
Q ... | n, q = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(n-1)]
P = [list(map(int,input().split())) for i in range(q)]
ANS = [0] * (n+1)
C_plus = [0] * (n+1)
for i in range(q):
C_plus[P[i][0]] += P[i][1]
E = [[] for i in range(n+1)]
V = [0] * (n+1)
Q = [1]
t = 0
V[1... | p02936 |
n, q = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(n-1)]
P = [list(map(int,input().split())) for i in range(q)]
ANS = [0] * (n+1)
C_plus = [0] * (n+1)
for i in range(q):
C_plus[P[i][0]] += P[i][1]
E = [[] for i in range(n+1)]
V = [0] * (n+1)
Q = [1]
t = 0
V[1... | n, q = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(n-1)]
P = [list(map(int,input().split())) for i in range(q)]
ANS = [0] * (n+1)
C_plus = [0] * (n+1)
for i in range(q):
C_plus[P[i][0]] += P[i][1]
E = [[] for i in range(n+1)]
V = [0] * (n+1)
Q = [0] * (n+2)
Q[0]... | p02936 |
from sys import setrecursionlimit
setrecursionlimit(2 * 10**5) #再帰の回数制限を増やす
def add_num(i, total, parent=-1):
"""隣接リストを取り出して深さ優先探索
自分より上層の total のカウント数と部分木の頂点としてのカウント数を足す"""
for p in adj[i]:
if p != parent:
ans_lst[p] = total + tmp[p]
if adj[p] != [parent]:
... | import sys
sys.setrecursionlimit(10**6) #再帰の回数制限を増やす
input = sys.stdin.readline
def add_num(i, total, parent=-1):
"""隣接リストを取り出して深さ優先探索
自分より上層の total のカウント数と部分木の頂点としてのカウント数を足す"""
for p in adj[i]:
if p != parent:
ans_lst[p] = total + tmp[p]
add_num(p, total + tmp... | p02936 |
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return li... | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return li... | p02936 |
import sys
sys.setrecursionlimit(10**7)
N,Q=list(map(int,input().split()))
ab=[[] for _ in range(N)]
for i in range(N-1):
a,b=list(map(int,input().split()))
ab[a-1].append(b)
ab[b-1].append(a)
P=[0 for _ in range(N)]
for i in range(Q):
p,x=list(map(int,input().split()))
P[p-1]+=x
def dfs(p,par... | import sys
sys.setrecursionlimit(10**7)
input=lambda :sys.stdin.readline()
N,Q=list(map(int,input().split()))
ab=[[] for _ in range(N)]
for i in range(N-1):
a,b=list(map(int,input().split()))
ab[a-1].append(b)
ab[b-1].append(a)
P=[0 for _ in range(N)]
for i in range(Q):
p,x=list(map(int,input().spl... | p02936 |
import sys
from collections import defaultdict
sys.setrecursionlimit(100000)
N, Q = map(int, input().split())
neighbor = defaultdict(list)
counter = [0] * N
pcounter = [None] * N
for i in range(N-1):
a, b = map(int, input().split())
neighbor[a-1].append(b-1)
neighbor[b-1].append(a-1)
for i in... | import sys
from collections import defaultdict
sys.setrecursionlimit(100000)
N, Q = map(int, input().split())
neighbor = defaultdict(list)
counter = [0] * N
pcounter = [None] * N
depth = {0: 0}
for i in range(N-1):
a, b = map(int, input().split())
a_deper, b_deeper = False, False
if a in dept... | p02936 |
n,q=list(map(int,input().split()))
lst=[[] for i in range(n)]
ans=[0]*n
for i in range(n-1):
a,b=list(map(int,input().split()))
lst[a-1].append(b-1)
lst[b-1].append(a-1)
for i in range(q):
s,t=list(map(int,input().split()))
ans[s-1]+=t
Q=[0]
flag=[True]+[False]*(n-1)
wh... | n,q=list(map(int,input().split()))
lst=[[] for i in range(n)]
ans=[0]*n
for i in range(n-1):
a,b=list(map(int,input().split()))
lst[a-1].append(b-1)
lst[b-1].append(a-1)
for i in range(q):
s,t=list(map(int,input().split()))
ans[s-1]+=t
Q=[0]
flag=[True]+[False]*(n-1)
wh... | p02936 |
import sys
sys.setrecursionlimit(10**6)
n, q = list(map(int, input().split()))
path = [[] for _ in range(n + 1)]
for i in range(n - 1):
a, b = list(map(int, input().split()))
path[a].append(b)
path[b].append(a)
plus = [0] * (n + 1)
for _ in range(q):
p, x = list(map(int, input().split()))
... | import sys
sys.setrecursionlimit(10**6)
n, q = list(map(int, sys.stdin.readline().strip().split()))
path = [[] for _ in range(n + 1)]
for i in range(n - 1):
a, b = list(map(int, input().split()))
path[a].append(b)
path[b].append(a)
plus = [0] * (n + 1)
for _ in range(q):
p, x = list(map(int,... | p02936 |
from collections import defaultdict
import queue
N, Q = list(map(int, input().split()))
adjacent = defaultdict(list)
for i in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
adjacent[a].append(b)
adjacent[b].append(a)
ans = [0] * N
for i in range(Q):
p, x = list(... | from collections import defaultdict, deque
N, Q = list(map(int, input().split()))
adjacent = defaultdict(list)
for i in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
adjacent[a].append(b)
adjacent[b].append(a)
ans = [0] * N
for i in range(Q):
p, x = list(map(int... | p02936 |
import sys
sys.setrecursionlimit(250000)
from collections import defaultdict
N, Q = list(map(int, input().split()))
nl = [[] for _ in range(N + 1)]
for a, b in [tuple(map(int, input().split())) for _ in range(N - 1)]:
nl[a].append(b)
nl[b].append(a)
val = defaultdict(int)
for p, x in [tuple(map(i... | from collections import defaultdict
N, Q = list(map(int, input().split()))
nl = [[] for _ in range(N + 1)]
for a, b in [tuple(map(int, input().split())) for _ in range(N - 1)]:
nl[a].append(b)
nl[b].append(a)
nl[0].append(1)
val = defaultdict(int)
for p, x in [tuple(map(int, input().split())) for ... | p02936 |
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect
sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
N,... | import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect
sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
N,... | p02936 |
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect
sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
N,... | import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect
sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
N,... | p02936 |
N,Q=list(map(int,input().split()))
ans=[0]*N
ki=[[] for _ in range(N)]
for i in range(N-1):
a,b=list(map(int,input().split()))
ki[a-1].append(b-1)
ki[b-1].append(a-1)
for i in range(Q):
p,q=list(map(int,input().split()))
ans[p-1]+=q
# dfs
stack = [0]
visited = ["False"] * N
while stack:
ne = stack.p... | import sys
input = sys.stdin.readline
N,Q=list(map(int,input().split()))
ans=[0]*N
ki=[[] for _ in range(N)]
for i in range(N-1):
a,b=list(map(int,input().split()))
ki[a-1].append(b-1)
ki[b-1].append(a-1)
for i in range(Q):
p,q=list(map(int,input().split()))
ans[p-1]+=q
# dfs
stack = [0]
visited = ["... | p02936 |
#!/usr/bin/env python
from collections import deque
def main():
n, q = list(map(int, input().split()))
link = [[] for _ in range(n+1)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
link[a].append(b)
link[b].append(a)
manip = [list(map(int, input().split()... | #!/usr/bin/env python
from collections import deque
def main():
n, q = list(map(int, input().split()))
link = [[] for _ in range(n+1)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
link[a].append(b)
link[b].append(a)
manip = [list(map(int, input().split()... | p02936 |
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
def s(generator, splitter, mapper):
return [ mapper(s) for s in generator().split(splitter) ]
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]... | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
def s(generator, splitter, mapper):
return [ mapper(s) for s in generator().split(splitter) ]
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]... | p02936 |
N, Q = list(map(int, input().split()))
E = [[] for _ in range(N)]
C = [0] * N
C[0] = 0
for _ in range(N - 1):
a, b = list(map(int, input().split()))
E[a - 1].append(b - 1)
E[b - 1].append(a - 1)
for _ in range(Q):
p, x = list(map(int, input().split()))
C[p - 1] += x
D = [-1] * N
D[0] = 0
Q = [0]
... | N, Q = list(map(int, input().split()))
E = [[] for _ in range(N)]
C = [0] * N
C[0] = 0
for _ in range(N - 1):
a, b = list(map(int, input().split()))
E[a - 1].append(b - 1)
E[b - 1].append(a - 1)
for _ in range(Q):
p, x = list(map(int, input().split()))
C[p - 1] += x
D = [-1] * N
D[0] = 0
Q = [0] ... | p02936 |
N,Q=list(map(int, input().split()))
node_lst=[list(map(int, input().split())) for i in range(N-1)]
ope_lst=[list(map(int, input().split())) for i in range(Q)]
cnt_lst=[0 for i in range(N)]
child_rel={}
parent_rel={}
for l in node_lst:
src, dst = l[0], l[1]
if src not in list(child_rel.keys()):
... | N,Q=list(map(int, input().split()))
node_lst=[list(map(int, input().split())) for i in range(N-1)]
ope_lst=[list(map(int, input().split())) for i in range(Q)]
cnt_lst=[0 for i in range(N)]
for ope in ope_lst:
p, x = ope[0], ope[1]
cnt_lst[p-1]+=x
node_lst=sorted(node_lst, key=lambda x:x[0])
for l in nod... | 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)]
# print(AB)
# 添字を1からにしたいのでN+1
graph = [[] for _ in range(N+1)]
# 各頂点に隣接する頂点
for _ in range(N-1):
a, b = list(map(int, input().split()))
graph[a].append... | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
N, Q = list(map(int,input().split()))
# AB = [[int(x) for x in input().split()] for _ in range(N-1)]
# print(AB)
# 添字を1からにしたいのでN+1
graph = [[] for _ in range(N+1)]
# 各頂点に隣接する頂点
for _ in range(N-1):
a, b = list(map(int, input().sp... | p02936 |
N,Q = list(map(int,input().split()))
edges = [[] for i in range(N+1)]
for i in range(N-1):
a,b = list(map(int,input().split()))
edges[a].append(b)
edges[b].append(a)
add = [0]*(N+1)
for i in range(Q):
p,x = list(map(int,input().split()))
add[p] += x
stack = [(1,0)]
ans = [0]*(N+1)
no... | def main():
N,Q = list(map(int,input().split()))
edges = [[] for i in range(N+1)]
for i in range(N-1):
a,b = list(map(int,input().split()))
edges[a].append(b)
edges[b].append(a)
add = [0]*(N+1)
for i in range(Q):
p,x = list(map(int,input().split()))
... | p02936 |
def main():
N,Q = list(map(int,input().split()))
edges = [[] for i in range(N+1)]
for i in range(N-1):
a,b = list(map(int,input().split()))
edges[a].append(b)
edges[b].append(a)
add = [0]*(N+1)
for i in range(Q):
p,x = list(map(int,input().split()))
... | import sys
def main():
input = sys.stdin.readline
N,Q = list(map(int,input().split()))
edges = [[] for i in range(N+1)]
for i in range(N-1):
a,b = list(map(int,input().split()))
edges[a].append(b)
edges[b].append(a)
add = [0]*(N+1)
for i in range(Q):
... | p02936 |
import sys
sys.setrecursionlimit(10 ** 6)
class Node(object):
def __init__(self):
self.value = 0
self.children_id = []
def set_child(self, child_id):
self.children_id.append(child_id)
def add_number(self, n):
self.value += n
for child_id in self.chil... | N, Q = map(int, input().split())
nodes = [0 for _ in range(N + 1)]
branches = []
for j in range(N - 1):
parent, child = map(int, input().split())
branches.append([parent, child])
for _ in range(Q):
parent, number = map(int, input().split())
nodes[parent] += number
branches.sort()
for... | p02936 |
import sys
sys.setrecursionlimit(1000000)
n,q=list(map(int,input().split()))
ki=[[] for i in range(n+1)]
ki[0]="null"
for i in range(n-1):
a,b=list(map(int,input().split()))
ki[a].append(b)
ki[b].append(a)
scores=[0 for i in range(n+1)]
scores[0]="null"
for i in range(q):
p,x=list(... | n,q=list(map(int,input().split()))
L=[[] for i in range(n+1)]
S=[0 for i in range(n+1)]
V=[0 for i in range(n+1)]
for _ in range(n-1):
a,b=list(map(int,input().split()))
L[a].append(b)
L[b].append(a)
for _ in range(q):
p,x=list(map(int,input().split()))
S[p]+=x
que=[1]
head=0
... | p02936 |
import sys
sys.setrecursionlimit(500000)
N, Q = list(map(int, input().split()))
E = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
E[a].append(b)
E[b].append(a)
C = [0] * (N+1)
for _ in range(Q):
p, x = list(map(int, input().split()))
C[p] += x
A... | import sys
input = sys.stdin.readline
import sys
sys.setrecursionlimit(500000)
N, Q = list(map(int, input().split()))
E = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
E[a].append(b)
E[b].append(a)
C = [0] * (N+1)
for _ in range(Q):
p, x = list(map(in... | p02936 |
n,q=list(map(int,input().split()))
a=[0]*(n-1)
b=[0]*(n-1)
for i in range(n-1):
a[i],b[i]=list(map(int,input().split()))
p=[0]*q
x=[0]*q
for k in range(q):
p[k],x[k]=list(map(int,input().split()))
t=[[i] for i in range(1,n+1)]
for i in range(n-1):
if a[i] not in t[a[i]-1]:
t[a[i]-1].appe... | import sys
input = sys.stdin.readline
n,q=list(map(int,input().split()))
a=[[0,0] for _ in range(n-1)]
for i in range(n-1):
a[i][0],a[i][1]=list(map(int,input().split()))
a.sort()
p=[[0,0] for _ in range(q)]
for k in range(q):
p[k][0],p[k][1]=list(map(int,input().split()))
p.sort()
t=[[i] for i in ra... | p02936 |
import collections
N,Q=map(int,input().split())
lc=[[] for i in range(N)]#二重リストで木を表現
for i in range(N-1):
a,b=map(int,input().split())
lc[a-1].append(b-1)
lc[b-1].append(a-1)
lv=[0 for i in range(N)]#値のリスト
for i in range(Q):
p,x=map(int,input().split())
lv[p-1]+=x
lf=[0 for i in range(N)]... | import collections
N,Q=map(int,input().split())
lc=[[] for i in range(N)]#二重リストで木を表現
for i in range(N-1):
a,b=map(int,input().split())
lc[a-1].append(b-1)
lc[b-1].append(a-1)
lv=[0 for i in range(N)]#値のリスト
for i in range(Q):
p,x=map(int,input().split())
lv[p-1]+=x
lf=[0 for i in range(N)]... | p02936 |
N,Q=list(map(int,input().split()))
ans=[0]*N
ab=[[] for i in range(N)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
ab[a-1].append(b-1)
for j,item in enumerate(ab[::-1]):
for i in item:
ab[N-j-1].extend(ab[i])
#for i in range(N):
# ab[i]=list(set(ab[i]))
fo... |
N,Q=list(map(int,input().split()))
ans=[0]*N
ab=[[] for i in range(N)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
ab[a-1].append(b-1)
px=[]
for _ in range(Q):
px.append(list(map(int,input().split())))
for j,item in enumerate(ab[::-1]):
for i in item:
a... | p02936 |
#!/usr/bin/env python
# coding: utf-8
# In[17]:
#from sys import stdin
#input = stdin.readline
N, Q = list(map(int, input().split()))
# In[18]:
class Node:
def __init__(self, nb, data): #コンストラクタ
self.nb = nb
self.data = data #ノードがもつ数値
self.parent = -1 # nodeがrootのと... | #!/usr/bin/env python
# coding: utf-8
# In[17]:
from sys import stdin
input = stdin.readline
N, Q = list(map(int, input().split()))
# In[18]:
class Node:
def __init__(self, nb, data): #コンストラクタ
self.nb = nb
self.data = data #ノードがもつ数値
self.parent = -1 # nodeがrootのとき-... | p02936 |
import sys
import queue
#+++++
def main():
n,q = list(map(int, input().split()))
tree=[[] for _ in range(n+1)]
hh=[ 0 for _ in range(n+1)]
ret=[0 for _ in range(n+1)]
for i in range(n-1):
pa,ch = list(map(int, input().split()))
tree[pa].append(ch)
for v in range(q):
nd, hv = list(map(... | import sys
import queue
#+++++
def main():
n,q = list(map(int, input().split()))
tree=[[] for _ in range(n+1)]
hh=[0 for _ in range(n+1)]
ret=[0 for _ in range(n+1)]
for i in range(n-1):
pa,ch = list(map(int, input().split()))
tree[pa].append(ch)
for v in range(q):
nd, hv = list(map(i... | p02936 |
a,b=map(int,input().split())
y=[]
for i in range(a-1):
v=list(map(int,input().split()))
y.append(v)
y.sort(key=lambda net:net[0])
ans=[0]*a
for j in range(b):
c,d=map(int,input().split())
ans[c-1]=ans[c-1]+d
for k in range(a-1):
yy=y[k][0]-1
zz=y[k][1]-1
ans[zz]=ans[zz]+ans[yy... | a,b=map(int,input().split())
y=[]
for i in range(a-1):
v=list(map(int,input().split()))
y.append(v)
y.sort(key=lambda n:n[0])
ans=[0]*a
for j in range(b):
c,d=map(int,input().split())
ans[c-1]=ans[c-1]+d
for k in range(a-1):
ans[y[k][1]-1]=ans[y[k][1]-1]+ans[y[k][0]-1]
print(*ans,sep=" "... | p02936 |
N, Q = map(int, input().split())
to = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
queue = [0]
branch = [[i] for i in range(N)]
parent = [[] for _ in range(N)]
while len(queue) > 0:
q = queue.pop(0)
for br in ... | N, Q = map(int, input().split())
to = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
queue = [0]
parent = [[] for _ in range(N)]
while len(queue) > 0:
q = queue.pop(0)
for br in to[q]:
to[br].remove(q)
... | p02936 |
from collections import deque
n, q = list(map(int, input().split()))
edge = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
edge[a].append(b)
edge[b].append(a)
imos = [0] * n
for i in range(q):
p, x = list(map(int, input().split()))
... | import sys
from collections import deque
input = sys.stdin.readline
n, q = list(map(int, input().split()))
edge = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
edge[a].append(b)
edge[b].append(a)
imos = [0] * n
for i in range(q):
p... | p02936 |
from collections import deque
def main():
n,q=map(int,input().split())
node=[[]*n for i in range(n)]
for i in range(n-1):
a,b=map(lambda x:int(x)-1,input().split())
node[b].append(a)
node[a].append(b)
ans=[0]*n
for i in range(q):
p,x=map(int,input().split())
p-=1
an... | import sys
sys.setrecursionlimit(2*10**5+5)
def dfs(_v, _u):
for u in v[_v]:
if u==_u: continue;
ans[u]+=ans[_v]
dfs(u, _v)
def main():
for i in range(n-1):
a,b=map(lambda x:int(x)-1, input().split())
v[a].append(b)
v[b].append(a)
for i in range(q):
p... | p02936 |
import queue
N,Q = list(map(int,input().split()))
Ki_p = [0 for i in range(N+1)]
Ki_c = [[] for i in range(N+1)]
Ki_co = [0 for i in range(N+1)]
for i in range(N-1):
a,b = list(map(int,input().split()))
Ki_p[b] = a
Ki_c[a] += [b]
for i in range(Q):
p,x = list(map(int,input().split()))
... | N,Q = list(map(int,input().split()))
Ki_p = [0 for i in range(N+1)]
Ki_c = [[] for i in range(N+1)]
Ki_co = [0 for i in range(N+1)]
for i in range(N-1):
a,b = list(map(int,input().split()))
Ki_p[b] = a
Ki_c[a] += [b]
for i in range(Q):
p,x = list(map(int,input().split()))
Ki_co[p] +=... | p02936 |
import sys
sys.setrecursionlimit(5 * 10**5)
N, Q = list(map(int, input().split()))
M = [[0] * N for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
M[a-1][b-1] = M[b-1][a-1] = 1
X = [0] * N
for _ in range(Q):
p, x = list(map(int, input().split()))
X[p-1] += x
... | 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)
X = [0] * N
for _ in range(Q):
p, x = list(map(int, input().split()))
X[p-1... | p02936 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.