input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
from collections import defaultdict
import heapq
import sys
def dijkstra(startvertex,V,graph):
distances=[sys.maxsize]*V
distances[startvertex]=0
heap=[(0,startvertex)]
while heap:
current_distance,current_vertex=heapq.heappop(heap)
if current_dist... | N=int(eval(input()))
import sys
sys.setrecursionlimit(10**6)
T=[[] for _ in range(N)]
for i in range(N-1):
a,b,c=list(map(int, input().split()))
T[a-1].append((b-1,c))
T[b-1].append((a-1,c))
Q,K=list(map(int, input().split()))
D=[-1]*N
D[K-1]=0
def dfs(start, nowd):
to=T[start]
for t ... | p03634 |
import sys
from collections import deque
def dfs(start, dest, pre, d):
if d[start][dest] > 0:
return d[start][dest]
for i in range(len(d)):
if d[start][i] > 0 and i != pre:
c = dfs(i, dest, start, d)
if c > 0:
return d[start][i] + dfs(i, dest,... | import sys
from collections import deque
def main():
input = sys.stdin.readline
N = int(eval(input()))
d = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
d[a].append((b, c))
d[b].append... | p03634 |
# -*- coding: utf-8 -*-
#幅優先探索
import sys
N=eval(input())
a=[[] for i in range(N+1)]
#隣接リスト
for i in range(N-1):
x,y,z=list(map(int,input().split()))
a[x].append((y,z))
a[y].append((x,z))
#print a
Q,K=list(map(int,input().split()))
b=[]
for i in range(Q):
b.append(list(map(int, input().spl... | # -*- coding: utf-8 -*-
#深さ優先探索 再帰
#
import sys
sys.setrecursionlimit(200000)
N=eval(input())
a=[[] for i in range(N+1)]
#隣接リスト
for i in range(N-1):
x,y,z=list(map(int,input().split()))
a[x].append((y,z))
a[y].append((x,z))
#print a
Q,K=list(map(int,input().split()))
b=[]
for i in r... | p03634 |
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... | p03634 |
import sys
stdin = sys.stdin
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readl... | p03634 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readl... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03634 |
from heapq import heappush, heappop
class Dijkstra:
def __init__(self, route_map, start_point, goal_point=None):
self.route_map = route_map
self.start_point = start_point
self.goal_point = goal_point
def execute(self):
num_of_vertex = len(self.route_map)
dis... | import sys
sys.setrecursionlimit(10 ** 8)
class Solve():
def __init__(self):
self.N = int(eval(input()))
self.route = [dict() for _ in range(self.N)]
for _ in range(self.N - 1):
a, b, c = list(map(int, input().split()))
self.route[a - 1][b - 1] = c
... | p03634 |
def BFS(K, edges, N):
roots = [[] for i in range(N)]
for a, b, c in edges:
roots[a - 1] += [(b - 1, c)]
roots[b - 1] += [(a - 1, c)]
dist = [-1] * N
stack = []
stack.append(K)
dist[K] = 0
while stack:
label = stack.pop(-1)
for i, c in roots[label]:
... | def getDis(k, abc, n):
r = [[] for i in range(n)]
for a, b, c in abc:
r[a-1] += [(b-1, c)]
r[b-1] += [(a-1, c)]
dis = [-1] * n
stack = [k]
dis[k] = 0
while stack:
label = stack.pop(-1)
for i, c in r[label]:
if dis[i] == -1:
... | p03634 |
N = int(eval(input()))
treedic = {}
for i in range(1, N+1):
treedic[i] = {}
for i in range(N-1):
a, b, c = list(map(int, input().split()))
treedic[a][b] = c
treedic[b][a] = c
Q, K = list(map(int, input().split()))
checked = set([K])
length = [0]*(N+1)
check = set([K])
while len(checked) ... | def main():
N = int(eval(input()))
treedic = {}
for i in range(1, N+1):
treedic[i] = {}
for i in range(N-1):
a, b, c = list(map(int, input().split()))
treedic[a][b] = c
treedic[b][a] = c
Q, K = list(map(int, input().split()))
checked = set([K])
le... | p03634 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.rea... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
from decimal import Decimal
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin... | p03634 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = [list(map(int,input().split())) for _ in range(N-1)]
Q,K = list(map(int,input().split()))
Y = [list(map(int,input().split())) for _ in range(Q)]
tree = [[] for _ in range(N)]
dif = [10**15 for _ in range(N)]... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = [list(map(int,input().split())) for _ in range(N-1)]
Q,K = list(map(int,input().split()))
Y = [list(map(int,input().split())) for _ in range(Q)]
tree = [[] for _ in range(N)]
dif = [10**15 for _ in range(N)]... | p03634 |
def BFS(K,path,N):
"""リストのリスト道順path,頂点の個数Nが与えられたとき, 頂点Kから各頂点までの距離をlistで返す"""
from collections import deque
dist=[-1]*N
dist[K]=0
que=deque()
que.append(K)
while que:
label=que.popleft()
for i,c in path[label]:
if dist[i]==-1:
dist[i]=dist[label]+c
que+=[i]
retu... | from sys import stdin
input = stdin.readline
def BFS(K,path,N):
"""リストのリスト道順path,頂点の個数Nが与えられたとき, 頂点Kから各頂点までの距離をlistで返す"""
from collections import deque
dist=[-1]*N
dist[K]=0
que=deque()
que.append(K)
while que:
label=que.popleft()
for i,c in path[label]:
if dist[i]==-1:
... | p03634 |
from sys import stdin
input = stdin.readline
def BFS(K,path,N):
"""リストのリスト道順path,頂点の個数Nが与えられたとき, 頂点Kから各頂点までの距離をlistで返す"""
from collections import deque
dist=[-1]*N
dist[K]=0
que=deque()
que.append(K)
while que:
label=que.popleft()
for i,c in path[label]:
if dist[i]==-1:
... | from sys import stdin
input = stdin.readline
def BFS(K,path,N):
"""リストのリスト道順path,頂点の個数Nが与えられたとき, 頂点Kから各頂点までの距離をlistで返す"""
from collections import deque
dist=[-1]*N
dist[K]=0
que=deque()
que.append(K)
while que:
label=que.popleft()
for i,c in path[label]:
if dist[i]==-1:
... | p03634 |
from sys import stdin
input = stdin.readline
def BFS(K,path,N):
"""リストのリスト道順path,頂点の個数Nが与えられたとき, 頂点Kから各頂点までの距離をlistで返す"""
import queue
dist=[-1]*N
dist[K]=0
que=queue.Queue()
que.put(K)
while que.qsize():
label=que.get()
for i,c in path[label]:
if dist[i]==-1:
dist[i]=di... | from sys import stdin
input = stdin.readline
def BFS(K,path,N):
"""リストのリスト道順path,頂点の個数Nが与えられたとき, 頂点Kから各頂点までの距離をlistで返す"""
from collections import deque
dist=[-1]*N
dist[K]=0
que=[]
que.append(K)
while que:
label=que.pop(-1)
for i,c in path[label]:
if dist[i]==-1:
dist[i]... | p03634 |
from collections import deque
n=int(eval(input()))
con=[[] for _ in range(n)]
dist=[[None]*n for _ in range(n)]
dist_f_k=[0]*n
for _ in range(n-1):
a,b,c=list(map(int,input().split()))
con[a-1].append(b-1)
con[b-1].append(a-1)
dist[a-1][b-1]=dist[b-1][a-1]=c
q,k=list(map(int,input().split()))
dist_f_... | from collections import deque
n=int(eval(input()))
con=[[] for _ in range(n)]
dist_f_k=[0]*n
for _ in range(n-1):
a,b,c=list(map(int,input().split()))
con[a-1].append((b-1,c))
con[b-1].append((a-1,c))
q,k=list(map(int,input().split()))
que=deque([k-1])
while que:
cur=que.popleft()
for nxt,dd in con... | p03634 |
from collections import deque
n=int(eval(input()))
con=[[] for _ in range(n)]
dist_f_k=[0]*n
for _ in range(n-1):
a,b,c=list(map(int,input().split()))
con[a-1].append((b-1,c))
con[b-1].append((a-1,c))
q,k=list(map(int,input().split()))
que=deque([k-1])
while que:
cur=que.popleft()
for nxt,dd in con... | from collections import deque
n,*t=list(map(int,open(0).read().split()))
con=[[] for _ in range(n)]
dist_f_k=[0]*n
for a,b,c in zip(t[:3*n-3:3],t[1::3],t[2::3]):
con[a-1].append((b-1,c))
con[b-1].append((a-1,c))
k=t[3*n-2]
que=deque([k-1])
while que:
cur=que.popleft()
for nxt,dd in con[cur]:
if di... | p03634 |
from collections import deque
def main():
n=int(eval(input()))
dis=[[10**20 for i in range(n)] for i in range(n)]
g=[[] for i in range(n)]
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
dis[a-1][b-1] = c
... | from collections import deque
import sys
sys.setrecursionlimit(10**7)
n=int(eval(input()))
d=[10**20 for i in range(n)]
g=[[] for i in range(n)]
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
g[a-1].append([b-1,c])
g[b-1].append([a-1,c])
q,k = list(map(int,input().split()))
k-=1
f=... | p03634 |
import sys
def input():
return sys.stdin.readline()[:-1]
n=int(input())
def warshall_floyd(d):
for x in range(n):
for y in range(n):
for z in range(n):
d[y][z] = min(d[y][z],d[y][x]+d[x][z])
return d
graph = [[float("inf")]*n for _ in range(n)]
for i in ... | n=int(input())
def warshall_floyd(d,k):
for x in range(n):
for y in range(n):
for z in range(n):
d[y][z] = min(d[y][z],d[y][x]+d[x][z])
return d[k-1]
graph = [[float("inf") for x in range(n)] for _ in range(n)]
for i in range(n-1):
a,b,c = map(int,input().spl... | p03634 |
from collections import deque
def f(k,edge,n):
root = [[] for _ in range(n)]
for i in range(n-1):
a,b,c = edge[i][0],edge[i][1],edge[i][2]
root[a-1].append([b-1,c])
root[b-1].append([a-1,c])
que = deque()
for l in root[k]:
que.append(l)
dist = ... | from collections import deque
n = int(eval(input()))
g = [[] for _ in range(n+1)]
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
g[a].append((b,c))
g[b].append((a,c))
q,k = list(map(int,input().split()))
dis = [float('inf')]*(n+1)
dis[k] = 0
que = deque(g[k])
while que:
x,y ... | p03634 |
from collections import defaultdict
inf = float('inf')
def solve(graph, n, start_node):
costs = [inf for _ in range(n)]
costs[start_node] = 0
flgs = [False for _ in range(n)]
while not all(flgs):
prv_node = _get_min_idx(flgs,costs)
flgs[prv_node] = True
for node, dis in graph[prv_node... | from collections import deque
def dfs():
dis_from_k = [float('inf') for _ in range(N+1)]
q = deque()
used = set()
q.append([K, 0])
used.add(K)
while len(q) > 0:
prv_node, prv_cost = q.pop()
for node, cost in g[prv_node]:
if node in used:
... | p03634 |
import heapq
n = int(eval(input()))
cost = [[float('inf') for _ in range(n+1)] for _ in range(n+1)]
for _ in range(n-1):
From, To, d = list(map(int, input().split()))
cost[From][To] = d
cost[To][From] = d
q, k = list(map(int, input().split()))
dist = [float('inf') for _ in range(n+1)]
dist[k] = 0... | import heapq
def dijkstra(n, edges, s):
min_dist = [float('inf')] * n
min_dist[s] = 0
next_v = []
heapq.heappush(next_v, (0, s))
path = [-1] * n
while True:
if len(next_v) == 0: break
d, v = heapq.heappop(next_v)
for u, d in edges[v]:
... | p03634 |
import heapq
N = int(eval(input()))
tree = {i+1:[] for i in range(N)}
route = [10**20 for i in range(N+1)]
visited = [False for i in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
tree[a].append((c, b))
tree[b].append((c, a))
Q, K = list(map(int, input().split())... | import heapq
N = int(eval(input()))
graph = [[] for i in range(N+1)]
visited = [False] * (N+1)
cost = [10**20 for i in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
graph[a].append((c, b))
graph[b].append((c, a))
Q, K = list(map(int, input().split()))
q = []
... | p03634 |
N = int(eval(input()))
abc = [list(map(int, input().split())) for _ in range(N - 1)]
Q, K = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(Q)]
graph = [[] for _ in range(N)]
for i, (ai, bi, ci) in enumerate(abc):
graph[ai - 1].append((bi - 1, ci))
graph[bi - 1].a... | N = int(eval(input()))
abc = [list(map(int, input().split())) for _ in range(N - 1)]
Q, K = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(Q)]
graph = [[] for _ in range(N)]
for ai, bi, ci in abc:
graph[ai - 1].append((bi - 1, ci))
graph[bi - 1].append((ai - 1, ci)... | p03634 |
n = int(eval(input()))
a = [[int(i) for i in input().split()] for i in range(n-1)]
q,k = (int(i) for i in input().split())
question = [[int(i) for i in input().split()] for i in range(q)]
x = []
for i in range(n):
subx = []
for j in range(n):
subx.append(float("inf"))
x.append(subx)
for i in range(n): x[... | n = int(eval(input()))
a = [[int(i) for i in input().split()] for i in range(n-1)]
q,k = (int(i) for i in input().split())
question = [[int(i) for i in input().split()] for i in range(q)]
x,ans = [[] for i in range(n)],[False for i in range(n)]
for i in a:
x[i[0]-1].append([i[1],i[2]])
x[i[1]-1].append([i[0],i... | p03634 |
from collections import deque
def main():
def p(a,b):
if a < b:
return (a,b)
else:
return (b,a)
#input = open(0).readline
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0]*N
for i in range(N-1):
a, b, c = list(map(int, input().split... | from collections import deque
def main():
def p(a,b):
if a < b:
return (a,b)
else:
return (b,a)
input = open(0).readline
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0]*N
for i in range(N-1):
a, b, c = list(map(int, input().split(... | p03634 |
from collections import deque
def main():
def p(a,b):
if a < b:
return (a,b)
else:
return (b,a)
input = open(0).readline
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0]*N
for i in range(N-1):
a, b, c = list(map(int, input().split(... | from collections import deque
import sys
def main():
def p(a,b):
if a < b:
return (a,b)
else:
return (b,a)
input = sys.stdin.readline
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0]*N
for i in range(N-1):
a, b, c = list(map(int, in... | p03634 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
v = [[0]+[]*(n+1) for i in range(n+1)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
v[a].append([b,c])
v[b].append([a,c])
q,k = list(map(int,input().split()))
l = [k]
while l:
now = l.pop()
for i in v[now][1:]:... | import sys
def main():
input = sys.stdin.readline
n = int(eval(input()))
v = [[0]+[]*(n+1) for i in range(n+1)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
v[a].append([b,c])
v[b].append([a,c])
q,k = list(map(int,input().split()))
l = [k]
... | p03634 |
def dijkstra(s: int, n: int, w: int, cost: list) -> list:
d = [float("inf")]*n
used = [False]*n
d[s] = 0
while True:
v = -1
for i in range(n):
if (not used[i]) and (v == -1):
v = i
elif (not used[i]) and d[i] < d[v]:
v =... | import sys
sys.setrecursionlimit(10**6)
def dfs(v: int, p: int = -1, s: int = 0):
dist[v] = s
for i, j in t[v]:
if i == p:
continue
dfs(i, v, s + j)
n = int(eval(input()))
t = [[] for _ in range(n)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
... | p03634 |
from collections import deque
n = int(eval(input()))
nodes = [set() for i in range(n+1)]
dis = [dict() for i in range(n+1)]
ans = [-1 for i in range(n+1)]
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
nodes[a].add(b)
nodes[b].add(a)
dis[a][b] = c
dis[b][a] = c
#print... | import sys
sys.setrecursionlimit(10**8)
N = int(eval(input()))
vertex = [{} for _ in range(N)]
for i in range(N-1):
a,b,c = list(map(int,input().split()))
vertex[a-1][b-1] = c
vertex[b-1][a-1] = c
Q,K = list(map(int,input().split()))
d = [0 for i in range(N)]
def dfs(v1,v2):
d[v2]... | p03634 |
import sys
from collections import deque
readline = sys.stdin.readline
n = int(readline())
D = [[-1]*n for _ in range(n)]
for i in range(n): D[i][i]=0
G = [[] for _ in range(n)]
for i in range(n-1):
a,b,c = [int(x)-1 for x in list(map(int, readline().split()))]
G[a].append(b)
G[b].append(a)
... | import sys
sys.setrecursionlimit(pow(10,6))
readline = sys.stdin.readline
def dfs(nw, d):
V[nw] = d
for nx in G[nw]:
if V[nx[0]]==-1:
dfs(nx[0], d+nx[1])
n = int(readline())
G = [[] for _ in range(n)]
for i in range(n-1):
a,b,c = list(map(int, readline().split()))
G[a... | p03634 |
import sys
import collections
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
ts = collections.defaultdict(list)
tc = collections.defaultdict(int)
for i in range(n-1):
ta, te, ttc = list(map(int, input().rstrip('\n').split()))
... | import sys
import collections
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
tmd = collections.defaultdict(list)
tmdc = collections.defaultdict(int)
for i in range(n-1):
tma, tmb, tmc = list(map(int, input().rstrip('\n').split()))
... | p03634 |
import sys
sys.setrecursionlimit(10**7)
n = int(eval(input()))
l = [[] for _ in range(n)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
l[a-1].append([b-1, c])
l[b-1].append([a-1, c])
q, k = list(map(int, input().split()))
dist = [-1]*n
dist[k-1] = 0
def dfs(v):
for nv, c in l[v]:... | import sys
sys.setrecursionlimit(10**7)
n = int(eval(input()))
l = [[] for _ in range(n)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
l[a-1].append((b-1, c))
l[b-1].append((a-1, c))
q, k = list(map(int, input().split()))
dist = [-1]*n
dist[k-1] = 0
def dfs(v):
for nv, c in l[v]:... | p03634 |
import sys
sys.setrecursionlimit(10**9)
n = int(eval(input()))
adjacency = [[] for i in range(n+1)] #adjacency[i]は頂点iと隣接する頂点のリスト
distance = {} # distance[(i,j)](i,jは隣接した頂点)は頂点i,jを結ぶ辺の長さ
for i in range(n-1):
line = list(map(int, input().split()))
adjacency[line[0]].append(line[1])
adjacency[line[1]... | import sys
sys.setrecursionlimit(10**6)
from sys import stdin
input = stdin.readline
n = int(eval(input()))
adjacency = [[] for i in range(n+1)] #adjacency[i]は頂点iと隣接する頂点のリスト
distance = {} # distance[(i,j)](i,jは隣接した頂点)は頂点i,jを結ぶ辺の長さ
for i in range(n-1):
line = list(map(int, input().split()))
adjacency[... | p03634 |
import heapq
N = int(eval(input()))
es = [[] for i in range(N)]
for i in range(N-1):
a,b,c = list(map(int,input().split()))
a,b = a-1, b-1
es[a].append((b,c))
es[b].append((a,c))
Q,K = list(map(int, input().split()))
K -= 1
INF = float('inf')
ds = [INF for i in range(N)]
ds[K] = 0
visited... | import heapq
N = int(eval(input()))
src = [tuple(map(int,input().split())) for i in range(N-1)]
Q,K = list(map(int,input().split()))
K -= 1
qs = [tuple(map(int,input().split())) for i in range(Q)]
es = [[] for i in range(N)]
for a,b,c in src:
a,b = a-1,b-1
es[a].append((c,b))
es[b].append((c,a))... | p03634 |
import sys
from functools import lru_cache
sys.setrecursionlimit(10**6)
@lru_cache(maxsize=1000)
def dfs(v,p,d):
for i, j in tree[v]:
if i != p:
depth[i] = d + j
dfs(i,v,d+j)
N = int(eval(input()))
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = l... | import sys
sys.setrecursionlimit(10**6)
def dfs(v,p,d):
for i, j in tree[v]:
if i != p:
depth[i] = d + j
dfs(i,v,d+j)
N = int(eval(input()))
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
t... | p03634 |
import heapq
def dijkstra(graph, node, start):
dist = [float("inf") for _ in range(node)]
dist[start] = 0
q = []
heapq.heappush(q, (0, start))
while q:
cost, cur_node = heapq.heappop(q)
if dist[cur_node] < cost:
continue
for nex_cost, nex_node ... | import heapq
def dijkstra(graph, node, start):
dist = [float("inf") for _ in range(node)]
dist[start] = 0
q = []
heapq.heappush(q, (0, start))
while q:
cost, cur_node = heapq.heappop(q)
if dist[cur_node] < cost:
continue
for nex_cost, nex_node ... | p03634 |
# -*- coding: utf-8 -*-
"""
http://abc070.contest.atcoder.jp/tasks/abc070_d
"""
from enum import Enum
class Sssp(object):
""" single source shortest path """
INFINITY = 999999999999
class Status(Enum):
""" ノードの訪問状態 """
white = 1 # 未訪問
gray = 2 # 訪問中
blac... | # -*- coding: utf-8 -*-
"""
http://abc070.contest.atcoder.jp/tasks/abc070_d
"""
# TLEするので、ダイクストラのアルゴリズムからの高速化が必要。
# 隣接行列をやめて隣接リストにしたところ、だいぶ速度が改善された。しかし、今度はWAが出るようになった。
from enum import Enum
from heapq import heappush, heappop
class Sssp(object):
""" single source shortest path """
class Status(E... | p03634 |
n=int(eval(input()))
l=[[] for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
l[a-1].append([b-1,c])
l[b-1].append([a-1,c])
ans=[-1]*n
q,k=list(map(int,input().split()))
ans[k-1]=0
from collections import deque
d=deque([k-1])
while d:
now=d.pop()
for x in l[now]:
a,... | import sys
from collections import deque
input = sys.stdin.readline
n=int(eval(input()))
l=[[] for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
l[a-1].append([b-1,c])
l[b-1].append([a-1,c])
ans=[-1]*n
q,k=list(map(int,input().split()))
ans[k-1]=0
d=deque([k-1])
while d:
... | p03634 |
# -*- coding: utf-8 -*-
from collections import deque
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
G = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = inpl()
G[a].append((b, c))
G[b].append((a, c))
D = [0] * (N+1)
Q, K = inpl()
DQ = deque([K])
visited = [... | # -*- coding: utf-8 -*-
from collections import deque
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
G = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = inpl()
G[a].append((b, c))
G[b].append((a, c))
Q, K = inpl()
def BFS(G, K):
DQ = deque([K])
D ... | p03634 |
import sys
sys.setrecursionlimit(1000000)
n=int(eval(input()))
visitedlist=[-1 for i in range(n)]
kilist=[[] for i in range(n)]
anslist=[0 for i in range(n)]
searchedlist=[-1 for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
kilist[a-1].append((b,c))
kilist[... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(1000000)
n=int(eval(input()))
visitedlist=[-1 for i in range(n)]
kilist=[[] for i in range(n)]
anslist=[0 for i in range(n)]
searchedlist=[-1 for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
kilist[a-1].appe... | p03634 |
N = int(eval(input()))
M = N-1
inf = float("inf")
dp = [[inf]*N for _ in [0]*N]
for i in range(N):dp[i][i] = 0
q = [list(map(int, input().split())) for i in range(M)]
Q , K = list(map(int, input().split()))
p = [list(map(int, input().split())) for i in range(Q)]
ans = 0
for a,b,c in q:
dp[a-1][b-1] = c... | N = int(eval(input()))
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
depth = [0 for _ in range(N)]
def dfs(v, p = -1, d = 0):
... | p03634 |
import queue
N = int(eval(input()))
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
depth = [0 for _ in range(N)]
def bfs(v, p ... |
from collections import deque
N = int(eval(input()))
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
depth = [0 for _ in range(N... | p03634 |
from collections import deque
#
# N = 5
# ARR = [
# [1, 2, 1],
# [1, 3, 1],
# [2, 4, 1],
# [3, 5, 1]
# ]
#
# Q, K = 3, 1
#
# BRR = [
# [2, 4],
# [2, 3],
# [4, 5],
# ]
#
#
# N = 7
# ARR = [
# [1, 2, 1],
# [1, 3, 3],
# [1, 4, 5],
# [1, 5, 7],
# [1, ... | import sys
sys.setrecursionlimit(20000000)
# N = 5
# ARR = [
# [1, 2, 1],
# [1, 3, 1],
# [2, 4, 1],
# [3, 5, 1]
# ]
#
# Q, K = 3, 1
#
# BRR = [
# [2, 4],
# [2, 3],
# [4, 5],
# ]
#
#
N = int(eval(input()))
ARR = [list(map(int,input().split())) for i in range(N-1)]
Q... | p03634 |
import heapq
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
G[a - 1].append([c, b - 1])
G[b - 1].append([c, a - 1])
Q, K = list(map(int, input().split()))
def dijkstra(s, N, G, x, y):
d = [20 ** 9] * N
d[s] = 0
hq =... | import heapq
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
G[a - 1].append([c, b - 1])
G[b - 1].append([c, a - 1])
Q, K = list(map(int, input().split()))
def dijkstra(s, N, G):
d = [float('inf')] * N
d[s] = 0
hq = ... | p03634 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
INF = 10**5
n = int(eval(input()))
graph = [[] for _ in range(n+1)]
d = [[INF]*(n+1) for _ in range(n+1)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
d[a][b] = d[b][a] = c
graph[a].append(b)
graph[b].app... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
INF = 10**9+1
n = int(eval(input()))
graph = [[] for _ in range(n+1)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
graph[a].append((b, c))
graph[b].append((a, c))
q, k = list(map(int, input().split()))
dist =... | p03634 |
import sys
import heapq
input = sys.stdin.readline
n = int(eval(input()))
edges = [[]for _ in range(n)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
edges[a].append((c, b))
edges[b].append((c, a))
INF = float('inf')
def dijkstra(init_v):
dist = [I... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n = int(eval(input()))
edges = [[]for _ in range(n)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
edges[a].append((c, b))
edges[b].append((c, a))
INF = float('inf')
def dfs(v, parent, d... | p03634 |
import heapq
n = int(eval(input()))
g = [[] for _ in range(n)]
for i in range(n-1):
a, b, c = list(map(int, input().split()))
g[a-1].append((b-1, c))
g[b-1].append((a-1, c))
ans = []
q, k = list(map(int, input().split()))
for i in range(q):
x, y = list(map(int, input().split()))
... | import heapq
n = int(eval(input()))
g = [[] for _ in range(n)]
for i in range(n-1):
a, b, c = list(map(int, input().split()))
g[a-1].append((b-1, c))
g[b-1].append((a-1, c))
q, k = list(map(int, input().split()))
dis = [float("inf")] * n
dis[k-1] = 0
pq = [(0, k-1)]
while pq:
d, no... | p03634 |
import queue
from sys import stdin
input = stdin.readline
N = int(input())
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1; b -= 1;
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
d = [f... | #!/usr/bin/env python2
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(200000)
N = int(input())
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1; b -= 1;
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, in... | p03634 |
#!/usr/bin/env python2
# -*- coding: utf-8 -*-
import queue
N = int(input())
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1; b -= 1;
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
d = ... | #!/usr/bin/env python2
# -*- coding: utf-8 -*-
N = int(input())
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1; b -= 1;
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
depth = [0 for _ in ... | p03634 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque
def getN():
return int(eval(input()))
def getList():
return list(map(int, input().split()))
import math
n = getN()
vtxs = [[] for i in range(n)]
dist = [0 for i in range(n)]
visit = [0 for i in ran... | import sys
# from collections import defaultdict, deque
import math
# import copy
# from bisect import bisect_left, bisect_right
import heapq
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList = lambda: li... | p03634 |
import heapq
V = int(eval(input()))
E = V - 1
G = {}
for i in range(V):
G[i] = {}
for _ in range(E):
s, t, c = [int(_) for _ in input().split()]
s -= 1 # 0-indexed
t -= 1 # 0-indexed
G[s][t] = c
G[t][s] = c
Q, K = [int(_) for _ in input().split()]
K -= 1 # 0-indexed
XY = [[i... | V = int(eval(input()))
E = V - 1
G = {}
for i in range(V):
G[i] = {}
for _ in range(E):
s, t, c = [int(_) for _ in input().split()]
s -= 1 # 0-indexed
t -= 1 # 0-indexed
G[s][t] = c
G[t][s] = c
Q, K = [int(_) for _ in input().split()]
K -= 1 # 0-indexed
XY = [[int(_) for _ in i... | p03634 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | p03634 |
import sys
sys.setrecursionlimit(500000)
N = int(eval(input()))
tree = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
from functools import lru_cache
@lru_cache(max... | import sys
sys.setrecursionlimit(500000)
N = int(eval(input()))
tree = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
def dfs(start, dist, dists, f=None):
for n... | p03634 |
import sys
sys.setrecursionlimit(500000)
N = int(eval(input()))
tree = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, input().split()))
def dfs(start, dist, dists, f=None):
for n... | import sys
sys.setrecursionlimit(500000)
import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
tree = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
tree[a].append((b, c))
tree[b].append((a, c))
Q, K = list(map(int, in... | p03634 |
from collections import deque
n = int(eval(input()))
gr = { i:[] for i in range(1, n + 1)}
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
gr[a].append((b, c))
gr[b].append((a, c))
q, k = list(map(int, input().split()))
dmax = 10**14 + 1
dist = [dmax for _ in range(n + 1)]
dist[... | from collections import deque
n = int(eval(input()))
gr = { i:[] for i in range(1, n + 1)}
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
gr[a].append((b, c))
gr[b].append((a, c))
q, k = list(map(int, input().split()))
dmax = 10**14 + 1
dist = [dmax for _ in range(n + 1)]
dist[... | p03634 |
n=int(eval(input()))
G=[[] for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
G[a-1].append((b-1,c))
G[b-1].append((a-1,c))
q,k=list(map(int,input().split()))
k=k-1
stack=[k]
dis=[-1]*n
dis[k]=0
from collections import deque
stack=deque(stack)
while len(stack)>0:
... | n=int(eval(input()))
G=[[] for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
G[a-1].append((b-1,c))
G[b-1].append((a-1,c))
q,k=list(map(int,input().split()))
k=k-1
stack=[k]
dis=[-1]*n
dis[k]=0
while stack!=[]:
now=stack.pop()
d=dis[now]
for i in G[now]:
... | p03634 |
from collections import deque
N = int(input())
T = [[] for i in range(N)]
for i in range(N-1) :
u,v,c = map(int,input().split())
u -= 1
v -= 1
T[u].append([v,c])
T[v].append([u,c])
Q,K = map(int,input().split())
K -= 1
L = []
for i in range(Q) :
u,v = map(int,input().split... | import sys
sys.setrecursionlimit(10**9)
N = int(input())
T = [[] for i in range(N+1)]
for i in range(N-1) :
a,b,c = map(int,input().split())
T[a].append([b,c])
T[b].append([a,c])
Q,K = map(int,input().split())
dist = [None]*(N+1)
def dfs(now,d) :
dist[now] = d
for to,c in T[now... | p03634 |
### bfs ###
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(eval(input()))
G = [[] for _ in range(N)]
dis = [-1]*N
que = []
for _ in range(N-1):
a, b, c = list(map(int, input( ).split( )))
a -= 1
b -= 1
G[a].append([b,c])
G[b].append([a,c])
Q, K = list(map(in... | ### dfs ###
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(eval(input()))
G = [[] for _ in range(N)]
dis = [-1]*N
for _ in range(N-1):
a, b, c = list(map(int, input( ).split( )))
a -= 1
b -= 1
G[a].append([b,c])
G[b].append([a,c])
Q, K = list(map(int, input()... | p03634 |
import sys
from collections import defaultdict
from heapq import heappush, heappop
def input():
return sys.stdin.readline().strip()
def dijkstra(adj_list, start):
n = len(adj_list)
dist = [float("inf")] * n
dist[start] = 0
pq = []
heappush(pq, (0, start))
visited = set()... | import sys
from collections import deque
def input():
return sys.stdin.readline().strip()
def bfs(start):
q = deque([start])
dist = [-1] * (N + 1)
dist[start] = 0
while q:
v = q.popleft()
for nv, nw in g[v]:
if dist[nv] > 0:
continue
... | p03634 |
from collections import defaultdict
from collections import deque
n = int(eval(input()))
tree = defaultdict(list)
for i in range(n-1):
a, b, c = list(map(int, input().split()))
tree[a].append([b, c])
tree[b].append([a, c])
def distance(x, y):
seen = set()
d = 0
stack = deque([[tree[... | from collections import defaultdict
from collections import deque
n = int(eval(input()))
tree = defaultdict(list)
for i in range(n-1):
a, b, c = list(map(int, input().split()))
tree[a].append([b, c])
tree[b].append([a, c])
def distance(k):
seen = set()
dis_l = {}
d = 0
stack = ... | p03634 |
n = int(eval(input()))
cs = [[0] * (n + 1) for _ in range(n + 1)]
es = [[] for _ in range(n + 1)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
cs[a][b] = cs[b][a] = c
es[a].append(b)
es[b].append(a)
ds = [0] * (n + 1)
qs = []
def bfs():
cur, prev = qs.pop()
ds... | n = int(eval(input()))
cs = [[0] * (n + 1) for _ in range(n + 1)]
es = [[] for _ in range(n + 1)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
cs[a][b] = cs[b][a] = c
es[a].append(b)
es[b].append(a)
ds = [0] * (n + 1)
def dfs(cur, prev):
ds[cur] = ds[prev] + cs[prev... | p03634 |
n=int(eval(input()))
edges=[[] for i in range(n)]
for i in range(n-1):
a,s,d=list(map(int,input().split()))
edges[a-1].append((s-1,d));edges[s-1].append((a-1,d))
q,k=list(map(int,input().split()))
cost=[0]*n
from collections import deque
dq=deque([])
#pop/append/(append,pop)_left/in/len/count/[]/index/... | import sys
input=sys.stdin.buffer.readline
sys.setrecursionlimit(10**9)
n=int(eval(input()))
edges=[[] for i in range(n)]
for i in range(n-1):
a,s,d=list(map(int,input().split()))
edges[a-1].append((s-1,d));edges[s-1].append((a-1,d))
q,k=list(map(int,input().split()))
cost=[0]*n
from collections impor... | p03634 |
import sys
import os
from collections import defaultdict
adj = defaultdict(list)
vis =[0 for i in range(1000000)]
dis =[0 for i in range(1000000)]
def dfs(u, p):
for v, w in adj[u]:
if v==p:
continue
dis[v]=dis[u]+w
dfs(v, u)
def main():
n = int(eval(input()))
for i in range(n-1):
a, b, w... | import sys
import os
from collections import defaultdict
adj = defaultdict(list)
vis =[0 for i in range(1000000)]
dis =[0 for i in range(1000000)]
# since it's a tree shortest path will be only one and unique between two node
# find distance from k to each and every node
def dfs(u, p):
for v, w in adj[u]:
... | p03634 |
from heapq import heappop, heappush
n = int(eval(input()))
INF = 10**13
g = [[INF for __ in range(n)] for _ in range(n)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
g[a-1][b-1] = c
g[b-1][a-1] = c
def dijkstra(s, n, edges):
# edges[i][j] : the cost of i→j
# import ... | from heapq import heappop, heappush
n = int(eval(input()))
g = [[] for _ in range(n)]
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
g[a-1].append((b-1, c))
g[b-1].append((a-1, c))
def dijkstra(s, n, edges):
# edges[i][j] : the cost of i→j
# import 'heap'
d = [10*... | p03634 |
# 2019/07/11
import sys
from heapq import heappop,heappush
input=sys.stdin.readline
n=int(eval(input()))
edge=[[] for _ in range(n)]
for _ in range(n-1):
u,v,c=list(map(int,input().split()))
u-=1
v-=1
edge[u].append((c,v))
edge[v].append((c,u))
def dijkstra(s):
d=[float('i... | # 2019/07/12
# DFS ver
import sys
sys.setrecursionlimit(10**9)
input=sys.stdin.readline
n=int(eval(input()))
edge=[[] for _ in range(n)]
for _ in range(n-1):
u,v,c=list(map(int,input().split()))
u-=1 ; v-=1
edge[u].append((c,v))
edge[v].append((c,u))
q,k=list(map(int,input().split())... | p03634 |
from collections import deque
n=int(input())
e=[[] for _ in range(n+1)]
l=[[0]*(n+1) for _ in range(n+1)]
dist=[-1]*(n+1)
for i in range(n-1):
a,b,c=map(int,input().split())
e[a].append(b)
e[b].append(a)
l[a][b]=c
l[b][a]=c
q,k=map(int,input().split())
a=deque()
a.append((k,0))
while a... | from collections import deque
n=int(input())
e=[[] for _ in range(n+1)]
dist=[-1]*(n+1)
for i in range(n-1):
a,b,c=map(int,input().split())
e[a].append((b,c))
e[b].append((a,c))
q,k=map(int,input().split())
a=deque()
a.append((k,0))
while a:
x,d=a.popleft()
dist[x]=d
for j,nc in e[... | p03634 |
#%%
n = int(eval(input()))
a, b, c = [0] * n, [0] * n, [0] * n
for i in range(n-1):
a[i], b[i], c[i] = list(map(int, input().split()))
q, k = list(map(int, input().split()))
l = [[] for _ in range(n+1)]
for i in range(n-1):
l[a[i]].append([b[i],c[i]])
l[b[i]].append([a[i],c[i]])
d = [0] * (n... | #%%
n = int(eval(input()))
a, b, c = [0] * n, [0] * n, [0] * n
for i in range(n-1):
a[i], b[i], c[i] = list(map(int, input().split()))
q, k = list(map(int, input().split()))
l = [[] for _ in range(n+1)]
for i in range(n-1):
l[a[i]].append([b[i],c[i]])
l[b[i]].append([a[i],c[i]])
d = [0] * (n... | p03634 |
import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
data = [[] for i in range(n)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
a -= 1
b -= 1
data[a].append([b,c])
data[b].append([a,c])
dist = [-1 for i in range(n)]
q,k = list(map(int,input().split()))
k -= 1
... | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
n = int(eval(input()))
data = [[] for i in range(n)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
a -= 1
b -= 1
data[a].append([b,c])
data[b].append([a,c])
dist = [-1 for i in range(n)]
q,k = list(map(int... | p03634 |
import heapq
INF = float('inf')
N = int(eval(input()))
to = [[] for _ in range(N)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
a, b, = a - 1, b - 1
to[a].append((c, b))
to[b].append((c, a))
Q, K = list(map(int, input().split()))
query = [list([int(x) - 1 for x in i... | import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
to = [[] for _ in range(N)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
a, b, = a - 1, b - 1
to[a].append((c, b))
to[b].append((c, a))
Q, K = list(map(int, input().split()))
K -= 1
query = [list([int(x... | p03634 |
from heapq import heappush,heappop,heapify
INF=10**30
def dijkstra(G,s,n):
que=[(0,s)]
dist=[INF]*n
dist[s]=0
while que:
mincost,u=heappop(que)
if(mincost>dist[u]):
continue
for v,c in G[u]:
if(dist[u]+c<dist[v]):
dist[v]=dist[u... | import sys
sys.setrecursionlimit(10**6)
def dfs(v,p,d):
dist[v]=d
for nv,nd in G[v]:
if nv==p:
continue
dfs(nv,v,d+nd)
N=int(eval(input()))
G=[[] for i in range(N)]
dist=[-1]*N
for i in range(N-1):
a,b,c=list(map(int,input().split()))
G[a-1].append([b-1,c])
... | p03634 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def dfs(G, v, p, dist):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
for c, d in G[v]:
# Avoid multiple access to parent
if c == p:
continue
dist[c] = dist[v] + d
d... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def dfs(G, v, p, dist):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
for c, d in G[v]:
# Avoid multiple access to parent
if c == p:
continue
dist[c] = dist[v] + d
d... | p03634 |
# Kから各頂点への距離をメモする
# xからKの距離とyからKの距離を足したものが答え
import sys
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N)]
for i in range(N - 1):
a,b,c = list(map(int,readline().split()))
G[a-1].append((b-1,c))
G[b-1].append((a-1,c))
dist = [-1 for i in range(N)] # Kからの距離
Q,K = list(map... | import sys
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N)]
for i in range(N - 1):
a,b,c = list(map(int,readline().split()))
G[a - 1].append((b - 1, c))
G[b - 1].append((a - 1, c))
Q,K = list(map(int,readline().split()))
dist = [0] * N
stack = [(K - 1, -1, 0)]
whil... | p03634 |
from collections import Counter,defaultdict,deque
import sys
import copy
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def main():
n=int(eval(input()))
graph = [[] for _ in range(n)]
for... | from collections import Counter,defaultdict,deque
import sys
import copy
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def main():
n=int(eval(input()))
graph = [[] for _ in range(n)]
for... | p03634 |
import queue
N=int(eval(input()))
d=[-1 for _ in range(N+1)]
e=[[] for _ in range(N+1)]
for _ in range(N-1):
a,b,c=list(map(int,input().split()))
e[a].append([b, c])
e[b].append([a, c])
Q,K=list(map(int,input().split()))
d[K]=0
q=queue.Queue()
q.put(K)
while not q.empty():
now=q.get()
for nx,c in e[n... | import sys
sys.setrecursionlimit(1145141919)
N=int(eval(input()))
d=[-1 for _ in range(N+1)]
e=[[] for _ in range(N+1)]
for _ in range(N-1):
a,b,c=list(map(int,input().split()))
e[a].append((b, c))
e[b].append((a, c))
Q,K=list(map(int,input().split()))
def dfs(now, dis):
d[now] = dis
for nxt,cos in e[n... | p03634 |
from collections import deque
def main():
n = int(eval(input()))
G = [[] for _ in range(n)]
D = [[] for _ in range(n)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
D[a].append(c)
G[b].append(a)
... | from collections import deque
import sys
def input():
return sys.stdin.readline().rstrip()
def main():
n = int(eval(input()))
G = [[] for _ in range(n)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append([b, c])
... | p03634 |
N=int(eval(input()))
G=[[] for _ in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
G[a-1].append([b-1,c])
G[b-1].append([a-1,c])
Q,K=list(map(int,input().split()))
SD=[0]*N
for x,d in G[K-1]:
SD[x]=d
for i in range(N):
if i==K-1:continue
ans=[]
seen=... | N=int(eval(input()))
G=[[] for _ in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
G[a-1].append([b-1,c])
G[b-1].append([a-1,c])
Q,K=list(map(int,input().split()))
SD=[0]*N
seen=[0]*N
stack=[]
stack.append([K-1,0])
seen[K-1]=1
while stack:
x,d=stack.pop()
for y... | p03634 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n = int(input())
from collections import defaultdict
abc = [tuple(map(int,input().split())) for i in range(n-1)]
cost = [[-1]*n for i in range(n)]
for a,b,c in abc:
a,b = a-1,b-1
cost[a][b]=c
cost[b][a]=c
q, k = map(int, inp... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n = int(input())
from collections import defaultdict
abc = [tuple(map(int,input().split())) for i in range(n-1)]
es = [[] for i in range(n)]
for a,b,c in abc:
a,b = a-1,b-1
es[a].append((b,c))
es[b].append((a,c))
q, k = map(... | p03634 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
INF = 10**18
N = int(readline())
ABC = [list(map(int, readline().split())) for _ in range(N - 1)]
Q, K = list(map(int, readline().split()))
XY = [list(map(int, r... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
edges = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b, c = list(map(int, readline().split()))
edges[a].append((b, c))
e... | p03634 |
import sys
readline = sys.stdin.readline
from collections import deque
def main():
N = int(readline())
path = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = list(map(int, readline().rstrip().split()))
path[a-1].append((b-1, c))
path[b-1].append((a-1, c))
Q, K =... | import sys
readline = sys.stdin.readline
from collections import deque
def main():
N = int(readline())
path = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = list(map(int, readline().rstrip().split()))
path[a-1].append((b-1, c))
path[b-1].append((a-1, c))
Q, K =... | p03634 |
import sys
readline = sys.stdin.readline
from collections import deque
def main():
N = int(readline())
path = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = list(map(int, readline().rstrip().split()))
path[a-1].append((b-1, c))
path[b-1].append((a-1, c))
Q, K =... | import sys
readline = sys.stdin.readline
from heapq import heapify, heappush, heappop
def dijkstra(path, N, start):
"""
Args:
path (list): [[(cost, node), (cost, node), ...], [], [], ...]
"""
visited = [False] * N
que = [(0, start)]
heapify(que) # 始点aから各頂点への(距離, 頂点ID)
... | p03634 |
# ABC070 D - Transit Tree Path
import heapq
def dijkstra_heap(s):
"""
始点sから各頂点への最短距離を返す
Parameters
----------
s : int
視点とする頂点
Returns
-------
d ：list
始点sから各頂点への最短距離
"""
d = [float("inf")] * n
used = [True] * n #True:未確定
d[s] = 0
used[s... | import sys
sys.setrecursionlimit(100000000)
def dfs(cur,par,d):
dist[cur]=d
for nx,nx_dist in G[cur]:
if nx==par:continue
dfs(nx,cur,d+nx_dist)
n=int(eval(input()))
G=[[] for i in range(n)]
dist=[0]*n
for i in range(n-1):
a,b,c=list(map(int,input().split()))
G[a-1].append([... | p03634 |
n=int(eval(input()))
G=[[] for i in range(n)]
for i in range(n-1):
u,v,w=list(map(int,input().split()))
G[u-1].append([v-1,w])
G[v-1].append([u-1,w])
dist=[-1]*n
from collections import deque
Q,k=list(map(int,input().split()))
q=deque()
q.append(k-1)
dist[k-1]=0
while q:
cur=q.popleft()
for nx,n... | from heapq import heappop,heappush
def dijkstra(s,n,edge):
"""
始点sから各頂点への最短距離を返す
Parameters
----------
s : int
視点とする頂点（0-indexed）
n : int
グラフの要素数
eage:list
グラグ
Returns
-------
dist ：list
始点sから各頂点への最短距離
"""
dist=[float("inf")]*n
dist[s]=0
used=[-1]*n... | p03634 |
import sys
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
def dfs(v, parent, d):
depth[v] = d
for to, cost in tree[v]:
if to == parent:
continue
dfs(to, v, d + cost)
depth = defaultdict(int)
tree = defaultdict(list)
n = int(eval(input()))
for... | import sys
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
def input():
return sys.stdin.readline()[:-1]
def dfs(v, parent, d):
depth[v] = d
for to, cost in tree[v]:
if to == parent:
continue
dfs(to, v, d + cost)
depth = defaultdict(int)
... | p03634 |
N = int(eval(input()))
d = [0] * N
INF = float('inf')
cost = [[INF] * N for i in range(N)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
cost[a - 1][b- 1] = c
cost[b- 1][a - 1] = c
def dijkstra(s):
used = [False] * N
for i in range(N):
d[i] = INF
d[... | import heapq
N = int(eval(input()))
d = [0] * N
INF = float('inf')
class Info:
def __init__(self, to, cost):
self.to = to
self.cost = cost
G = [[] for i in range(N)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
G[a - 1].append(Info(b - 1, c))
... | p03634 |
from collections import defaultdict
import heapq
N = int(eval(input()))
INF = float('inf')
edges = [list(map(int, input().split())) for _ in range(N-1)]
nodes = defaultdict(list)
for e in edges:
nodes[e[0] - 1].append((e[2], e[1] - 1))
nodes[e[1] - 1].append((e[2], e[0] - 1))
Q, K = list(map(in... | from collections import defaultdict
import heapq
N = int(eval(input()))
INF = float('inf')
edges = [list(map(int, input().split())) for _ in range(N-1)]
nodes = defaultdict(list)
for e in edges:
nodes[e[0] - 1].append((e[2], e[1] - 1))
nodes[e[1] - 1].append((e[2], e[0] - 1))
Q, K = list(map(in... | p03634 |
from heapq import heappush, heappop
inf = float('inf')
# import: from heapq import heappush,heappop
# distの初期化: dist = [inf]*n; dist[start] = 0
def dijkstra(ad,dist,n,start):
pq = [(0,start)]
while pq:
w,v = heappop(pq)
for nw,nv in ad[v]:
if dist[nv] > dist[v] + nw:
... | from heapq import heappush, heappop
inf = float('inf')
# (始点,隣接リスト)
def dijkstra(start,ad):
global dist
dist = [inf]*len(ad)
dist[start] = 0
pq = [(start,0)]
while pq:
v = heappop(pq)[0]
for nv,nw in ad[v]:
if dist[nv] > dist[v] + nw:
dist[nv... | p03634 |
from heapq import heappop, heappush
n = int(eval(input()))
grid = [list(map(int, input().split())), list(map(int, input().split()))]
def biggest(grid, start, cost=0):
dist = [[0 for _ in range(n)] for _ in range(2)]
dx = [1, 0]
dy = [0, 1]
st = [(cost, start)]
dist[start[0]][start[1]] = ... | n = int(eval(input()))
grid = [list(map(int, input().split())), list(map(int, input().split()))]
dist = [[0 for _ in range(n)] for _ in range(2)]
dist[0][0] = grid[0][0]
for i in range(2):
for j in range(n):
if j < n - 1:
dist[i][j + 1] = max(dist[i][j + 1], dist[i][j] + grid[i][j + 1])
if i == ... | p03451 |
def third(n,q):
n = int(n)
q = float(q)
if n == 1: return q/2
else : return third(n-1,q)- (third(n-1,q)**3-q)/(3*third(n-1,q)**2)
kai = []
while(True):
try:
q = eval(input())
if q == -1:
break
else :
n = 1
q = float(q)
... | while(True):
try:
q = eval(input())
if q == -1:
break
else :
q = float(q)
x = q/2
while (abs(q-x**3) >= 0.00001*q):
x = x- (x**3-q)/(3*x**2)
print('{:.6f}'.format(x))
except EOFError:
break | p00080 |
N, M = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
R = [0] * (N+1)
ans = 0
temp = 0
for i in range(N):
R[i+1] = temp + A[i]
temp = R[i+1]
for j in range(1,N+1):
for d in range(1,N+1):
if j - d >= 0:
if (R[j] - R[j-d]) % M == 0:
... | # coding: utf-8
# Your code here!
N, M = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
R = [0] * (N+1)
S = [0] * (N+1)
S_dict = {}
ans = 0
temp = 0
for i in range(N):
R[i+1] = temp + A[i]
S[i+1] = R[i+1] % M
temp = R[i+1]
for s in S:
if s in S_dict:
... | p03287 |
from collections import Counter
N, M = [int(elem) for elem in input().split(' ')]
A_list = [int(elem) % M for elem in input().split(' ')]
assert len(A_list) == N
cuml_A_list = [0] * N
current_sum = 0
for i, A in enumerate(A_list):
current_sum += A
current_sum %= M
cuml_A_list[i] = current_sum... | import sys
from collections import Counter
finput = sys.stdin.readline
N, M = [int(elem) for elem in finput().split(' ')]
A_list = [int(elem) % M for elem in finput().split(' ')]
assert len(A_list) == N
cuml_A_list = [0] * N
current_sum = 0
for i, A in enumerate(A_list):
current_sum += A
current_s... | p03287 |
from collections import Counter
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
S = [0]
s = 0
for i in range(n):
s += A[i]
S += [s]
R = []
for i in range(n+1):
R += [S[i]%m]
R = Counter(R)
ans = 0
for r in list(R.values()):
ans += r*(r-1)//2
print(ans) | from collections import Counter
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
S = [0]
for i in range(N):
S.append((S[-1]+A[i])%M)
C = Counter(S)
ans = 0
for v in list(C.values()):
ans += v*(v-1)//2
print(ans) | p03287 |
def comb1(n, r):
if n == 0 or r == 0: return 1
return comb1(n, r-1) * (n-r+1) / r
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
# N, M = 10, 400000000
# A = [int(i) for i in '1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 ... | def comb1(n, r):
if n == 0 or r == 0: return 1
return comb1(n, r-1) * (n-r+1) / r
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
# N, M = 10, 400000000
# A = [int(i) for i in '1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 ... | p03287 |
from collections import Counter as C
from itertools import accumulate as a
def inp():return list(map(int,input().split()))
n,m = inp()
print((sum([v*(v-1)//2+(0 if k else v)for k,v in list(C([x%m for x in a(inp())]).items())]))) | from collections import Counter as C
from itertools import accumulate as a
def inp():return list(map(int,input().split()))
n,m = inp()
print((sum([v*(v-1)//2 for v in list(C([x%m for x in a([0]+inp())]).values())]))) | p03287 |
from collections import Counter as C
from itertools import accumulate as a
def inp():return list(map(int,input().split()))
n,m = inp()
print((sum([v*(v-1)//2 for v in list(C([x%m for x in a([0]+inp())]).values())]))) | from collections import Counter as C
from itertools import accumulate as a
def i():return list(map(int,input().split()))
n,m=i()
print((sum([v*(v-1)//2 for v in list(C([x%m for x in a([0]+i())]).values())]))) | p03287 |
import sys
input=sys.stdin.readline
if __name__ == '__main__':
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
dp=[[0 for i in range(N)] for j in range(N)]
count = 0
for i in range(N):
dp[i][i]=A[i]
dp[i][i]%=M
if dp[i][i]==0:
coun... | import sys
input=sys.stdin.readline
if __name__ == '__main__':
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
B=[0]*(N+1)
count=0
for i in range(N):
B[i+1]=B[i]+A[i]
B[i+1]%=M
for b in B:
c=B.count(b)
count+=c-1
print((cou... | p03287 |
from collections import defaultdict
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A[0] %= M
for i in range(N-1):
A[i+1] += A[i]
A[i+1] %= M
d = defaultdict(lambda:0)
d[0] = 1
ans = 0
for i in range(N):
ans += d[A[i]]
d[A[i]] += 1
print(ans) | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
from collections import defaultdict
r = defaultdict(lambda:0)
s = 0
for i in range(N):
s += A[i]
s %= M
r[s] += 1
ans = r[0]
for s in r:
ans += (r[s]*(r[s]-1))//2
print(ans) | p03287 |
import math
from itertools import accumulate
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
accum_A = [0] + A
accum_A = list(accumulate(accum_A))
ans = 0
for i in range(n):
for j in range(i+1,n+1):
# print('l:{}, r:{}, sum:{}'.format(i,j,(accum_A[j]-accum_A[i]))... |
import math
from itertools import accumulate
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
accum_A = [0] + A
accum_A = list(accumulate(accum_A))
mod_dic = {}
for... | p03287 |
n, m = list(map(int, input().split()))
l = list(map(int, input().split()))
l = [0] + l
from itertools import accumulate
cum =list(accumulate(l))
cum = [c%m for c in cum]
d = {}
ans = 0
for i in range(n+1):
if cum[i] not in d:
d[cum[i]] = 1
else:
ans += d[cum[i]]
d[cum[i]] += 1
print(an... | n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
from itertools import accumulate
B = [0]+A
B = list(accumulate(B))
d = {}
ans = 0
for i in range(n+1):
s = B[i]%m
if s in d:
ans += d[s]
d[s] += 1
else:
d[s] = 1
print(ans)
| p03287 |
# -*- coding: utf-8 -*-
# import numpy as np
N, M = list(map(int, input().split()))
An = list(map(int, input().split()))
pare_list = []
val_list = []
for i in range(N):
tmp = 0
for j in range(i,N):
tmp += An[j]
pare_list.append((i,j))
# for m in range(i,j+1):
# ... | # -*- coding: utf-8 -*-
# import numpy as np
N, M = list(map(int, input().split()))
An = list(map(int, input().split()))
pare_list = []
val_list = []
for i in range(N):
tmp = 0
for j in range(i,N):
tmp += An[j]
# pare_list.append((i,j))
# for m in range(i,j+1):
... | p03287 |
N, M = list(map( int, input().split()))
A = list( map( int, input().split()))
A = [ x%M for x in A]
SUM = [0]
for i in range(N):
SUM.append(SUM[-1]+A[i])
ans = 0
cnt = 1
for l in range(N):
if A[l] == 0:
ans += cnt
cnt += 1
else:
PART = 0
for r in range(l+1,N+1):... | N, M = list(map( int, input().split()))
A = list( map( int, input().split()))
D = {0:1}
a = 0
ans = 0
for i in range(N):
a = (a+A[i])%M
ans += D.get(a,0)
D[a] = 1 + D.get(a,0)
print(ans) | p03287 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.