input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
class UnionFind:
def __init__(self, size):
self.parent = list(range(size))
self.height = [0] * size
self.size = [1] * size
self.component = size
def root(self, index):
if self.parent[index] == index: # 根の場合
return index
rootIndex = self.roo... | N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
fr, to, dist = list(map(int, input().split()))
fr -= 1
to -= 1
edges[fr].append((to, dist))
edges[to].append((fr, -dist))
INF = 10**18
minDist = [INF] * N
for s in range(N):
if minDist[s] < IN... | p03450 |
N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
fr, to, dist = list(map(int, input().split()))
fr -= 1
to -= 1
edges[fr].append((to, dist))
edges[to].append((fr, -dist))
INF = 10**18
minDist = [INF] * N
for s in range(N):
if minDist[s] < IN... | N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
fr, to, dist = list(map(int, input().split()))
fr -= 1
to -= 1
edges[fr].append((to, dist))
edges[to].append((fr, -dist))
def isOk():
visited = [False] * N
INF = 10**18
minDist = [INF]... | p03450 |
#!/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
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/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
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p03450 |
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
q = [list(map(int, input().split())) for i in range(m)]
g = [[] for i in range(n+1)]
for i in range(m):
a, b, c = q[i]
g[a].append((b, c))
g[b].append((a, -c))
people = [-10**10] * (n+1)
flag = 1
for i in range(1... | import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
q = [list(map(int, input().split())) for i in range(m)]
g = [[] for i in range(n+1)]
for i in range(m):
a, b, c = q[i]
g[a].append((b, c))
g[b].append((a, -c))
people = [-10**10] * (n+1)
flag = 1
for i in range(1... | p03450 |
class WeightedUnionFind:
def __init__(self, n):
self.parent = [i for i in range(n + 1)]
self.rank = [0 for _ in range(n + 1)]
self.weight = [0 for _ in range(n + 1)]
def find(self, x):
if self.parent[x] == x:
return x
else:
y = self.find... | class WeightedUnionFind:
def __init__(self, n):
self.parent = [i for i in range(n + 1)]
self.rank = [0 for _ in range(n + 1)]
self.weight = [0 for _ in range(n + 1)]
def find(self, x):
if self.parent[x] == x:
return x
else:
y = self.find... | p03450 |
import sys
sys.setrecursionlimit(300000)
N, M = list(map(int, input().split()))
nl = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
nl[L].append((R, D))
nl[R].append((L, -D))
# print(nl)
seen = [None for _ in range(N + 1)]
def dfs(v, d):
... | N,M = list(map(int,input().split()))
LRD = [list(map(int,input().split())) for _ in [0]*M]
E = [{} for _ in [0]*N]
for L,R,D in LRD:
E[L-1][R-1] = D
E[R-1][L-1] = -D
V = [None]*N
breakFlg = False
for i in range(N):
if V[i]!=None:
continue
V[i] = 0
q = [i]
while q:
... | p03450 |
n, m = list(map(int, input().split()))
vertices = {i: [] for i in range(n)}
for _ in range(m):
l, r, d = list(map(int, input().split()))
vertices[l - 1].append((r - 1, d))
vertices[r - 1].append((l - 1, -d))
def answer():
x = [None] * n
while any(i is None for i in x):
i = x.i... | n, m = list(map(int, input().split()))
vertices = {i: [] for i in range(n)}
for _ in range(m):
l, r, d = list(map(int, input().split()))
vertices[l - 1].append((r - 1, d))
vertices[r - 1].append((l - 1, -d))
def answer():
x = [None] * n
for i in range(n):
if x[i] is not None:
... | p03450 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,m=list(map(int,input().split()))
E=[[] for _ in range(n)]
for _ in range(m):
u,v,w=list(map(int,input().split()))
u-=1; v-=1
E[v].append((... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,m=list(map(int,input().split()))
E=[[] for _ in range(n)]
for _ in range(m):
u,v,w=list(map(int,input().split()))
u-=1; v-=1
E[u].append((... | p03450 |
import queue
n,m = list(map(int,input().split()))
data =[0]
access = [False]*(n+1)
dis = [0]+[" "]*(n)
q = queue.Queue()
for i in range(n):
data.append([])
for i in range(m):
l,r,d = list(map(int,input().split()))
data[l].append((r,d))
data[r].append((l,-d))
for i in range(1,n+1):
... | import queue
n,m = list(map(int,input().split()))
data =[0]
access = [False]*(n+1)
dis = [0]+[" "]*(n)
q = queue.Queue()
for i in range(n):
data.append([])
for i in range(m):
l,r,d = list(map(int,input().split()))
data[l].append((r,d))
data[r].append((l,-d))
for i in range(1,n+1):
... | p03450 |
import queue
n,m = list(map(int,input().split()))
data =[0]
access = [False]*(n+1)
dis = [0]+[" "]*(n)
q = queue.Queue()
for i in range(n):
data.append([])
for i in range(m):
l,r,d = list(map(int,input().split()))
data[l].append((r,d))
data[r].append((l,-d))
for i in range(1,n+1):
... | import queue
n,m = list(map(int,input().split()))
data =[0]
access = [False]*(n+1)
dis = [0]+[" "]*(n)
q = queue.Queue()
for i in range(n):
data.append([])
for i in range(m):
l,r,d = list(map(int,input().split()))
data[l].append((r,d))
data[r].append((l,-d))
for i in range(1,n+1):
... | p03450 |
n, m = list(map(int, input().split()))
par = list(range(n+1))
dis = [0] * (n+1)
def root(x):
if x == par[x]:
return x
r = root(par[x])
dis[x] += dis[par[x]]
par[x] = r
return r
def cost(x):
# xからxの根までのコスト
if x == par[x]:
return 0
return dis[x] + cost(par[x])
# 確かめ用
def unit... | n, m = list(map(int, input().split()))
par = list(range(n+1))
dis = [0] * (n+1)
def root(x):
if x == par[x]:
return x
r = root(par[x])
dis[x] += dis[par[x]]
par[x] = r
return r
def cost(x):
# xからxの根までのコスト
if x == par[x]:
return 0
return dis[x] + cost(par[x])
for _ in range(m... | p03450 |
n, m = list(map(int, input().split()))
par = list(range(n+1))
dis = [0] * (n+1)
def root(x):
if x == par[x]:
return x
r = root(par[x])
dis[x] += dis[par[x]]
par[x] = r
return r
def cost(x):
# xからxの根までのコスト
if x == par[x]:
return 0
return dis[x] + cost(par[x])
for _ in range(m... | n, m = list(map(int, input().split()))
par = list(range(n+1))
dis = [0] * (n+1)
def root(x):
if x == par[x]:
return x
r = root(par[x])
dis[x] += dis[par[x]]
par[x] = r
return r
def cost(x):
# xからxの根までのコスト
if x == par[x]:
return 0
return dis[x] + cost(par[x])
for _ in range(m... | p03450 |
from collections import defaultdict
g = defaultdict(list)
n, m = list(map(int, input().split()))
if m==0:
print('Yes')
exit()
for i in range(m):
l, r, d = list(map(int, input().split()))
g[l].append((r, d))
g[r].append((l, -1*d))
visited = {}
vv = {k:None for k in list(g.keys())}
... | from collections import defaultdict
g = defaultdict(list)
n, m = list(map(int, input().split()))
if m==0:
print('Yes')
exit()
for i in range(m):
l, r, d = list(map(int, input().split()))
g[l].append((r, d))
g[r].append((l, -1*d))
visited = {}
vv = {k:None for k in list(g.keys())}
... | p03450 |
n,m = map(int, input().split())
ml = [[-1 for i in range(n)] for j in range(n)]
for i in range(m):
l,r,d = map(int, input().split())
l -= 1
r -= 1
if ml[l][l] == -1 and ml[r][r] == -1:
ml[l][l] = 0
ml[r][r] = d
elif ml[l][l] != -1 and ml[r][r] == -1:
ml[r][r] = d ... | import sys
n,m = list(map(int, input().split()))
# it watches only end of union
# for i in range(m):
# l,r,d = map(int, input().split())
# if ml[l] == -1 and ml[r] == -1:
# ml[l] = 0
# ml[r] = d
# elif ml[l] != -1 and ml[r] == -1:
# ml[r] = d + ml[l]
# if ml[r] > ... | p03450 |
import sys
def main():
input = sys.stdin.readline
def inputs():
return (int(x) for x in input().split())
N,M = inputs()
E={i:[] for i in range(1,N+1)}
for i in range(M):
L,R,D = inputs()
E[L].append((R,D))
E[R].append((L,-D))
visited = {i: False for i i... | import sys
def main():
input = sys.stdin.readline
def inputs():
return (int(x) for x in input().split())
N,M = inputs()
E={i:[] for i in range(1,N+1)}
for i in range(M):
L,R,D = inputs()
E[L].append((R,D))
E[R].append((L,-D))
visited = {i: False for i i... | p03450 |
from collections import defaultdict, deque
import sys
readline = sys.stdin.buffer.readline
N, M = list(map(int, readline().split()))
dic = defaultdict(list)
par = [i for i in range(N)]
rank = [0]*N
def find(x):
if par[x]==x:
return x
else:
par[x] = find(par[x])
return par[x]
def unit(x,... | from collections import defaultdict, deque
N, M = list(map(int, input().split()))
used = [True]*N
dic = defaultdict(list)
for i in range(M):
l, r, d = list(map(int,input().split()))
l -= 1
r -= 1
used[r] = False
dic[l] += [(r,d)]
dist = [-1]*N
q = deque([])
for i in range(N):
if used[i]:
... | p03450 |
#!/usr/bin/env python3
import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, r... | #!/usr/bin/env python3
import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, r... | p03450 |
#!/usr/bin/env python3
import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, r... | #!/usr/bin/env python3
import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, r... | p03450 |
def solve(n, query):
for l, r, d in query:
if is_same(l, r):
if d != diff(l, r):
return 'No'
else:
unite(l, r, d)
return 'Yes'
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
diff_weight[x] += d... | def solve(n, query):
for l, r, d in query:
if is_same(l, r):
if d != diff(l, r):
return 'No'
else:
unite(l, r, d)
return 'Yes'
def unite(x, y, w):
w += diff_weight[x]-diff_weight[y]
rt_x = find(x)
rt_y = find(y)
if rt_x ==... | p03450 |
from collections import deque
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
graph[l - 1].append([r - 1, d])
graph[r - 1].append([l - 1, -d])
X = [None] * N
def bfs(u):
que = deque([(u, 0)])
X[u] = 0
... | from collections import deque
n, m = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for _ in range(m):
L, R, D = list(map(int, input().split()))
tree[L - 1].append((R - 1, D))
tree[R - 1].append((L - 1, -D))
visited = [None for _ in range(n)]
def bfs(u):
q = deque([[u, 0]])... | p03450 |
import sys
input=sys.stdin.readline
from collections import deque
N,M=list(map(int,input().split()))
if M==0:
print("Yes")
quit()
G=[[] for i in range(N)]
for i in range(M):
l,r,d=list(map(int,input().split()))
G[l-1].append((l-1,r-1,d))
G[r-1].append((r-1,l-1,-d))
x=["a"]*N
y=[1]*N
... | from collections import deque
N,M=list(map(int,input().split()))
if M==0:
print("Yes")
quit()
G=[[] for i in range(N)]
for i in range(M):
l,r,d=list(map(int,input().split()))
G[l-1].append((l-1,r-1,d))
G[r-1].append((r-1,l-1,-d))
x=["a"]*N
y=[1]*N
z=[[0]*N for i in range(N)]
stack=deque... | p03450 |
from collections import deque
N,M=list(map(int,input().split()))
if M==0:
print("Yes")
quit()
G=[[] for i in range(N)]
for i in range(M):
l,r,d=list(map(int,input().split()))
G[l-1].append((l-1,r-1,d))
G[r-1].append((r-1,l-1,-d))
x=["a"]*N
y=[1]*N
z=[[0]*N for i in range(N)]
stack=deque... | #重み付きUnion-Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
wei[x] += wei[par[x]]
par[x] = px
return px
#xの根から距離
def weight(x):
find(x)
return wei[x]
#w[y]=w[x]+wとなるようにxとyを併合
def unite(x,y,w):
w += wei[x]-wei[y... | p03450 |
from sys import stdin
from collections import deque
if __name__ == "__main__":
_in = [_.rstrip() for _ in stdin.readlines()]
N, M = list(map(int,_in[0].split(' '))) # type:list(int)
if M == 0:
TF = 'Yes'
else:
L_R_D_arr = deque([])
for i in range(M):
... | from sys import stdin
def main():
from collections import deque
_in = [_.rstrip() for _ in stdin.readlines()]
N, M = list(map(int,_in[0].split(' '))) # type:list(int)
if M == 0:
TF = 'Yes'
else:
L_R_D_arr = deque([])
for i in range(M):
_ = l... | p03450 |
from collections import deque
inf = 10 ** 10
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
dis = [[inf]*N for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
L -= 1
R -= 1
graph[L].append(R)
graph[R].append(L)
dis[L][R] = D
dis... | from collections import deque
inf = 10 ** 10
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
dis = [[inf]*N for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
L -= 1
R -= 1
graph[L].append(R)
graph[R].append(L)
dis[L][R] = D
dis... | p03450 |
from collections import deque
inf = 10 ** 10
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
dis = [[inf]*N for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
L -= 1
R -= 1
graph[L].append(R)
graph[R].append(L)
dis[L][R] = D
dis... | from collections import deque
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
dis = [["n/a"]*N for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
L -= 1
R -= 1
graph[L].append(R)
graph[R].append(L)
dis[L][R] = D
dis[R][L] = (-1)*... | p03450 |
from collections import deque
import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
dis = [[None]*N for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
L -= 1
R -= 1
graph[L].append(R)
graph[R].append(L)
... | from collections import deque
import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
L -= 1
R -= 1
graph[L].append([R,D])
graph[R].append([L,-D])
data = [None]*N
for... | p03450 |
# -*- coding: utf-8 -*-
### 幅優先探索により矛盾を探す
import sys
from collections import deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,M = list(map(int,readline().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
L,R,D = list(map(int,readl... | # -*- coding: utf-8 -*-
#重み付きUnion-Findによる実装
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
wei[x] += wei[par[x]]
par[x] = px
... | p03450 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | p03450 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from collections import defaultdict
n,m = list(map(int, input().split()))
ns = defaultdict(set)
for _ in range(m):
u,v,c = list(map(int, input().split()))
u -... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from collections import defaultdict
n,m = list(map(int, input().split()))
ns = defaultdict(set)
for _ in range(m):
u,v,c = list(map(int, input().split()))
u -... | p03450 |
def main():
from collections import deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
g = tuple(set() for _ in range(N))
h = [0] * N # 入り次数
for _ in range(M):
L, R, D = list(map(int, input().split()))
L -= 1
R -= 1
... | def main():
from collections import deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
g = tuple(set() for _ in range(N))
h = [0] * N # 入り次数
for _ in range(M):
L, R, D = list(map(int, input().split()))
L -= 1
R -= 1
... | p03450 |
class UnionFindTree:
def __init__(self, size):
self.table = [-1 for _ in range(size)]
def find_root(self, x):
while 0 <= self.table[x]:
x = self.table[x]
return x
def union(self, x, y):
r1 = self.find_root(x)
r2 = self.find_root(y)
... | class UnionFindTree:
def __init__(self, size):
self.parent = list(range(size))
self.dist = [0] * size
def find_root(self, x):
if self.parent[x] == x:
return x, 0
else:
self.parent[x], d = self.find_root(self.parent[x])
self.dist[x] +... | p03450 |
import sys
sys.setrecursionlimit(2147483647)
INF=float('inf')
MOD=10**9+7
input=sys.stdin.readline
n,m=list(map(int,input().split()))
#初期値が0の辞書
from collections import defaultdict
lrd = defaultdict(lambda: [])
yx=[[0]*n for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
... | import sys
sys.setrecursionlimit(2147483647)
INF=float('inf')
MOD=10**9+7
input=sys.stdin.readline
n,m=list(map(int,input().split()))
#初期値が0の辞書
from collections import defaultdict
lrd = defaultdict(lambda: [])
lr=defaultdict(lambda: 0)
for _ in range(m):
l,r,d=list(map(int,input().split()))
... | p03450 |
import sys
sys.setrecursionlimit(2147483647)
INF=10**10
MOD=10**9+7
input=sys.stdin.readline
n,m=list(map(int,input().split()))
#初期値が0の辞書
from collections import defaultdict
lrd = defaultdict(lambda: [])
lr=defaultdict(lambda: 0)
for _ in range(m):
l,r,d=list(map(int,input().split()))
lrd[... | import sys
sys.setrecursionlimit(2147483647)
INF=10**10
MOD=10**9+7
input=sys.stdin.readline
n,m=list(map(int,input().split()))
#初期値が0の辞書
#from collections import defaultdict
#lrd = defaultdict(lambda: [])
lrd=[[] for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
#p... | p03450 |
import sys
sys.setrecursionlimit(2147483647)
INF=10**10
MOD=10**9+7
input=sys.stdin.readline
n,m=list(map(int,input().split()))
#初期値が0の辞書
#from collections import defaultdict
#lrd = defaultdict(lambda: [])
lrd=[[] for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
#p... | import sys
sys.setrecursionlimit(100000)
input=sys.stdin.readline
n,m=list(map(int,input().split()))
lrd=[[] for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
#print("lrd",lrd)
lrd[l-1].append((r-1,-d))
lrd[r-1].append((l-1,+d))
#print(lrd)
def BFD(x):
... | p03450 |
import sys
sys.setrecursionlimit(100000)
input=sys.stdin.readline
n,m=list(map(int,input().split()))
lrd=[[] for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
#print("lrd",lrd)
lrd[l-1].append((r-1,-d))
lrd[r-1].append((l-1,+d))
#print(lrd)
def BFD(x):
... | import sys
sys.setrecursionlimit(100000)
input=sys.stdin.readline
n,m=list(map(int,input().split()))
lrd=[[] for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
lrd[l-1].append((r-1,-d))
lrd[r-1].append((l-1,+d))
def BFD(x):
global checked,answer,lrd
checked... | p03450 |
from collections import deque
import sys
input = sys.stdin.readline
inf = pow(10, 10)
n, m = list(map(int, input().split()))
a = [inf] * n
edge = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
l-=1;r-=1
edge[l].append((r, d))
edge[r].append((l, -d))
... | from collections import deque
import sys
input = sys.stdin.readline
inf = pow(10, 10)
n, m = list(map(int, input().split()))
a = [inf] * n
edge = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
l-=1;r-=1
edge[l].append((r, d))
edge[r].append((l, -d))
... | p03450 |
import sys
from collections import deque
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
Edge = [[] for _ in range(N)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
Edge[l-1].append((r-1, d))
Edge[r-1].append((l-1, -1 * d))... | import sys
from collections import deque
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
E = [[] for _ in range(N)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
E[l-1].append((r - 1, d))
E[r-1].append((l - 1, -d))
Pos... | p03450 |
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
g = [[] for _ in range(n)]
for _ in range(m):
l, r, d = [int(x) for x in input().split()]
l -= 1
r -= 1
g[l].append((r, d))
g[r].append((l, -d))
d = [0] * n
from collections import deque
queue = deque(... | n, m = list(map(int, input().split()))
ed = [[] for _ in range(n)] # グラフ
v = [None] * n
for _ in range(m):
l, r, d = list(map(int, input().split()))
ed[l-1].append((r-1, d)) # l -> r
ed[r-1].append((l-1, -d)) # r -> l
visited = [False] * n # 訪問フラグ（非連結の可能性の為）
def dfs(start):
s = [start]
v[sta... | p03450 |
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
g = [[] for _ in range(n)]
for _ in range(m):
l, r, d = [int(x) for x in input().split()]
g[l - 1].append((r - 1, d))
g[r - 1].append((l - 1, -d))
d = [0] * n
visited = [0] * n
for i in range(n):
if visited... | import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
g = [[] for _ in range(n)]
for _ in range(m):
l, r, d = [int(x) for x in input().split()]
g[l - 1].append((r - 1, d))
g[r - 1].append((l - 1, -d))
d = [None] * n
visited = [0] * n
for i in range(n):
if visi... | p03450 |
import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for _ in range(M)]
graph = [{} for _ in range(N)]
for l, r, d in LRD:
l, r = l - 1, r - 1
graph[l][r] = d
graph[r][l] = -d
visited = [False] * N
def dfs(v, p, d, depths):
if visite... | import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for _ in range(M)]
graph = [{} for _ in range(N)]
for l, r, d in LRD:
l, r = l - 1, r - 1
graph[l][r] = d
graph[r][l] = -d
visited = [False] * N
depths = [-1] * N
def dfs(v, p, d):
... | p03450 |
import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for _ in range(M)]
graph = [{} for _ in range(N)]
for l, r, d in LRD:
l, r = l - 1, r - 1
graph[l][r] = d
graph[r][l] = -d
visited = [False] * N
depths = [-1] * N
def dfs(v, p, d):
... | import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for _ in range(M)]
graph = [{} for _ in range(N)]
for l, r, d in LRD:
l, r = l - 1, r - 1
graph[l][r] = d
graph[r][l] = -d
visited = [False] * N
depths = [0] * N
def dfs(v):
q = [... | p03450 |
# coding=utf-8
line = input().split(" ")
N = int(line[0])
M = int(line[1])
if M==0:
print("Yes")
exit()
l = []
for _ in range(M):
line = input().split(" ")
l.append((
int(line[0])-1
,int(line[1])-1
,int(line[2])
))
l.sort()
o = l[0][0]
for i in range(M)... | # -*- coding: utf-8 -*-
class WeightedUnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# 根への距離を管理
self.weight = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
... | p03450 |
from collections import deque
from collections import defaultdict
N,M=list(map(int,input().split()))
nl=[ [] for i in range(N+1) ]
cost={}
for i in range(M):
L,R,D=list(map(int,input().split()))
if i==0:start=L
nl[L].append(R)
nl[R].append(L)
cost[(L,R)]=D
cost[(R,L)]=-D
d=[ None for i in rang... | from collections import deque
from collections import defaultdict
N,M=list(map(int,input().split()))
nl=[ [] for i in range(N+1) ]
cost={}
for i in range(M):
L,R,D=list(map(int,input().split()))
if i==0:start=L
nl[L].append(R)
nl[R].append(L)
cost[(L,R)]=D
cost[(R,L)]=-D
d=[ None for i in rang... | p03450 |
class WeightedUnionFind:
def __init__(self, node:int) -> None:
self.n = node
self.par = [i for i in range(self.n)]
self.rank = [0 for i in range(self.n)]
self.diff_weight = [0 for i in range(self.n)]
# ノードxのルートを求める
def find(self, x:int) -> int:
if x ... | from sys import stdin
input = stdin.readline
class WeightedUnionFind:
def __init__(self, node:int) -> None:
self.n = node
self.par = [i for i in range(self.n)]
self.rank = [0 for i in range(self.n)]
self.diff_weight = [0 for i in range(self.n)]
# ノードxのルートを求める
... | p03450 |
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... | 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... | p03450 |
N, M = list(map(int,input().split()))
L = [0] * M
R = [0] * M
D = [0] * M
for i in range(M):
L[i],R[i],D[i] = list(map(int,input().split()))
# print(L[i],R[i],D[i])
leftside = 0
cand = set()
for i in range(M):
cand.add(L[i])
for i in range(M):
if R[i] in cand:
cand.remove(R[i])
res = True
if M == ... | NOT_VISIT = 10**20
N, M = list(map(int,input().split()))
graph = [[] for i in range(N)]
for i in range(M):
L, R, D = list(map(int,input().split()))
graph[L-1].append((R-1,D))
graph[R-1].append((L-1,-D))
visited = [NOT_VISIT for i in range(N)]
def dfs(start):
global graph, visited
if visited[start... | p03450 |
import sys
sys.setrecursionlimit(100000000)
N,M = list(map(int,input().split()))
e = [[] for i in range(N)]
t = 0
a = []
for i in range(M):
r,l,d = list(map(int,input().split()))
e[r-1].append([l-1,d])
e[l-1].append([r-1,-d])
a.append(r-1)
a.append(l-1)
t = r-1
col = [ float("inf"... | import sys
sys.setrecursionlimit(100000000)
def main():
N,M = list(map(int,input().split()))
e = [[] for i in range(N)]
t = 0
a = []
for i in range(M):
r,l,d = list(map(int,input().split()))
e[r-1].append([l-1,d])
e[l-1].append([r-1,-d])
a.append(r-1)
... | p03450 |
n,m=list(map(int,input().split()))
lrd=[list(map(int,input().split())) for _ in range(m)]
g=[[] for _ in range(n)]
for l,r,d in lrd:
g[l-1].append([d,r-1])
g[r-1].append([-d,l-1])
from collections import deque
no_seen=set(range(n))
inf=float('inf')
dst=[inf]*n
while no_seen:
todo=deque([[0,no_seen.po... | n,m=list(map(int,input().split()))
lrd=[list(map(int,input().split())) for _ in range(m)]
g=[[] for _ in range(n)]
for l,r,d in lrd:
g[l-1].append([d,r-1])
g[r-1].append([-d,l-1])
no_seen=set(range(n))
inf=float('inf')
dst=[inf]*n
while no_seen:
todo=[[0,no_seen.pop()]]
#print(todo)
while todo:
... | p03450 |
import sys
class UnionFind():
def __init__(self, n):
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | import sys
sys.setrecursionlimit(10 ** 6)
def dfs(p):
result = True
for np, D in edge[p]:
if pos[np] is None:
pos[np] = pos[p] + D
result &= dfs(np)
else:
if pos[p] + D != pos[np]:
result &= False
return result
N, M = li... | p03450 |
# coding:utf-8
import sys
input = sys.stdin.readline
INF = float('inf')
def inpl(): return list(map(int, input().split()))
def solve(N, M, info):
distance = [[None] * N for _ in range(N)]
for i in range(N):
distance[i][i] = 0
for L, R, D in info:
distance[L][R] = D
... | # coding:utf-8
import sys
input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
# ---
class UnionFind:
__slots__ = ['nodes', 'weight']
def __init__(self, size: int) -> None:
self.nodes = [-1] * size
self.weight = [0] * size
# 検索
def fi... | p03450 |
import sys
input = sys.stdin.readline
def main():
n, m = list(map(int, input().split()))
F = [[] for _ in range(n)]
lrd = [list(map(int, input().split())) for _ in range(m)]
for _ in range(2):
for i in range(m):
l, r, d = lrd[i]
l -= 1
r -= 1
for nr, nd in F[l]:
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
for _ in range(m):
l, r, d = list(map(int, input().split()))
l -= 1
r -= 1
G[l].append((r, d))
G[r].append((l, -d))
dist = [float("inf")]*n
def dfs(v):
for nv, ... | p03450 |
"""from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,M=list(map(int,input().split()))
LRD=[list(map(int,input().split())) for i in range(M)]
data=[[] for i in range(N+1)]
for m,(l,r,d) in enumerate(LRD):
data[l].appe... | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,M=list(map(int,input().split()))
LRD=[list(map(int,input().split())) for i in range(M)]
data=[[] for i in range(N+1)]
for m,(l,r,d) in enumerate(LRD):
data[l].appe... | p03450 |
class WeightedUnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# 根への距離を管理
self.weight = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
y = self.find(self.... | def main():
import sys
input = sys.stdin.readline
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
wei[x] += wei[par[x]]
par[x] = px
return px
def weight(x):
find(x)
return wei[x]
... | p03450 |
import sys
from heapq import heapify,heappop,heappush,heapreplace
read=sys.stdin.read
readline=sys.stdin.readline
def main():
n,m,*lrd=list(map(int,read().split()))
hp=[]
for l,r,d in zip(*[iter(lrd)]*3):
if l>r:
hp.append((r,l,-d))
else:
hp.append((l,r,d))
heapify(hp)
if ... | import sys
sys.setrecursionlimit(10**9)
read=sys.stdin.read
class Unionfind():
def __init__(self,n):
self.parents=[-1]*n
self.dist=[0]*n
def find(self,x):
if self.parents[x]<0:
return self.dist[x],x
else:
tmp=self.find(self.parents[x])
... | p03450 |
import sys
sys.setrecursionlimit(10**9)
read=sys.stdin.read
class Unionfind():
def __init__(self,n):
self.parents=[-1]*n
self.dist=[0]*n
def find(self,x):
if self.parents[x]<0:
return x,self.dist[x]
else:
tmp=self.find(self.parents[x])
... | import sys
sys.setrecursionlimit(10**9)
read=sys.stdin.read
class Unionfind():
def __init__(self,n):
self.parents=[-1]*n
self.dist=[0]*n
def find(self,x):
if self.parents[x]<0:
return self.dist[x],x
else:
tmp=self.find(self.parents[x])
... | p03450 |
import sys
input = sys.stdin.readline
inf = float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return list(map(int, input().split()))
def MF(): return list(map(float, input().split()))
def MI_(): return list(map(INT_, input().split()))
def LI(): return list(MI())
def LI_(... | import sys
input = sys.stdin.readline
inf = float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return list(map(int, input().split()))
def MF(): return list(map(float, input().split()))
def MI_(): return list(map(INT_, input().split()))
def LI(): return list(MI())
def LI_(... | p03450 |
import sys
sys.setrecursionlimit(10**5)
n, m = [int(i) for i in input().split(" ")]
par = [i for i in range(0, n + 1)]
d2p = [0 for i in range(0, n + 1)]
def root(x):
global par
global d2p
if par[x] == x:
return (x, 0)
else:
r = root(par[x])
par[x] = r[0]
... | import sys
sys.setrecursionlimit(10**5)
n, m = [int(i) for i in input().split(" ")]
par = [i for i in range(0, n + 1)]
d2p = [0 for i in range(0, n + 1)]
def d2r(x):
global par
global d2p
k = x
s = 0
while k != par[k]:
s += d2p[k]
k = par[k]
return s
def roo... | p03450 |
import sys
import queue
input = sys.stdin.readline
INF=float('inf')
def solve():
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(m)]
d=[INF]*n
nbr=[[] for _ in range(n)]
used=[False]*m
for i in range(m):
nbr[l[i][0]-1].append([l[i][0]-... | def solve():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
INF=float('inf')
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(m)]
d=[INF]*n
nbr=[[] for _ in range(n)]
used=[False]*m
for x in l:
x[0]-=1
... | p03450 |
N, M = list(map(int, input().split()))
LRD = [tuple(map(int, input().split())) for i in range(M)]
class unionFind:
parent = []
def __init__(self, N):
self.parent = [i for i in range(N)]
self.weight = [0]*N
def root(self, x):
if self.parent[x] == x:
return... | class unionFind:
parent = []
def __init__(self, N):
self.parent = [i for i in range(N)]
self.weight = [0]*N
def root(self, x):
if self.parent[x] == x:
return(x)
else:
p = self.root(self.parent[x])
self.weight[x] += self.weight... | p03450 |
def sub(a, b, n):
r = a[:]
for i in range(len(b)):
r[i] -= b[i] * n
return r
def mult(a, n):
r = a[:]
for i in range(len(a)):
r[i] *= n
return r
def pm(matr):
return ""
def rref(matr):
if len(matr) == 0 or len(matr[0]) == 0:
return matr
pivotCt = 0
for d in range(max(len(matr), len... | n, m = list(map(int, input().split()))
inf = 10**10
G = [{} for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
G[l-1][r-1] = d
G[r-1][l-1] = -d
V = [False for i in range(n)]
D = [inf for i in range(n)]
for i in range(n):
if V[i]:
continue
Q = [i]
... | p03450 |
from queue import Queue
import sys
inf = float("inf")
N, M = list(map(int, input().split()))
to = [[] for x in range(N+1)]
cost = [[] for x in range(N+1)]
value = [inf for x in range(N+1)]
for i in range(M):
l, r, d = list(map(int, input().split()))
to[l].append(r)
cost[l].append(d)
to[r]... | from queue import Queue
import sys
inf = float("inf")
N, M = list(map(int, input().split()))
dist = [[] for x in range(N+1)]
value = [inf for x in range(N+1)]
for i in range(M):
l, r, d = list(map(int, input().split()))
dist[l].append((r, d))
dist[r].append((l, -d))
for i in range(1, N+1):
... | p03450 |
n, m = list(map(int, input().split()))
lrd = []
MAX = 999999
p = [[] for _ in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
lrd.append([l-1, r-1, d, 0])
p[l-1].append(i)
p[r-1].append(i)
if m <= 1:
print('Yes')
exit()
a = [MAX for _ in range(n)]
a[... | n, m = list(map(int, input().split()))
lrd = []
MAX = 999999
p = [[] for _ in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
lrd.append([l-1, r-1, d, 0])
p[l-1].append(i)
p[r-1].append(i)
if m <= 1:
print('Yes')
exit()
a = [MAX for _ in range(n)]
... | p03450 |
def main():
n, m = list(map(int, input().split()))
g = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
g[l - 1].append((r - 1, d))
g[r - 1].append((l - 1, -d))
dis = [0] * n
visited = [False] * n
stack = list(range(n))
whi... | def main():
n, m = list(map(int, input().split()))
g = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
g[l - 1].append((r - 1, d))
g[r - 1].append((l - 1, -d))
dis = [0] * n
visited = [False] * n
for i in range(n):
if ... | p03450 |
import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, sys.stdin.readline().split()))
g[l - 1].append((r - 1, d))
g[r - 1].append((l - 1, -d))
dis = [0] * n
visited = [False... | import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
deg = [0] * n
lines = sys.stdin.read().splitlines()
for line in lines:
l, r, d = list(map(int, line.split()))
g[l - 1].append((r - 1, d))
deg[r - 1] += 1
di... | p03450 |
import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
deg = [0] * n
lines = sys.stdin.read().splitlines()
for line in lines:
l, r, d = list(map(int, line.split()))
g[l - 1].append((r - 1, d))
deg[r - 1] += 1
di... | import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
deg = [0] * n
for i in range(m):
l, r, d = list(map(int, sys.stdin.readline().split()))
g[l - 1].append((r - 1, d))
deg[r - 1] += 1
dis = [-1] * n
for i in ... | p03450 |
N,M = list(map(int,input().split()))
num = [0] * N
far = [0] * N
RD = []
tps = []
p = []
for i in range(N):
RD.append([])
p.append(set([i]))
for i in range(M):
L,R,D = list(map(int,input().split()))
num[R-1] += 1
RD[L-1].append([R-1,D])
Q = []
for i in range(N):
if... |
N,M = list(map(int,input().split()))
point = ["x"] * N
lis = []
notend = set([])
for i in range(N):
lis.append([])
notend = notend | set([i])
for i in range(M):
L,R,D = list(map(int,input().split()))
lis[L-1].append([R-1,D])
lis[R-1].append([L-1,-1 * D])
ans = "Yes"
Q... | p03450 |
import heapq
n, m = list(map(int, input().split()))
if m == 0:
print('Yes')
exit()
lrd = [list(map(int, input().split())) for _ in range(m)]
lrd.sort()
di = {i:'?' for i in range(n+1)}
di[lrd[0][0]] = 0
while lrd:
l, r, d = lrd.pop(0)
if di[l] == '?' and di[r] == '?':
lrd += [[l, ... |
import sys
sys.setrecursionlimit(10**5)
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
self.weight = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
r = ... | p03450 |
import sys
sys.setrecursionlimit(10**5)
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
self.weight = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
r = ... | import sys
sys.setrecursionlimit(10**5)
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
self.weight = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
r = se... | p03450 |
I=lambda:list(map(int,input().split()))
n,m=I()
r=list(range(n))
y=[[] for i in r]
z=[None for i in r]
for _ in [0]*m:
i,j,k=I()
y[i-1]+=[[j-1, k]]
y[j-1]+=[[i-1,-k]]
for i in r:
if z[i]==None:
z[i]=0
q=[i]
while q:
p=q.pop()
for j,k in y[p]:
if z[j]==None:
... | I=lambda:list(map(int,input().split()))
n,m=I()
r=list(range(n))
y=[[] for i in r]
z=[None for i in r]
for _ in [0]*m:
i,j,k=I()
y[i-1]+=[[j-1, k]]
y[j-1]+=[[i-1,-k]]
for i in r:
if z[i]==None:
z[i]=0
q=[i]
while q:
p=q.pop()
for j,k in y[p]:
if z[j]==None:
q+... | p03450 |
#http://at274.hatenablog.com/entry/2018/02/03/140504
#重み付きUnion-Find木
class WeightedUnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# 根への距離を管理
self.weight = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] =... | #http://at274.hatenablog.com/entry/2018/02/03/140504
#重み付きUnion-Find木
class WeightedUnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# 根への距離を管理
self.weight = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] =... | p03450 |
from collections import deque
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
graph[L-1].append([R-1,D])
graph[R-1].append([L-1,-D])
#print(graph)
x = [None for i in range(N)]
def f():
for i in range(N):
... | from collections import deque
N,M = list(map(int,input().split()))
graph = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
graph[L-1].append([R-1,D])
graph[R-1].append([L-1,-D])
x = [None for i in range(N)]
def f():
for i in range(N):
if x[i] ... | p03450 |
import sys
sys.setrecursionlimit(10**5+5)
n,m=list(map(int,input().split()))
graph=[[] for i in range(n)]
for i in range(m):
l,r,d=list(map(int,input().split()))
graph[r-1].append((l-1,-d))
graph[l-1].append((r-1,d))
INF=10**9
x_list=[INF]*n
def dfs(x):
for i in graph[x]:
if x_list[i... | import sys
n,m=list(map(int,input().split()))
graph=[[] for i in range(n)]
for i in range(m):
l,r,d=list(map(int,input().split()))
graph[r-1].append((l-1,-d))
graph[l-1].append((r-1,d))
INF=10**9
x_list=[INF]*n
stack=[]
for i in range(n):
if x_list[i]==INF:
x_list[i]=0
stack... | p03450 |
def solve():
n, m = list(map(int, input().split()))
edge = {v:[] for v in range(1,n+1)}
dist = {}
for i in range(m):
l, r, d = list(map(int, input().split()))
edge[l].append(r)
edge[r].append(l)
dist[l,r] = d
dist[r,l] = -d
return "Yes" if ok(edge, d... | def solve():
n, m = list(map(int, input().split()))
edge = {v:[] for v in range(1,n+1)}
dist = {}
for i in range(m):
l, r, d = list(map(int, input().split()))
edge[l].append(r)
edge[r].append(l)
dist[l,r] = d
dist[r,l] = -d
return "Yes" if ok(edge, d... | p03450 |
import collections
n, m = list(map(int, input().split()))
es = [collections.deque() for _ in range(n)]
for _ in range(m):
l, r, d = list(map(int, input().split()))
l -= 1
r -= 1
es[l].append((l, r, d))
es[r].append((r, l, -d))
visited = [False for _ in range(n)]
for i in range(n):
... | import collections
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
es = [collections.deque() for _ in range(n)]
for _ in range(m):
l, r, d = list(map(int, input().split()))
l -= 1
r -= 1
es[l].append((l, r, d))
es[r].append((r, l, -d))
visited = [False] ... | p03450 |
from collections import deque
import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
adj = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
adj[L].append((R, D))
adj[R].append((L, -D))
seen = [... | from collections import deque
import sys
import time
input = sys.stdin.readline
def main():
t1 = time.time()
N, M = list(map(int, input().split()))
adj = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
adj[L].append((R, D))
a... | p03450 |
from collections import deque, defaultdict
import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
adj = defaultdict(lambda: [])
for _ in range(M):
L, R, D = list(map(int, input().split()))
adj[L].append((R, D))
adj[R].append((L, -D))
... | from collections import deque, defaultdict
import sys
input = sys.stdin.readline
def main():
inf = 10 ** 10
N, M = list(map(int, input().split()))
x = [inf] * (N + 1)
adj = defaultdict(lambda: [])
for _ in range(M):
L, R, D = list(map(int, input().split()))
adj[L].appen... | p03450 |
N,M=list(map(int,input().split()))
if M==0:
print("Yes")
exit(0)
INF=10**9+1
dist=[INF]*N
from collections import deque
info=deque()
for i in range(M):
L,R,d=list(map(int,input().split()))
L,R=L-1,R-1
info.append([L,R,d])
L,R,d=info.popleft()
dist[L]=0
dist[R]=d
while info:
L,R,d=info.... | # 人を頂点と見なしたグラフを作る。有向で、逆向きの場合は正負を反転させて辺を張る
# 頂点からの距離を記録し、一致しない箇所があればNG。
# 全ての辺を通るまで続ける。
# 辺の情報を[{0から行ける頂点},{1から行ける頂点},...]で管理する
# 親には進まないようにしてDFSする
N,M = list(map(int,input().split()))
E = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
E[L-1].append([R-1,D])
E[R-1].app... | p03450 |
# 人を頂点と見なしたグラフを作る。有向で、逆向きの場合は正負を反転させて辺を張る
# 頂点からの距離を記録し、一致しない箇所があればNG。
# 全ての辺を通るまで続ける。
# 辺の情報を[{0から行ける頂点},{1から行ける頂点},...]で管理する
# 親には進まないようにしてDFSする
N,M = list(map(int,input().split()))
E = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
E[L-1].append([R-1,D])
E[R-1].app... | # 人を頂点と見なしたグラフを作る。有向で、逆向きの場合は正負を反転させて辺を張る
# 頂点からの距離を記録し、一致しない箇所があればNG。
# 全ての辺を通るまで続ける。
# 辺の情報を[{0から行ける頂点},{1から行ける頂点},...]で管理する
# 親には進まないようにしてDFSする
N,M = list(map(int,input().split()))
E = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
E[L-1].append([R-1,D])
E[R-1].app... | p03450 |
# 人を頂点と見なしたグラフを作る。有向で、逆向きの場合は正負を反転させて辺を張る
# 頂点からの距離を記録し、一致しない箇所があればNG。
# 全ての辺を通るまで続ける。
# 辺の情報を[{0から行ける頂点},{1から行ける頂点},...]で管理する
# 親には進まないようにしてDFSする
N,M = list(map(int,input().split()))
E = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
E[L-1].append([R-1,D])
E[R-1].app... | # 人を頂点と見なしたグラフを作る。有向で、逆向きの場合は正負を反転させて辺を張る
# 頂点からの距離を記録し、一致しない箇所があればNG。
# 全ての辺を通るまで続ける。
# 辺の情報を[{0から行ける頂点},{1から行ける頂点},...]で管理する
# 親には進まないようにしてDFSする
N,M = list(map(int,input().split()))
E = [[] for i in range(N)]
for i in range(M):
L,R,D = list(map(int,input().split()))
E[L-1].append([R-1,D])
E[R-1].app... | p03450 |
import sys
sys.setrecursionlimit(65536)
N,M=list(map(int, input().split()))
path=[[] for _ in range(N+1)]
for _ in range(M):
l,r,d=list(map(int, input().split()))
path[l].append((r,+d))
path[r].append((l,-d))
cost=[None for _ in range(N+1)]
def dfs(i, c):
if cost[i] is None:
cost[i] = c
fo... | import sys
sys.setrecursionlimit(1145141919)
N,M=list(map(int, input().split()))
path=[[] for _ in range(N+1)]
for _ in range(M):
l,r,d=list(map(int, input().split()))
path[l].append((r,+d))
path[r].append((l,-d))
cost=[None for _ in range(N+1)]
def walk(i, c):
if cost[i] is None:
cost[i] = c... | p03450 |
from queue import Queue
n,m = list(map(int,input().split()))
e = []
for i in range(n+1):
e.append([])
for i in range(m):
l,r,d = list(map(int,input().split()))
e[l].append([r,d])
e[r].append([l,-d])
#print(e)
c = [0]*(n+1) #チェック用
p = [0]*(n+1) #位置
flag = True
k = 1
while k < n:
if c[k] ... | n,m = list(map(int,input().split()))
c = list(range(n+1)) #色
a = [] #色ごとのリスト
for i in range(n+1):
a.append([i])
b = [1]*(n+1) #色ごとの頂点数
p = [0]*(n+1) #位置
#print(a)
for i in range(m):
x,y,d = list(map(int,input().split()))
u = c[x]
v = c[y]
if b[u] < b[v]:
x,y = y,x
u,v = v,u
d = -d
... | p03450 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, *LRD = list(map(int, read().split()))
G = [[] for _ in range(N)]
for l, r, d in zip(... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, *LRD = list(map(int, read().split()))
G = [[] for _ in range(N)]
for l, r, d in zip(... | p03450 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, *LRD = list(map(int, read().split()))
G = [[] for _ in range(N)]
for l, r, d in zip(... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, *LRD = list(map(int, read().split()))
G = [[] for _ in range(N)]
for l, r, d in zip(... | p03450 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class UnionFindWeighted:
# Reference: https://note.nkmk.me/python-union-find/
def __init__(self, n):
... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class UnionFindWeighted:
# Reference: https://note.nkmk.me/python-union-find/
def __init__(self, n):
... | p03450 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class UnionFindWeighted:
# Reference: https://note.nkmk.me/python-union-find/
def __init__(self, n):
... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class UnionFindWeighted:
# Reference:
# https://note.nkmk.me/python-union-find/
# https://at274.hatenabl... | p03450 |
from collections import deque
n,m=list(map(int,input().split()))
G=[[] for i in range(n)]
for i in range(m):
l,r,d=list(map(int,input().split()))
G[l-1].append([r-1,d])
G[r-1].append([l-1,-d])
for i in range(n):
dist=[None]*n
q=deque()
if dist[i]==None:
dist[i]=0
q.ap... | from collections import deque
n,m=list(map(int,input().split()))
G=[[] for i in range(n)]
dist=[None]*n
for i in range(m):
l,r,d=list(map(int,input().split()))
G[l-1].append([r-1,d])
G[r-1].append([l-1,-d])
for i in range(n):
q=deque()
if dist[i]==None:
dist[i]=0
q.appe... | p03450 |
n,m=list(map(int,input().split()))
G=[[] for i in range(n)]
for i in range(m):
l,r,d=list(map(int,input().split()))
G[l-1].append([r-1,d])
G[r-1].append([l-1,-d])
dist=[None]*n
from collections import deque
for i in range(n):
q=deque()
if dist[i]==None:
dist[i]=0
q.append(i)
while q:
... | n,m=list(map(int,input().split()))
lrd=[tuple(map(int,input().split())) for i in range(m)]
class WeightedUnionFind:
def __init__(self,n):
self.parent = [i for i in range(n)]
self.rank = [0] * n
self.count = 0
self.weight = [0] * n
def root(self,a):
if self.parent[a] == a:
retur... | p03450 |
import collections
from collections import deque
import sys
input = sys.stdin.readline
def tree(s):
flag=True
INF=-10**9
dis = [INF for i in range(n)]
dis[s]=0
def bfs():
d = deque()
d.append(s)
while len(d):
x = d.popleft()
for i,j in ... | import collections
from collections import deque
import sys
input = sys.stdin.readline
def bfs(s):
d = deque()
d.append(s)
dis[s]=0
flag=True
while len(d):
x = d.popleft()
for i,j in vec[x]:
if dis[i] == INF:
dis[i]=dis[x]+j
... | p03450 |
n, m = list(map(int, input().split()))
graph = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
graph[l-1].append([r-1, d])
graph[r-1].append([l-1, -d])
def func():
visited = [False for i in range(n)]
x = [None for i in range(n)]
for i in ran... | n, m = list(map(int, input().split()))
graph = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
graph[l-1].append([r-1, d])
graph[r-1].append([l-1, -d])
def func():
x = [None for i in range(n)]
for i in range(n):
if x[i] == None:
... | p03450 |
N,M = list(map(int,input().split()))
info = [list(map(int,input().split())) for i in range(M)]
nodes = [i for i in range(N)]
rank = [0]*N
diff_weight = [0]*N
def root(x):
if nodes[x] == x:
return x
root_x = root(nodes[x])
diff_weight[x] += diff_weight[nodes[x]]
nodes[x] = root_x
... | N,M = list(map(int,input().split()))
info = [list(map(int,input().split())) for i in range(M)]
nodes = [-1]*N
diff_weight = [0]*N
def root(x):
if nodes[x] < 0:
return x
root_x = root(nodes[x])
diff_weight[x] += diff_weight[nodes[x]]
nodes[x] = root_x
return root_x
def weight(x... | p03450 |
N,M = list(map(int,input().split()))
info = [list(map(int,input().split())) for i in range(M)]
nodes = [-1]*N
diff_weight = [0]*N
def root(x):
if nodes[x] < 0:
return x
root_x = root(nodes[x])
diff_weight[x] += diff_weight[nodes[x]]
nodes[x] = root_x
return root_x
def weight(x... | def prepare(n):
global nodes,diff_weight
# ノードは-1で初期化, Nは頂点数
nodes = [-1]*n
# 差分重みは0で初期化, Nは頂点数
diff_weight = [0]*n
# 差分重みの累積和をとることでxの重みが分かる
def weight(x):
# xの重みを知りたいので経路圧縮
root(x)
return diff_weight[x]
# xからyへの重み
def diff(x,y):
return weight(y) - weight(x)
# x,y... | p03450 |
class Unionfind:
__slots__ = ["nodes","diff_weight"]
def __init__(self, n):
self.nodes = [-1]*n
self.diff_weight = [0]*n
def root(self, x):
if self.nodes[x] < 0:
return x
else:
root_x = self.root(self.nodes[x])
self.diff_weigh... | import sys
input = sys.stdin.readline
class Unionfind:
__slots__ = ["nodes","diff_weight"]
def __init__(self, n):
self.nodes = [-1]*n
self.diff_weight = [0]*n
def root(self, x):
if self.nodes[x] < 0:
return x
else:
root_x = self.root(s... | p03450 |
import sys
input = sys.stdin.readline
class WeightedUnionfind:
__slots__ = ['nodes','diff_weight']
def __init__(self, n):
self.nodes = [-1]*n
self.diff_weight = [0]*n
def root(self, x):
if self.nodes[x] < 0:
return x
else:
root_x = s... | import sys
input = sys.stdin.readline
class WeightedUnionfind:
__slots__ = ['nodes','diff_weight']
def __init__(self, n):
self.nodes = [-1]*n
self.diff_weight = [0]*n
def root(self, x):
if self.nodes[x] < 0:
return x
else:
root_x = s... | p03450 |
#PyPy遅え
import sys
sys.setrecursionlimit(400000000)
inf=1000000000000000000
n,m=list(map(int,input().split()))
x=[inf]*n
#まだ訪問してなければTrue
check=[True]*n
#どこと関係があるかを記録する(maybe right)
lrd=[[] for i in range(n)]
for i in range(m):
l,r,d=list(map(int,input().split()))
l-=1
r-=1
lrd[l].append((r... | #PyPy遅え
import sys
sys.setrecursionlimit(100000000)
inf=1000000000000000000
n,m=list(map(int,input().split()))
x=[inf]*n
#まだ訪問してなければTrue
check=[True]*n
#どこと関係があるかを記録する(maybe right)
lrd=[[] for i in range(n)]
for i in range(m):
l,r,d=list(map(int,input().split()))
l-=1
r-=1
lrd[l].append((r... | p03450 |
N, M = list(map(int, input().split()))
e_IN = [[] for _ in range(N+1)]
e_OUT = [[] for _ in range(N+1)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
e_OUT[l].append((r, d))
e_IN[r].append((l, d))
posx = [-1] * (N + 1)
def dfs(v):
# 0<=x<=10**9に注意
node = [v]
p... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, readline().split()))
e_IN = [[] for _ in range(N+1)]
e_OUT = [[] for _ in range(N+1)]
for _ in range(M):
l, r, d = list(map(int, read... | p03450 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, readline().split()))
e_IN = [[] for _ in range(N+1)]
e_OUT = [[] for _ in range(N+1)]
for _ in range(M):
l, r, d = list(map(int, read... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N + 1)]
for _ in range(M):
s, t, d = list(map(int, input().split()))
edge[s].append((t, d))
edge[t].append((s, -d))
dist = [None] * (N + 1)
def isOK(... | p03450 |
n, m = list(map(int, input().split()))
inf = 10**10
G = [{} for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
G[l-1][r-1] = d
G[r-1][l-1] = -d
V = [False for i in range(n)]
D = [inf for i in range(n)]
for i in range(n):
if V[i]:
continue
Q = [i]
... | n, m = list(map(int, input().split()))
inf = 10**10
# G[i][j] = iからjへの距離
G = [{} for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
G[l-1][r-1] = d
G[r-1][l-1] = -d
# D[j] = jの属する連結成分のトップからjへの距離
D = [inf for i in range(n)]
# まだ探索していないiをトップとして探索する
for i in range(n):
... | p03450 |
import math
n = int(eval(input()))
for i in range(n):
xa, ya, ra, xb, yb, rb = list(map(float, input().split()))
d = math.sqrt((xb - xa) ** 2 + (yb - ya) ** 2)
if d < ra - rb:
print((2))
elif d < rb - ra:
print((-2))
elif abs(rb - ra) <= d and d <= ra + rb:
print(... | import math
n = int(eval(input()))
for i in range(n):
xa, ya, ra, xb, yb, rb = list(map(float, input().split()))
d = math.sqrt((xb - xa) ** 2 + (yb - ya) ** 2)
if d < ra - rb:
print((2))
elif d < rb - ra:
print((-2))
elif d <= ra + rb:
print((1))
else:
... | p00023 |
A, B, C, D, E, F = list(map(int, input().split()))
c = []
ans_list = []
for i in range(1, F // (100 * A) + 1):
for j in range(F // (100 * B) + 1):
a = 100 * A * i + 100 * B * j
if a > F:
break
for k in range((F - a) // C + 1):
for l in range((F - a) // D + ... | A, B, C, D, E, F = list(map(int, input().split()))
ans = [100 * A, 0]
c = 0
for i in range(1, F // (100 * A) + 1):
for j in range(F // (100 * B) + 1):
a = 100 * A * i + 100 * B * j
if a > F:
break
for k in range((F - a) // C + 1):
for l in range((F - a) // ... | p03599 |
A, B, C, D, E, F = list(map(int, input().split()))
ans = [100 * A, 0]
c = 0
for i in range(1, F // (100 * A) + 1):
for j in range((F - 100 * A * i) // (100 * B) + 1):
a = 100 * A * i + 100 * B * j
if a > F:
break
for k in range((F - a) // C + 1):
for l in r... | A, B, C, D, E, F = list(map(int, input().split()))
ans = [100 * A, 0]
c = 0
for i in range(1, F // (100 * A) + 1):
for j in range((F - 100 * A * i) // (100 * B) + 1):
a = 100 * A * i + 100 * B * j
for k in range((F - a) // C + 1):
for l in range((F - a - C * k) // D + 1):
... | p03599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.