input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import heapq
N = int(eval(input()))
edges = {i: [] for i in range(N)}
for i in range(N - 1):
a, b, c = list(map(int, input().split(" ")))
edges[a - 1].append((b - 1, c))
edges[b - 1].append((a - 1, c))
Q, K = list(map(int, input().split(" ")))
# Kからの最短距離を計算
dist = [-1 for i in range(N)]
que = ... | import heapq
import sys
input = sys.stdin.readline
N = int(eval(input()))
edges = {i: [] for i in range(N)}
for i in range(N - 1):
a, b, c = list(map(int, input().split(" ")))
edges[a - 1].append((b - 1, c))
edges[b - 1].append((a - 1, c))
Q, K = list(map(int, input().split(" ")))
# Kからの最短距離を計... | p03634 |
# -*- coding: utf-8 -*-
from collections import defaultdict,deque
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 = defaultdict(lambda: defaultdict(int))
for a,b,c in abc:
... | # -*- coding: utf-8 -*-
from collections import defaultdict,deque
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 = defaultdict(lambda: defaultdict(int))
graph = [defaultdi... | p03634 |
#dojkstra (prioroty queue ver.)
import queue
G=[]
inf=3*10**15
#V, E=map(int,input().strip().split(' '))
V=int(input().strip())
E=V-1
for i in range(V):
G.append([])
for i in range(E):
at,bt,ct=list(map(int,input().strip().split(' ')))
G[at-1].append([ct,bt-1])
G[bt-1].append([ct,at-1]) #無... | #dojkstra (prioroty queue ver.)
import queue
G=[]
#infの値に注意
inf=3*10**15
#V, E=map(int,input().strip().split(' '))
V=int(input().strip())
E=V-1
for i in range(V):
G.append([])
for i in range(E):
at,bt,ct=list(map(int,input().strip().split(' ')))
G[at-1].append([ct,bt-1])
G[bt-1].append([c... | p03634 |
#dojkstra (prioroty queue ver.)
import queue
G=[]
#infの値に注意
inf=3*10**15
#V, E=map(int,input().strip().split(' '))
V=int(input().strip())
E=V-1
for i in range(V):
G.append([])
for i in range(E):
at,bt,ct=list(map(int,input().strip().split(' ')))
G[at-1].append([ct,bt-1])
G[bt-1].append([c... | import sys
#limit=sys.getrecursionlimit()
sys.setrecursionlimit(10000000)
#sys.setrecursionlimit(1000000000)
V=int(input().strip())
E=V-1
inf=3*10**15
G=[]
dist=[inf]*V
for i in range(V):
G.append([])
for i in range(E):
at,bt,ct=list(map(int,input().strip().split(' ')))
G[at-1].append([ct,b... | p03634 |
#!/usr/bin/env python3
import sys
def warshall_floyd(conn):
n = len(conn)
dp = [[v for v in A] for A in conn]
for k in range(n):
for i in range(n):
for j in range(n):
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])
return dp
def solve(N: int, A: "List[in... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def dfs(idx, visited, conn, d, cur):
visited[idx] = True
for nex in conn[idx]:
if not visited[nex[0]]:
d[nex[0]] = cur + nex[1]
d = dfs(nex[0], visited, conn, d, cur + nex[1])
return d
def solve... | p03634 |
#!/usr/bin/python3
# -*- coding:utf-8 -*-
from collections import defaultdict
import sys
sys.setrecursionlimit(10**9)
def main():
n = int(eval(input()))
tree = defaultdict(lambda : {'parent':-1, 'score':0, 'children':[]})
weights = dict()
for _ in range(n-1):
a, b, c = list(map(int, input().sp... | #!/usr/bin/python3
# -*- coding:utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
def main():
n = int(eval(input()))
inode2scores = [0] * (n+1)
tree = [[] for _ in range(n+1)]
weights = dict()
for _ in range(n-1):
a, b, c = list(map(int, input().split()))
tree[a].append(b)
tree[b].... | p03634 |
from heapq import heappush, heappop
from collections import deque
N = int(eval(input()))
G = [[] 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
G[a].append((b, c))
G[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
IN... | import sys
sys.setrecursionlimit(10 ** 6)
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()))
dist = [-1] * N
def dfs(u, par, d):
... | p03634 |
import sys
sys.setrecursionlimit(10 ** 6)
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()))
dist = [-1] * N
def dfs(u, par, d):
... | import sys
sys.setrecursionlimit(10 ** 6)
N = int(eval(input()))
G = [[] 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
G[a].append((b, c))
G[b].append((a, c))
d = [0] * N
def dfs(u, p, k):
d[u] = k
for w, c in G[u]:
... | p03634 |
from collections import deque
def bfs(start):
queue = deque([start])
visited = []
while queue:
label = queue.pop()
if label not in visited:
visited.append(label)
for v in d[label]:
if dist[v[0]] == float("inf"):
di... | from collections import deque
def bfs(start):
queue = deque([start])
visited = []
while queue:
label = queue.pop()
#if label not in visited:
visited.append(label)
for v in d[label]:
if dist[v[0]] == float("inf"):
dist[v[0]] = dist... | p03634 |
from collections import deque
def nearlist(N, LIST): # 隣接リスト
NEAR = [set() for _ in range(N)]
COST = {}
for a, b, c in LIST:
NEAR[a - 1].add(b - 1)
NEAR[b - 1].add(a - 1)
COST[(a - 1, b - 1)] = c
COST[(b - 1, a - 1)] = c
return NEAR, COST
def bfs(NEAR, ... | from collections import deque
def nearlist(N, LIST): # 隣接リスト
NEAR = [{} for _ in range(N)]
for a, b, c in LIST:
NEAR[a - 1][b - 1] = c
NEAR[b - 1][a - 1] = c
return NEAR
def bfs(NEAR, S, N): # 幅優先探索 # キュー
DIST = [-1 for _ in range(N)] # 前処理
DIST[S] = 0
que, ... | p03634 |
from collections import deque
def nearlist(N, LIST): # 隣接リスト
NEAR = [{} for _ in range(N)]
for a, b, c in LIST:
NEAR[a - 1][b - 1] = c
NEAR[b - 1][a - 1] = c
return NEAR
def dfs(NEAR, S, N): # 深優先探索 # スタック
DIST = [-1 for _ in range(N)] # 前処理
DIST[S] = 0
stac... | def nearlist(N, LIST): # 隣接リスト
NEAR = [{} for _ in range(N)]
for a, b, c in LIST:
NEAR[a - 1][b - 1] = c
NEAR[b - 1][a - 1] = c
return NEAR
def dfs(NEAR, S, N): # 深優先探索 # スタック
DIST = [-1 for _ in range(N)] # 前処理
DIST[S] = 0
stack, frag = [S], set([S])
whil... | p03634 |
from collections import deque
N = int(eval(input()))
G = [[-1 for j in range(N)] for i 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
Q, K = list(map(int, input().split()))
visited = [False] * N
visited[K-1] = True
distance = [... | from collections import deque
N = int(eval(input()))
G = set()
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
G.add((a, b, c))
Q, K = list(map(int, input().split()))
visited = [False] * N
visited[K-1] = True
distance = [-1]*N
que = deque([(K, 0)])
while que:
cur, d = ... | p03634 |
from collections import deque
N = int(eval(input()))
G = [set() for i in range(N)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
G[a-1].add((b, c))
G[b-1].add((a, c))
Q, K = list(map(int, input().split()))
visited = [False] * N
visited[K-1] = True
distance = [-1]*N
qu... | import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
G = [set() for i in range(N)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
G[a-1].add((b, c))
G[b-1].add((a, c))
Q, K = list(map(int, input().split()))
visited = [False] * N
visited[K-1] = True
distance =... | p03634 |
# -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(eval(input()))
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [0 for _ in range(n)]
for i in range(n - 1):
ai, bi, c... | # -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(eval(input()))
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [float('inf') for _ in range(n)]
for i in range(n - 1):
... | p03634 |
import sys
sys.setrecursionlimit(10**6)
n=int(input())
G=[[]for i in[0]*-~n]
for I in[lambda:map(int,input().split())]*~-n:a,b,c=I();G[a]+=(b,c),;G[b]+=(a,c),
q,k=I()
d=[0]*-~n
def f(v,p,u):
d[v]=u
for t,c in G[v]:p==t or f(t,v,u+c)
f(k,0,0)
for p in[print]*q:
x,y=I()
p(d[x]+d[y])
| import sys;sys.setrecursionlimit(6**8);I=lambda:list(map(int,input().split()));n,=I();G=[[]for i in[0]*-~n]
for i in[0]*~-n:a,b,c=I();G[a]+=(b,c),;G[b]+=(a,c),
q,k=I()
def f(v,p,u):
for t,c in G[v]:p==t or f(t,v,u+c)
G[v]=u
f(k,0,0)
for p in[0]*q:x,y=I();print((G[x]+G[y])) | p03634 |
import queue
import sys
sys.setrecursionlimit(10**7)
n = int(eval(input()))
abc = [[] for i in range(n+1)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
abc[a].append([b,c])
abc[b].append([a,c])
Q,k = list(map(int,input().split()))
xy = [[int(i) for i in input().split()] for j ... | import queue
n = int(eval(input()))
abc = [[] for i in range(n+1)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
abc[a].append([b,c])
abc[b].append([a,c])
Q,k = list(map(int,input().split()))
xy = [[int(i) for i in input().split()] for j in range(Q)]
q = queue.Queue()
q.put... | p03634 |
import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in list(inspect.currentframe().f_back.f_locals.items())
}
print(... | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in list(inspect.currentframe().f_back.f_locals.items())
}
print(... | p03634 |
n=int(eval(input()))
es=[[] for _ in range(n)]
for _ in range(n-1):
a,b,c=list(map(int,input().split()))
es[a-1].append((b-1,c))
es[b-1].append((a-1,c))
from heapq import heappush, heappop
def dijkstra(edges, size, source):
distance = [float('inf')] * size
distance[source] = 0
visi... | n=int(eval(input()))
es=[[] for _ in range(n)]
for _ in range(n-1):
a,b,c=list(map(int,input().split()))
es[a-1].append((b-1,c))
es[b-1].append((a-1,c))
q,k=list(map(int,input().split()))
k-=1
dist=[float('inf')]*n
dist[k]=0
stack=[k]
while stack:
now=stack.pop()
for e,w in es[now... | p03634 |
import sys
input = sys.stdin.readline
from collections import deque
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, a, c])
graph[b].append([a, b, c])
distance = [-1] * (N + 1)
Q, K = list(map(int... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
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()))
d = ... | p03634 |
import sys
from collections import deque
inf=100000000000000000000
fastinput=sys.stdin.readline
N=int(fastinput())
path=[[0]*N for hoge in range(N)]
for fuga in range(N-1):
a,b,c=[int(hoge) for hoge in fastinput().split()]
path[a-1][b-1]=c
path[b-1][a-1]=c
Q,K=[int(hoge) for hoge in fastinput().sp... | import sys
from collections import deque
inf=100000000000000000000
fastinput=sys.stdin.readline
N=int(fastinput())
path=[[] for hoge in range(N)]
for fuga in range(N-1):
a,b,c=[int(hoge) for hoge in fastinput().split()]
path[a-1].append([b-1,c])
path[b-1].append([a-1,c])
Q,K=[int(hoge) for hoge in... | p03634 |
import copy
n = int(eval(input()))
d = []
for i in range(n - 1):#h:高さ
d.append([int(m) for m in input().split()])
q, k = list(map(int, input().split()))
z = []
for i in range(q):#h:高さ
z.append([int(m) for m in input().split()])
e = []
for i in range(n):
e.append([])
for i in d:
e[i[0] - 1].... | n = int(eval(input()))
d = []
for i in range(n - 1):#h:高さ
d.append([int(m) for m in input().split()])
q, k = list(map(int, input().split()))
z = []
for i in range(q):#h:高さ
z.append([int(m) for m in input().split()])
for i in range(n - 1):
d[i][0] -= 1
d[i][1] -= 1
for i in range(q):
z[... | p03634 |
import collections
def bfs(tree, s, distance):
queue = [s]
distance[s] = 0
while queue:
v = queue.pop(0)
v_c = distance[v]
for node, cost in tree[v]:
if distance[node] == -1:
distance[node] = v_c + cost
queue.append(node)
N... | import collections
def bfs(tree, s, distance):
queue = collections.deque([s])
distance[s] = 0
while queue:
v = queue.popleft()
v_c = distance[v]
for node, cost in tree[v]:
if distance[node] == -1:
distance[node] = v_c + cost
q... | p03634 |
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
X = [[] for _ in range(N)]
for i in range(N-1):
a,b,c = list(map(int,input().split()))
X[a-1].append((b-1,c))
X[b-1].append((a-1,c))
cost = [-1]*N
def calc(i,c):
# 指定の頂点までのコストを代入
cost[i] = c
# 頂点から移動できる頂点があれば
... | import sys
sys.setrecursionlimit(1000000)
def dfs(n,p,d):
visited[n] = True
dist[n] = d
for (i,c) in A[n]:
if i != p and not visited[i]:
dfs(i,n,d+c)
N = int(eval(input()))
A = [[] for _ in range(N)]
for _ in range(N-1):
a,b,c = list(map(int,input().split()))
A[a-... | p03634 |
from heapq import heappush, heappop
INF = 10**15
def dijkstra(s, edges):
n = len(edges)
que = []
d = [INF] * n
prev = [-1] * n
d[s] = 0
heappush(que, (0, s))
while len(que) > 0:
(c, v) = heappop(que)
if d[v] < c:
continue
for (cc, w) in ... | from heapq import heappush, heappop
INF = 10**15
def dijkstra(s, edges):
n = len(edges)
que = []
d = [INF] * n
prev = [-1] * n
d[s] = 0
heappush(que, (0, s))
while len(que) > 0:
(c, v) = heappop(que)
if d[v] < c:
continue
for (cc, w) in edges[... | p03634 |
n = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(n-1)]
dp = [[0 for _ in range(n)] for _ in range(n)]
INF = 10**18
for i in range(n):
for j in range(n):
if i!=j:
dp[i][j] = INF
for a,b,c in l:
dp[a-1][b-1] = c
dp[b-1][a-1] = c
#print(dp)
#最短リスト
f... | import sys
sys.setrecursionlimit(200000)
n = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(n-1)]
q,k = list(map(int,input().split()))
k -= 1
#kからの距離
tree = [[] for _ in range(n)]
for a,b,c in l:
a -= 1
b -= 1
tree[a].append([b,c])
tree[b].append([a,c])
bit = [0... | p03634 |
N = int(eval(input()))
edge = set(tuple(map(int, input().split())) for i in range(N-1))
Q, K = list(map(int, input().split()))
query = [tuple(map(int, input().split())) for i in range(Q)]
# dist[-i]:頂点Kから頂点iまでの距離
dist = [None for i in range(N)]
dist[-K] = 0
while edge:
rm = set()
for a, b, c in edge:... | import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
adj = [[] for i in range(N)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
adj[-a].append((b, c))
adj[-b].append((a, c))
Q, K = list(map(int, input().split()))
query = [tuple(map(int, input().split())) for i i... | p03634 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def... | p03634 |
import collections
N = int(eval(input()))
List = [[] for _ in range(N)]
ans = [-1]*N
for i in range(N-1):
a, b, c = list(map(int, input().split()))
List[a-1].append((b-1, c))
List[b-1].append((a-1, c))
Q, K = list(map(int, input().split()))
queue = collections.deque([K-1])
ans[K-1] = 0
while queu... | import sys
input = sys.stdin.readline
N = int(eval(input()))
List = [[] for _ in range(N)]
ans = [-1]*N
for i in range(N-1):
a, b, c = list(map(int, input().split()))
List[a-1].append((b-1, c))
List[b-1].append((a-1, c))
Q, K = list(map(int, input().split()))
queue = [K-1]
ans[K-1] = 0
while que... | p03634 |
import sys
sys.setrecursionlimit(10**6)
def dfs(v, d=0):
seen[v] = True
dist[v] = d
for i in graph[v]:
next_v = i[0]
l = i[1]
if seen[next_v] == True:
continue
dfs(next_v, d+l)
return
N = int(eval(input()))
graph = [[] for i in range(N +... | import sys
sys.setrecursionlimit(10**6)
def dfs(v, d=0):
seen[v] = True
dist[v] = d
for i in graph[v]:
next_v = i[0]
l = i[1]
if seen[next_v] == True:
continue
dfs(next_v, d+l)
return
N = int(eval(input()))
graph = [[] for i in range(N +... | p03634 |
from collections import deque
N = int(eval(input()))
edge = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
edge[a].append([b, c])
edge[b].append([a, c])
def BFS(x, y):
visited = [False for _ in range(N+1)]
next_N = [False for _ in range(N+1)]
... | from collections import deque
N = int(eval(input()))
edge = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
edge[a].append([b, c])
edge[b].append([a, c])
def BFS(x):
visited = [False for _ in range(N+1)]
next_N = [False for _ in range(N+1)]
I... | p03634 |
import queue
def main():
n = int(eval(input()))
a = []
b = []
c = []
lst = [[] for _ in range(n)]
for i in range(n - 1):
aa, bb, cc = list(map(int,input().split()))
lst[aa - 1].append((bb - 1, cc))
lst[bb - 1].append((aa - 1, cc))
q, k = list(map(int,in... | from collections import deque
def main():
n = int(eval(input()))
a = []
b = []
c = []
lst = [[] for _ in range(n)]
for i in range(n - 1):
aa, bb, cc = list(map(int,input().split()))
lst[aa - 1].append((bb - 1, cc))
lst[bb - 1].append((aa - 1, cc))
q, k ... | p03634 |
from collections import defaultdict
N = int(eval(input()))
E = defaultdict(list)
W = dict()
for i in range(N-1):
a,b,c = list(map(int,input().split()))
E[a].append(b)
E[b].append(a)
W[(a,b)] = c
W[(b,a)] = c
Q,K = list(map(int,input().split()))
costs = [float('inf')]*(N+1)
costs[K] = 0
... |
N = int(eval(input()))
E = [[] for _ in range(N)]
for i in range(N-1):
a,b,c = list(map(int,input().split()))
a -= 1
b -= 1
E[a].append((b,c))
E[b].append((a,c))
Q,K = list(map(int,input().split()))
K -= 1
costs = [None]*N
costs[K] = 0
stack = [K]
while stack:
s = stack.pop()
c = ... | p03634 |
from collections import deque
def main():
n = int(eval(input()))
tree = AdjacentListGraph([Vertex() for _ in range(n)])
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
tree.add_edge(a - 1, b - 1, c)
tree.add_edge(b - 1, a - 1, c)
q, k = list(map(int, ... | from collections import deque
def main():
n = int(eval(input()))
tree = AdjacentListGraph([Vertex() for _ in range(n)])
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
tree.add_edge(a - 1, b - 1, c)
tree.add_edge(b - 1, a - 1, c)
q, k = list(map(int, ... | p03634 |
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]
def inpl(): return list(map(int, input().split()))
def ... | from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]
def inpl(): return list(map(int, input().split()))
def ... | p03634 |
from collections import deque
N=int(eval(input()))
cost=[[float("inf")]*N for _ in range(N)]
graph=[[] for _ in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
graph[a].append(b)
graph[b].append(a)
cost[a][b]=c
cost[b][a]=c
def dfs(start):
v... | import sys
sys.setrecursionlimit(10**9)
N=int(eval(input()))
graph=[[] for _ in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
graph[a].append([b,c])
graph[b].append([a,c])
def dfs(start):
for x,cost in graph[start]:
if d[x]==-1:
... | p03634 |
from queue import deque
n = int(eval(input()))
edges = [set() for _ in range(n + 1)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
edges[a].add((c, b))
edges[b].add((c, a))
q, k = list(map(int, input().split()))
stack = deque([(0, k)])
costs = [0] * (n + 1)
visited = set()
wh... | n = int(eval(input()))
edges = [set() for _ in range(n + 1)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
edges[a].add((c, b))
edges[b].add((c, a))
q, k = list(map(int, input().split()))
stack = [(0, k, None)]
costs = [0] * (n + 1)
visited = set()
while stack:
c, p, a = st... | p03634 |
n = int(eval(input()))
edges = [set() for _ in range(n + 1)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
edges[a].add((c, b))
edges[b].add((c, a))
q, k = list(map(int, input().split()))
stack = [(0, k, None)]
costs = [0] * (n + 1)
while stack:
c, p, a = stack.pop()
co... | n = int(eval(input()))
edges = [[] for _ in range(n + 1)]
for a, b, c in (list(map(int, input().split())) for _ in range(n - 1)):
edges[a].append((c, b))
edges[b].append((c, a))
q, k = list(map(int, input().split()))
stack = [(0, k, None)]
costs = [0] * (n + 1)
while stack:
c, p, a = stack.pop()
... | p03634 |
import heapq
N = int(eval(input()))
nb = [[] for _ in range(N)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
nb[a].append((c, b))
nb[b].append((c, a))
for x in nb:
x.sort()
Q, K = list(map(int, input().split()))
K -= 1
dist = [2 ** 62] * N
vi... | import sys
import heapq
input = sys.stdin.readline
def main():
N = int(eval(input()))
nb = [[] for _ in range(N)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
nb[a].append((c, b))
nb[b].append((c, a))
for x in ... | p03634 |
from heapq import heappop, heappush
N = int(eval(input()))
links = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
links[a].append((b, c))
links[b].append((a, c))
Q, K = list(map(int, input().split()))
d = [float('inf')] * (N + 1)
d[K] = 0
#prev = ... | N = int(eval(input()))
links = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
links[a].append((b, c))
links[b].append((a, c))
Q, K = list(map(int, input().split()))
d = [float('inf')] * (N + 1)
d[K] = 0
q = [K]
while q:
i = q.pop()
for j, ... | p03634 |
from collections import defaultdict
def warshall_floyd(V, E):
INF = 10 ** 10
d = [defaultdict(lambda: INF) for i in range(V)]
for i, j, c in E:
d[i - 1][j - 1] = c
d[j - 1][i - 1] = c
for k in range(V):
for i in range(V - 1):
for j in range(i, V):
... | def dfs(i, V, E):
S = [i]
while(len(S) > 0):
vi = S.pop()
d = V[vi]
for j, value in list(E[vi].items()):
if V[j] > value + d:
V[j] = value + d
S.append(j)
return V
INF = 10 ** 14
n = int(eval(input()))
V = [INF for _ in range(... | p03634 |
from collections import *
d=defaultdict(list)
n=int(eval(input()))
for s in range(n-1):
a,b,c=list(map(int,input().split()))
d[a].append([b,c])
d[b].append([a,c])
#defaultdict(<class 'list'>, {1: [[2, 1], [3, 1]], 2: [[1, 1], [3, 3]], 3: [[1, 1], [2, 3]]})
def DIJKSTRA(point,d):
cost ... | from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
d=defaultdict(list)
n=int(eval(input()))
for s in range(n-1):
a,b,c=list(map(int,input().split()))
d[a].append([b,c])
d[b].append([a,c])
#defaultdict(<class 'list'>, {1: [[2, 1], [3, 1]], 2: [[1, 1], [3, ... | p03634 |
from collections import *
from heapq import*
import sys
input=sys.stdin.readline
d=defaultdict(list)
n=int(eval(input()))
for s in range(n-1):
a,b,c=list(map(int,input().split()))
d[a].append([b,c])
d[b].append([a,c])
#defaultdict(<class 'list'>, {1: [[2, 1], [3, 1]], 2: [[1, 1], [3, 3]], 3: [[... | from collections import *
from heapq import*
import sys
input=sys.stdin.readline
d=defaultdict(list)
n=int(eval(input()))
for s in range(n-1):
a,b,c=list(map(int,input().split()))
d[a].append([b,c])
d[b].append([a,c])
#defaultdict(<class 'list'>, {1: [[2, 1], [3, 1]], 2: [[1, 1], [3, 3]], 3: [[... | p03634 |
from collections import defaultdict
def inpl(): return [int(i) for i in input().split()]
path = defaultdict(lambda: [])
N = int(eval(input()))
for _ in range(N-1):
a, b, c = inpl()
path[a].append((b,c))
path[b].append((a,c))
Q, K = inpl()
now = {K}
dist = [0 for _ in range(N+1)]
visited = [Fa... | from collections import defaultdict
def inpl(): return [int(i) for i in input().split()]
path = defaultdict(lambda: [])
N = int(eval(input()))
for _ in range(N-1):
a, b, c = inpl()
path[a].append((b,c))
path[b].append((a,c))
ctr = 1
Q, K = inpl()
now = [K]
dist = [0 for _ in range(N+1)]
whil... | p03634 |
from collections import deque
N = int(eval(input()))
graph = [[] * N for _ in range(N)]
graph_dist = [[0] * N for _ in range(N)]
C = [0] * (N - 1)
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
graph[a].append(b)
graph[b].append(a)
graph_dist[a][b] = c
... | from collections import deque
N = int(eval(input()))
graph = [[] * N for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
graph[a].append([b, c])
graph[b].append([a, c])
Q, K = list(map(int, input().split()))
xy = [list(map(int, input().spli... | p03634 |
from heapq import heappush, heappop
from math import isinf
class Edge(object):
def __init__(self, src, dst, cost):
self.src = src
self.dst = dst
self.cost = cost
class Dijkstra(object):
def __init__(self, v_len, edges, start, directed=False):
"""
ダイク... | N = int(eval(input()))
nl = [list() for _ in range(N + 1)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
nl[a].append((b, c))
nl[b].append((a, c))
Q, K = list(map(int, input().split()))
ans = [-1 for _ in range(N + 1)]
stack = [(K, -1, 0)] # v, p, c
while len(stack) > 0:
... | p03634 |
#!/usr/bin/env python3
import sys
import heapq
def main():
input = sys.stdin.readline
n = int(eval(input()))
adjs = [[] for i in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
adjs[a - 1].append((b - 1, c))
adjs[b - 1].append((a - 1, c))
... | #!/usr/bin/env python3
import sys
def main():
input = sys.stdin.readline
n = int(eval(input()))
adjs = [[] for i in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
adjs[a - 1].append((b - 1, c))
adjs[b - 1].append((a - 1, c))
q, k = li... | p03634 |
import heapq
import sys
sys.setrecursionlimit(10000)
INF = float('inf')
N = int(sys.stdin.readline())
ABC = [list(map(int, sys.stdin.readline().split())) for _ in range(N - 1)]
Q, K = list(map(int, sys.stdin.readline().split()))
X, Y = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(Q)... | import sys
sys.setrecursionlimit(100000)
INF = float('inf')
N = int(sys.stdin.readline())
ABC = [list(map(int, sys.stdin.readline().split())) for _ in range(N - 1)]
Q, K = list(map(int, sys.stdin.readline().split()))
X, Y = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(Q)]))
#: :ty... | p03634 |
import heapq
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)]
connect = [[] for _ in range(N)]
INFTY = 10**15
for a,b,c in abc:
connect[a-1].append([b-1,c])
connect[b-1].app... | N = int(eval(input()))
ABC = [list(map(int,input().split())) for _ in [0]*(N-1)]
Q,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*Q]
E = [{} for _ in [0]*N]
for a,b,c in ABC:
E[a-1][b-1] = c
E[b-1][a-1] = c
def dist_dfs_tree(N,E,start):
d = [-1]*N
d[st... | p03634 |
import sys
import heapq
from operator import itemgetter
from collections import deque, defaultdict
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
class Heapq:
def __init__(self, que=[], asc=True):
if not asc:
que = [-a for a in ... | from collections import deque
import sys
input = sys.stdin.buffer.readline
N = int(input())
edges = [[] for _ in range(N)]
for _ in range(N - 1):
fr, to, cost = map(int, input().split())
fr -= 1
to -= 1
edges[fr].append((to, cost))
edges[to].append((fr, cost))
Q, K = map(int, input(... | p03634 |
N = int(input())
edges = [[] for _ in range(N)]
for _ in range(N - 1):
fr, to, cost = map(int, input().split())
fr -= 1
to -= 1
edges[fr].append((to, cost))
edges[to].append((fr, cost))
Q, K = map(int, input().split())
K -= 1
minDist = [10**18] * N
minDist[K] = 0
st = [(K, 0)]
whi... | N = int(input())
edges = [[] for _ in range(N)]
for _ in range(N - 1):
fr, to, cost = map(int, input().split())
fr -= 1
to -= 1
edges[fr].append((to, cost))
edges[to].append((fr, cost))
Q, K = map(int, input().split())
K -= 1
XY = [tuple(map(lambda a: int(a) - 1, input().split())) for ... | p03634 |
import sys
sys.setrecursionlimit(100001)
def input():
return sys.stdin.readline()[:-1]
from heapq import *
INF = 10 ** 20
def dijkstra(s, edges):
dist = [INF for _ in range(len(edges))]
dist[s], h = 0, []
heappush(h, (0, s))
while (len(h)):
dv, v = heappop(h)
if dv > di... | import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()[:-1]
from heapq import *
def dfs(s, es):
dist = [None] * len(es)
dist[s] = 0
def ret(v, d):
for u, c in es[v]:
if dist[u] == None:
dist[u] = dist[v] + c
re... | p03634 |
import sys
# sys.setrecursionlimit(100000)
from collections import defaultdict
def warshall_floyd(graph: dict, N: int):
""" graph:
{node:{node:cost,node:cost,...},
node:{node:cost,node:cost,...},...}
"""
INF = float("inf")
dp = [[INF] * N for _ in range(N)]
for i in range(N):
... | import sys
# sys.setrecursionlimit(100000)
from collections import defaultdict
from heapq import heappop, heappush
class Dijkstra:
"""Graph input:
{
node:{node:cost,node:cost...},
node:{node:cost,node:cost...},
...
}
"""
def __init__(self, graph: dict, N: int):
... | p03634 |
n = int(eval(input()))
connect_list = [[] for i in range(n)]
for i in range(n-1):
a, b, c = [ int(v)-1 for v in input().split() ]
c += 1
connect_list[a].append((b,c))
connect_list[b].append((a,c))
q, k = [ int(v) for v in input().split() ]
k -= 1
shortest_list = [-1 for i in range(n)]
sh... | import sys
input = sys.stdin.readline
n = int(eval(input()))
connect_list = [[] for i in range(n)]
for i in range(n-1):
a, b, c = [ int(v)-1 for v in input().split() ]
c += 1
connect_list[a].append((b,c))
connect_list[b].append((a,c))
q, k = [ int(v) for v in input().split() ]
k -= 1
... | 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()))
a-=1;b-=1
g[a].append([b,c])
g[b].append([a,c])
q,k = list(map(int,input().split()))
k -= 1
con = [-1] * n
con[k] = 0
stack = [k]
while stack:
cur = stack.pop()
for i,j in g[cur]:
... | import sys
input = sys.stdin.readline
n = int(eval(input()))
g = [[] for i in range(n)]
for i 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().split()))
k -= 1
con = [-1] * n
con[k] = 0
stack = [k]
while stack:
cur ... | p03634 |
n = int(eval(input()))
tree = [[] for _ in range(n+1)]
for i 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 collections import deque
que = deque([k])
visit = [-1 for _ in range(n+1)]
visit[k] ... | def main():
n = int(eval(input()))
tree = [[] for _ in range(n+1)]
for i 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 collections import deque
que = deque(... | p03634 |
n = int(eval(input()))
graph = [dict() for _ in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
graph[a - 1][b - 1] = c
graph[b - 1][a - 1] = c
q, k = list(map(int, input().split()))
xy = []
for i in range(q):
x, y = list(map(int, input().split()))
xy.append(... | n = int(eval(input()))
graph = [dict() for _ in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
graph[a - 1][b - 1] = c
graph[b - 1][a - 1] = c
q, k = list(map(int, input().split()))
xy = []
for i in range(q):
x, y = list(map(int, input().split()))
xy.append(... | p03634 |
# disjoint setかと思いきやDFS
# どこが悪いのかさっっっっっっぱりわからん...
# あ 再帰にしてるからその上限か
import sys
sys.setrecursionlimit(10000000)
n = int(eval(input()))
graph = [[] for _ in range(n)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
graph[a].append([b, c])
graph[b].appe... | # disjoint setかと思いきやDFS
# したらTLEになったので根本的にやり方が間違ってるということ
# よくよく考えたらdfsなのでそこにたどり着いたときが最短距離だわ ムダに探索してた
import sys
sys.setrecursionlimit(10000000)
n = int(eval(input()))
graph = [[] for _ in range(n)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
graph... | p03634 |
from collections import deque
N = int(input())
E = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = map(int, input().split())
E[a-1].append((b-1, c))
E[b-1].append((a-1, c))
Q, K = map(int, input().split())
distance = [0] * N
stack = deque([K-1])
checked = [False] * N
while stack:
v... | from collections import deque
N = int(input())
E = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = map(int, input().split())
E[a-1].append((b-1, c))
E[b-1].append((a-1, c))
Q, K = map(int, input().split())
distance = [0] * N
stack = deque([K-1])
# checked = [False] * N
while stack:
... | p03634 |
from collections import deque
N = int(eval(input()))
G = [[] * N 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))
Q, K = list(map(int, input().split()))
D = [-1] * N
D[K - 1] = 0
q = deque([K - 1])
while ... | import sys
sys.setrecursionlimit(10**6)
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)]
G = [[] * N for _ in range(N)]
for a, b, c in ABC:
G[a - 1].append((b - 1, c))
G[b... | 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)]
G = [[] * N for _ in range(N)]
for a, b, c in ABC:
G[a - 1].append((b - 1, c))
G[b - 1].append((a - 1, c))
D = [-1] * N
s ... | import sys
input = sys.stdin.readline
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)]
G = [[] * N for _ in range(N)]
for a, b, c in ABC:
G[a - 1].append((b - 1, c))
G[b -... | p03634 |
import sys
input = sys.stdin.readline
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)]
G = [[] * N for _ in range(N)]
for a, b, c in ABC:
G[a - 1].append((b - 1, c))
G[b -... | import sys
input = sys.stdin.readline
N = int(eval(input()))
G = [[] * N 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))
Q, K = list(map(int, input().split()))
D = [-1] * N
s = [(K - 1, 0)]
while s:
v... | p03634 |
def dfs(k, path, n):
"""連結情報path,頂点の個数Nが与えられたとき
頂点Kから各頂点までの距離をlistで返す"""
from collections import deque # deque(),popleft()
dist = [-1] * n
dist[k] = 0
que = deque([])
que.append(k)
while que:
label = que.popleft()
for i,c in path[label]: # 頂点labelと連結している頂点iと距離c
... | from sys import stdin
input = stdin.readline
def dfs(k, path, n):
"""連結情報path,頂点の個数Nが与えられたとき
頂点Kから各頂点までの距離をlistで返す"""
from collections import deque # deque(),popleft()
dist = [-1] * n
dist[k] = 0
que = deque([])
que.append(k)
while que:
label = que.popleft()
... | p03634 |
import queue
def ans():
def dfs(v, p, d):
visited = []
q = queue.Queue()
for i in tree[v]:
q.put((i[0], i[1], p))
visited.append(v)
while not q.empty():
e, cost, parent = q.get()
if (e in visited): continue
if e == ... | import sys
sys.setrecursionlimit(1000000)
def ans():
def dfs(v, p, d):
depth[v] = d
for e, cost in tree[v]:
if e == p:
continue
dfs(e, v, d + cost)
n = int(eval(input()))
tree = [[] for _ in range(n + 1)]
depth = [0] * (n * 2)
... | p03634 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03634 |
from collections import deque
import sys
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
G = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = [int(_) for _ in input().split()]
G[a].append((b, c))
G[b].append((a, c))
Q, K = [int(_) for _ in input().split()]
# make tree
G2 ... | from collections import deque
import sys
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
G = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = [int(_) for _ in input().split()]
G[a].append((b, c))
G[b].append((a, c))
Q, K = [int(_) for _ in input().split()]
# make tree
G2 ... | p03634 |
import heapq
def dijkstra_heap(s,edge):
#始点sから各頂点への最短距離
d = [10**10]*n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = heapq.heappop(edgelist)
... | import heapq
"""
https://juppy.hatenablog.com/entry/2019/02/18/%E8%9F%BB%E6%9C%AC_python_%E3%83%97%E3%83%A9%E3%82%A4%E3%82%AA%E3%83%AA%E3%83%86%E3%82%A3%E3%82%AD%E3%83%A5%E3%83%BC%28heapq%29%E3%82%92%E7%94%A8%E3%81%84%E3%81%9F%E3%83%97%E3%83%AA%E3%83%A0%E6%B3%95
"""
def dijkstra_heap(s,edge):
#始点sから各頂点への最短... | p03634 |
from heapq import heappush, heappop
INF = 10**20
def dijkstra(N, G, s):
dist = [INF] * N
que = [(0, s)]
dist[s] = 0
while que:
c, v = heappop(que)
if dist[v] < c:
continue
for t, cost in G[v]:
if dist[v] + cost < dist[t]:
dist... |
from heapq import heappush, heappop
INF = float("inf")
def dijkstra(N, G, s):
dist = [INF] * N
que = [(0, s)]
dist[s] = 0
while que:
c, v = heappop(que)
if dist[v] < c:
continue
for t, cost in G[v]:
if dist[v] + cost < dist[t]:
... | p03634 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p03634 |
from collections import defaultdict
n = int(eval(input()))
tree = dict()
graph = defaultdict(list)
for i in range(n-1):
a,b,c = (int(x) for x in input().split())
tree[a,b] = c
tree[b,a] = c
graph[a].append(b)
graph[b].append(a)
q, k = (int(x) for x in input().split())
dist = dict()
... | from collections import defaultdict
n = int(eval(input()))
tree = dict()
graph = defaultdict(list)
for i in range(n-1):
a,b,c = (int(x) for x in input().split())
tree[a,b] = c
tree[b,a] = c
graph[a].append(b)
graph[b].append(a)
q, k = (int(x) for x in input().split())
dist = dict()
... | p03634 |
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | p03634 |
N=int(eval(input()))
edge=[list(map(int,input().split())) for i in range(N-1)]
INF=10**15
c=[[INF]*N for i in range(N)]
for i,j,w in edge:
c[i-1][j-1]=w
c[j-1][i-1]=w
Q,K=list(map(int, input().split()))
xy=[list(map(int,input().split())) for i in range(Q)]
from heapq import heappop,heappush
def dij(c,... | N=int(eval(input()))
edge=[list(map(int,input().split())) for i in range(N-1)]
inf=10**15
c=[[] for i in range(N)]
for i,j,w in edge:
c[i-1].append((j-1,w))
c[j-1].append((i-1,w))
Q,K=list(map(int, input().split()))
d=[inf]*N
d[K-1]=0
v=[0]*N
import sys
sys.setrecursionlimit(10**5+9)
def dfs(p,v,d)... | p03634 |
from collections import defaultdict
n = int(eval(input()))
V = defaultdict(list)
for _ in range(n-1):
a, b,c = list(map(int, input().split()))
V[a].append([b,c])
V[b].append([a,c])
def dfs(source):
dist = [-1]*(n+1)
dist[source] = 0
q = [source]
while q:
a = q.pop(... | from collections import defaultdict
n = int(eval(input()))
V = defaultdict(list)
for _ in range(n-1):
a, b,c = list(map(int, input().split()))
V[a].append([b,c])
V[b].append([a,c])
def dfs(source):
dist = [-1]*(n+1)
dist[source] = 0
q = [source]
while q:
a = q.pop(... | p03634 |
## abc070d: Transit Tree Path
n = int(eval(input()))
T = [None]*(n+1)
for _ in range(n-1):
v1,v2,d = list(map(int, input().split()))
T[v1] = T[v1] + [[v1,v2,d]] if(T[v1]) else [[v1,v2,d]]
T[v2] = T[v2] + [[v2,v1,d]] if(T[v2]) else [[v2,v1,d]]
q,k = list(map(int, input().split()))
depth = [0]... | ## abc070d: Transit Tree Path
n = int(eval(input()))
T = [None]*(n+1)
for _ in range(n-1):
v1,v2,d = list(map(int, input().split()))
if(T[v1] is None): T[v1] = [[v1,v2,d]]
else: T[v1].append([v1,v2,d])
if(T[v2] is None): T[v2] = [[v2,v1,d]]
else: T[v2].append([v2,v1,d])
q,k = list(m... | p03634 |
## abc070d: Transit Tree Path
from collections import deque
n = int(eval(input()))
T = [{} for _ in range(n)]
for _ in range(n-1):
v1,v2,d = list(map(int, input().split()))
T[v1-1][v2-1] = d
T[v2-1][v1-1] = d
q,k = list(map(int, input().split()))
visit = [False]*n
depth = [0]*n
que = de... | ## abc070d: Transit Tree Path
from collections import deque
n = int(eval(input()))
T = [{} for _ in range(n)]
for _ in range(n-1):
v1,v2,d = list(map(int, input().split()))
T[v1-1][v2-1] = d
T[v2-1][v1-1] = d
q,k = list(map(int, input().split()))
visit = [False]*n
depth = [0]*n
que = de... | p03634 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
from collections import defaultdict
ns = defaultdict(set)
for i in range(n-1):
u,v,c = list(map(int, input().split()))
u -= 1
v -=... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
from collections import defaultdict
ns = defaultdict(set)
for i in range(n-1):
u,v,c = list(map(int, input().split()))
u -= 1
v -=... | p03634 |
import heapq
INF = 10**15
n = int(eval(input()))
dist_mat = [[INF]*n for _ in range(n)]
edges = [[] for _ in range(n)]
for i in range(n-1):
a, b, c = list(map(int,input().split()))
a -= 1
b -= 1
dist_mat[a][b] = c
dist_mat[b][a] = c
edges[a].append(b)
edges[b].append(a)
di... | import sys
sys.setrecursionlimit(10**9)
n = int(eval(input()))
edges = [[] for _ in range(n)]
costs = [-1]*n
def dfs(current):
for nex, cost in edges[current]:
if costs[nex] != -1:
continue
costs[nex] = costs[current] + cost
dfs(nex)
for i in range(n-1):
a, ... | p03634 |
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()))
tree[a-1].append([b-1,c])
tree[b-1].append([a-1,c])
q,k=list(map(int,input().split()))
dis=[-1 for i in range(n)]
dis[k-1]=0
que=deque()
que.append(k-1)
while que:
... | n=int(eval(input()))
g=[[] for i in range(n)]
for _ in range(n-1):
u,v,c=list(map(int,input().split()))
g[u-1].append((v-1,c))
g[v-1].append((u-1,c))
Q,k=list(map(int,input().split()))
d=[-1]*n
d[k-1]=0
q=[k-1]
while q:
t=q.pop()
for x,cost in g[t]:
if d[x]==-1:
d[x]=d[t]+cost
q... | p03634 |
import queue
n = int(eval(input()))
my_dict = dict()
mtx = [[0] * n for _ in range(n)]
for i in range(n-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
if a in my_dict:
my_dict[a].append(b)
else:
my_dict[a] = [b]
if b in my_dict:
my_dict[b].... | import queue
n = int(eval(input()))
my_dict = dict()
mtx = dict()
for i in range(n-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
if a in my_dict:
my_dict[a].append(b)
else:
my_dict[a] = [b]
if b in my_dict:
my_dict[b].append(a)
else:
... | p03634 |
n = int(eval(input()))
edge = []
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
edge.append([a-1,b-1,c])
q, k = list(map(int,input().split()))
querry = []
for _ in range(q):
x,y = list(map(int,input().split()))
querry.append([x-1,y-1])
class Graph():
def __init__(self... | n = int(eval(input()))
edge = []
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
edge.append([a-1,b-1,c])
q, k = list(map(int,input().split()))
querry = []
for _ in range(q):
x,y = list(map(int,input().split()))
querry.append([x-1,y-1])
class Graph():
def __init__(self... | p03634 |
N = int(eval(input()))
edge = [[] for i in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
edge[a-1].append([c, b-1])
edge[b-1].append([c, a-1])
Q, K = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]
import heapq
def dijkstra_... | N = int(eval(input()))
edge = [[] for i in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
edge[a-1].append([c, b-1])
edge[b-1].append([c, a-1])
Q, K = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]
import heapq
def dijkstra_... | p03634 |
from collections import deque
def dfs(neigh,K):
q = deque()
q.append(K)
visited = [False]*N
d = [0]*N
visited[K] = True
while len(q)>0:
p = q.pop()
for i in range(len(neigh[p])):
if neigh[p][i]==0 or visited[i]:
continue
d[i] = ... | from collections import deque
def dfs(neigh,K):
q = deque([K])
d = [0]*N
visited = [0]*N
visited[K] = True
while q:
p = q.pop()
for di,cost in neigh[p]:
if visited[di]:
continue
d[di] = d[p]+cost
visited[di] = True
... | p03634 |
import heapq
def dijkstra(V, edges, s):
inf=float('inf')
dist=[inf]*V
dist[s]=0
que=[[0,s]]
heapq.heapify(que) #最小値を管理 [dist[i],i]となる要素
while que:
p=heapq.heappop(que) #距離が最小のものを取り出す
dis=p[0]
v=p[1]
if dist[v] <dis:
continue
... | import heapq
def dijkstra(V, edges, s):
inf=float('inf')
dist=[inf]*V
dist[s]=0
que=[[0,s]]
heapq.heapify(que) #最小値を管理 [dist[i],i]となる要素
while que:
p=heapq.heappop(que) #距離が最小のものを取り出す
dis=p[0]
v=p[1]
if dist[v] <dis:
continue
... | p03634 |
import heapq
def dijkstra(V, edges, s):
inf=float('inf')
dist=[inf]*V
dist[s]=0
que=[[0,s]]
heapq.heapify(que) #最小値を管理 [dist[i],i]となる要素
while que:
p=heapq.heappop(que) #距離が最小のものを取り出す
dis=p[0]
v=p[1]
if dist[v] <dis:
continue
... | def main():
import sys
input=sys.stdin.readline
sys.setrecursionlimit(1000000)
n=int(eval(input()))
edges=[[] for _ in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
edges[a].append([b,c])
edges[b].append([a,c])
... | p03634 |
import queue
N=int(eval(input()))
G=[dict() for i in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
G[a-1][b-1]=c
G[b-1][a-1]=c
Q,K=list(map(int,input().split()));K-=1
x=[0 for i in range(Q)]
y=[0 for i in range(Q)]
for i in range(Q):
x[i],y[i]=list(map(int,input().split(... | import queue
N=int(eval(input()))
G=[dict() for i in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
G[a-1][b-1]=c
G[b-1][a-1]=c
Q,K=list(map(int,input().split()));K-=1
x=[0 for i in range(Q)]
y=[0 for i in range(Q)]
for i in range(Q):
x[i],y[i]=list(map(int,input().split(... | p03634 |
# bellman_fordは重いのでTLE
from collections import namedtuple
import sys
input = sys.stdin.readline
def solve():
inf = 10 ** 14 + 10
Edge = namedtuple('Edge', 'cost from_ to')
def bellman_ford(s):
# 始点sから各頂点への最短距離
# O(VE) <- dijkstraならO(E log V)だが負辺は無理
dist = [inf] ... | # bellman_ford : O(V E)
# dijkstra : O(E log V), 負辺は無理
# warshall_floyd : O(V**3)
from collections import namedtuple
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
def solve():
inf = 10 ** 14 + 10
Edge = namedtuple('Edge', 'cost to')
def dfs(v: 'vertex_index, 0-in... | p03634 |
# bellman_ford : O(V E)
# dijkstra : O(E log V), 負辺は無理
# warshall_floyd : O(V**3)
from collections import namedtuple
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
def solve():
inf = 10 ** 14 + 10
Edge = namedtuple('Edge', 'cost to')
def dfs(v: 'vertex_index, 0-in... | # bellman_ford : O(V E)
# dijkstra : O(E log V), 負辺は無理
# warshall_floyd : O(V**3)
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
def solve():
inf = 10 ** 14 + 10
def dfs(v: 'vertex_index, 0-indexed') -> None:
for c, t in e[v]:
if d[t] != inf:
... | p03634 |
def dijkstra(s,n,w,cost):
#始点sから各頂点への最短距離
#n:頂点数, w:辺の数, cost[u][v] : 辺uvのコスト(存在しないときはinf)
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):
... | import sys
sys.setrecursionlimit(10**7)
N = int(eval(input()))
tree = [[] for _ in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
tree[a-1].append([b-1, c])
tree[b-1].append([a-1, c])
Q, K = list(map(int, input().split()))
dist = [-1] * N
def dfs(v, total_cost):
... | p03634 |
N = int(eval(input()))
edges = {}
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
edges[(a, b)] = c
edges[(b, a)] = c
Q, K = list(map(int, input().split()))
xy = []
for _ in range(Q):
xy.append(tuple(map(int, input().split())))
d = [10**14] * (N+1)
d[K] = 0
for n... | import sys
sys.setrecursionlimit(100005)
N = int(eval(input()))
edges = {n: [] for n in range(N+1)}
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
edges[a].append((b, c))
edges[b].append((a, c))
Q, K = list(map(int, input().split()))
xy = []
for _ in range(Q):
xy.app... | p03634 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03634 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03634 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc070/editorial.pdf
・公式解が再帰だったのでやってみる
"""
import sys
# 再帰呼び出しの回数制限(デフォルト1000)
sys.setrecursionlimit(10 ** 9)
from heapq import heappop, heappush
N = int(eval(input()))
nodes = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(ma... | # -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc070/editorial.pdf
・公式解が再帰だったのでやってみる
"""
import sys
# 再帰呼び出しの回数制限(デフォルト1000)
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
nodes = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
# nodes[出... | p03634 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
from heapq import heappop, heappush
# 今回はダイクストラするので、データの持ち方は隣接リスト
N = int(eval(input()))
nodes = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
# nodes[出発ノード](到着ノード, コス... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
# 再帰呼び出しの回数制限(デフォルト1000)
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
nodes = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
# nodes[出発ノード](到着ノード, コスト))
nodes... | p03634 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03634 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03634 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03634 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03634 |
import sys
sys.setrecursionlimit(2147483647)
n=int(eval(input()))
c={}
tree=[[] for _ in range(n)]
for _ in range(n-1):
i,j,k=list(map(int,input().split()))
i-=1
j-=1
tree[i].append(j)
tree[j].append(i)
c[(i,j)]=k
c[(j,i)]=k
result=[]
q,k=list(map(int,input().split())... | import sys
sys.setrecursionlimit(2147483647)
n=int(eval(input()))
c={}
tree=[[] for _ in range(n)]
for _ in range(n-1):
i,j,k=list(map(int,input().split()))
i-=1
j-=1
tree[i].append(j)
tree[j].append(i)
c[(i,j)]=k
c[(j,i)]=k
result=[]
q,k=list(map(int,input().split())... | p03634 |
import sys
sys.setrecursionlimit(2147483647)
n=int(eval(input()))
c={}
tree=[[] for _ in range(n)]
for _ in range(n-1):
i,j,k=list(map(int,input().split()))
i-=1
j-=1
tree[i].append(j)
tree[j].append(i)
c[(i,j)]=k
c[(j,i)]=k
result=[]
q,k=list(map(int,input().split())... | import sys
sys.setrecursionlimit(2147483647)
n=int(eval(input()))
c={}
tree=[set([]) for _ in range(n)]
for _ in range(n-1):
i,j,k=list(map(int,input().split()))
i-=1
j-=1
tree[i].add(j)
tree[j].add(i)
c[(min(i,j),max(i,j))]=k
result=[]
q,k=list(map(int,input().split()))
... | p03634 |
def dijkstra(s, n, cost):
d = [float("inf")] * (n+1)
used = [False] * (n+1)
d[s] = 0
while True:
v = -1
for i in range(1, n+1):
if (not used[i]) and (v == -1):
v = i
elif (not used[i]) and d[i] < d[v]:
v = i
if ... | n = int(eval(input()))
inf = float("inf")
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()))
depth = [inf] * (n+1)
visited = [False] * (n+1)
depth[k] = 0
stack = [k]
... | p03634 |
from functools import reduce
import math
def main():
# 文字列の2進数を数値にする
# '101' → '5'
# 文字列の頭に'0b'をつけてint()にわたす
# binary = int('0b'+'101',0)
# 2進数で立っているbitを数える
# 101(0x5) → 2
# cnt_bit = bin(5).count('1')
# N! を求める
# f = math.factorial(N)
# N の逆元
# N_inv... | from functools import reduce
from collections import deque
import math
def bfs(i,E,N):
q = deque()
q.append(i)
d = [-1]*N
d[i] = 0
while q:
next_node = q.popleft()
for e in E[next_node]:
if d[e[0]] == -1:
d[e[0]] = d[next_node] + e[1] ... | p03634 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.