input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import heapq
INF = 10 ** 17
def dijkstra(s):
#始点sから各頂点への最短距離
d = [INF] * (n+1)
used = [True] * (n+1) #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in graph_a[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
minedge = heapq.heappop(edgelist)
... | import heapq
INF = 10**18
def dijkstra(s, edge, n):
d = [INF] * n
used = [True] * n #True: not used
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
minedge = heapq.heappop(edgelist)
if not used[mined... | p03305 |
n, m, s, t = list(map(int, input().split()))
yen_edge = [[] for _ in range(n)]
snuke_edge = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
yen_edge[u - 1].append([v - 1, a])
yen_edge[v - 1].append([u - 1, a])
snuke_edge[u - 1].append([v - 1, b])
snuke_edge[v - 1]... | import heapq, sys
def input():
return sys.stdin.readline()[:-1]
n, m, s, t = list(map(int, input().split()))
yen_edge = [[] for _ in range(n)]
snuke_edge = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
yen_edge[u - 1].append([v - 1, a])
yen_edge[v - 1].appe... | p03305 |
import heapq, sys
def input():
return sys.stdin.readline()[:-1]
n, m, s, t = list(map(int, input().split()))
yen_edge = [[] for _ in range(n)]
snuke_edge = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
yen_edge[u - 1].append([v - 1, a])
yen_edge[v - 1].appe... | import heapq, sys
n, m, s, t = list(map(int, input().split()))
yen_edge = [[] for _ in range(n)]
snuke_edge = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
yen_edge[u - 1].append([v - 1, a])
yen_edge[v - 1].append([u - 1, a])
snuke_edge[u - 1].append([v - 1, b]... | p03305 |
import heapq, sys
n, m, s, t = list(map(int, input().split()))
yen_edge = [[] for _ in range(n)]
snuke_edge = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
yen_edge[u - 1].append([v - 1, a])
yen_edge[v - 1].append([u - 1, a])
snuke_edge[u - 1].append([v - 1, b]... | import heapq, sys
def input():
return sys.stdin.readline()[:-1]
n, m, s, t = list(map(int, input().split()))
yen_edge = [[] for _ in range(n)]
snuke_edge = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
yen_edge[u - 1].append([v - 1, a])
yen_edge[v - 1].appe... | p03305 |
import sys
input = sys.stdin.readline
import heapq
def dijkstra(n, graph, s, yen=True):
dist = [10**18] * n
queue = [(s, 0)]
dist[s] = 0
while queue:
v, d = heapq.heappop(queue)
if dist[v] < d:
continue
for child, costa, costb in graph[v]:
if... | import sys
input = sys.stdin.readline
from heapq import heappop, heappush
INF = 10 ** 18
def dijkstra(n, s, g, mode):
dist = [INF] * n
dist[s] = 0
hq = [(0, s)]
while hq:
d, v = heappop(hq)
if dist[v] < d:
continue
for w, *a in g[v]:
nd = d ... | p03305 |
from queue import PriorityQueue as PQ
INF = float('inf')
yen = 10**15
def pcc(src, adj):
global n
pq = PQ()
dist = [INF]*(n+1)
dist[src] = 0
pq.put([0,src])
while not pq.empty():
d,u = pq.get()
for w, v in adj[u]:
if dist[v] > dist[u] + w:
dist[v] = dist[u] + w
pq.put([dist[v], v]... | import heapq
INF = float('inf')
yen = 10**15
def pcc(src, adj):
global n
pq = [(0,src)]
heapq.heapify(pq)
dist = [INF]*(n+1)
dist[src] = 0
while pq:
d,u = heapq.heappop(pq)
for w, v in adj[u]:
if dist[v] > dist[u] + w:
dist[v] = dist[u] + w
heapq.heappush(pq, (dist[v], v))
retur... | p03305 |
import heapq
INF = float('inf')
yen = 10**15
def pcc(src, adj):
pq = [(0,src)]
heapq.heapify(pq)
dist = [INF]*(n+1)
dist[src] = 0
while pq:
d,u = heapq.heappop(pq)
if d>dist[u]:continue
for w, v in adj[u]:
if dist[v] > dist[u] + w:
dist[v] = dist[u] + w
heapq.heappush(pq, (dist[v], v... | import heapq
def dijkstra(s, neighbor):
dist = [float('inf')] * N
dist[s] = 0
que = [(0, s)]
heapq.heapify(que)
while que:
d, v = heapq.heappop(que)
if d > dist[v]:
continue
for u, l in neighbor[v]:
tmp_d = d + l
if tmp_d < dist[u]:
dist[u] = tmp_d
heapq.heappush(que, (tmp_d, u... | p03305 |
import heapq
INF = float('inf')
yen = 10**15
def pcc(src, adj):
pq = [(0,src)]
heapq.heapify(pq)
dist = [INF]*(n+1)
dist[src] = 0
while pq:
d,u = heapq.heappop(pq)
if d>dist[u]:continue
for w, v in adj[u]:
if dist[v] > dist[u] + w:
dist[v] = dist[u] + w
heapq.heappush(pq, (dist[v], v... | import heapq
INF = float('inf')
yen = 10**15
def pcc(src, adj):
pq = [(0,src)]
heapq.heapify(pq)
dist = [INF]*n
dist[src] = 0
while pq:
d,u = heapq.heappop(pq)
if d>dist[u]:continue
for w, v in adj[u]:
if dist[v] > dist[u] + w:
dist[v] = dist[u] + w
heapq.heappush(pq, (dist[v], v))
... | p03305 |
import heapq
INF = float('inf')
yen = 10**15
def pcc(src, adj):
pq = [(0,src)]
heapq.heapify(pq)
dist = [INF]*n
dist[src] = 0
while pq:
d,u = heapq.heappop(pq)
if d>dist[u]:continue
for w, v in adj[u]:
if dist[v] > dist[u] + w:
dist[v] = dist[u] + w
heapq.heappush(pq, (dist[v], v))
... | import heapq
def pcc(src, adj):
pq = [(0,src)]
dist = [float('inf')]*n
dist[src] = 0
heapq.heapify(pq)
while pq:
d, u = heapq.heappop(pq)
for w, v in adj[u]:
if dist[v] > dist[u] + w:
dist[v] = dist[u] + w
heapq.heappush(pq, (dist[v], v))
return dist
n,m,s,t = map(int,input().split... | p03305 |
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
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... | p03305 |
from heapq import heapify,heappop,heappush
N,M,s,t=list(map(int,input().split()))
Graph1=[set() for i in range(N)]
Graph2=[set() for i in range(N)]
inf=float("inf")
for i in range(M):
u,v,a,b=list(map(int,input().split()))
Graph1[u-1].add((a,v-1))
Graph1[v-1].add((a,u-1))
Graph2[u-1].add((b,v-1))
Gr... | from heapq import heapify,heappop,heappush
N,M,s,t=list(map(int,input().split()))
Graph1=[set() for i in range(N)]
Graph2=[set() for i in range(N)]
inf=float("inf")
for i in range(M):
u,v,a,b=list(map(int,input().split()))
Graph1[u-1].add((a,v-1))
Graph1[v-1].add((a,u-1))
Graph2[u-1].add((b,v-1))
Gr... | p03305 |
from collections import defaultdict
from heapq import heapify, heappop
import heapq
n,m,s,t =list(map(int,input().split()))
MAX_VAL = 10**20
uvab = [list(map(int,input().split())) for _ in range(m)]
jpy_cost = defaultdict(lambda :defaultdict(lambda :MAX_VAL))
snuke_cost = defaultdict(lambda :defaultdict(lambd... | from collections import defaultdict
from heapq import heapify, heappop
import heapq
n,m,s,t =list(map(int,input().split()))
MAX_VAL = 10**20
uvab = [list(map(int,input().split())) for _ in range(m)]
jpy_cost = defaultdict(dict)
snuke_cost = defaultdict(dict)
for u,v,a,b in uvab:
u=u-1
v=v-1
... | p03305 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
import heapq
class PriorityQueue:
class Reverse:
def __init__(self, val):
self.val = val
def __lt__(self, other):
return self.val > other.val
... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
sys.setrecursionlimit(10 ** 5)
def main():
import heapq
from collections import defaultdict
INF = float('INF')
n, m, s, t = list(map(int, readline().split()))
edge = defaultdict(list)
for _ in range(m):
u, ... | p03305 |
import heapq
class Dijkstra(object):
def dijkstra(self, adj, start, goal=None):
'''
ダイクストラアルゴリズムによる最短経路を求めるメソッド
入力
adj: adj[i][j]の値が頂点iから頂点jまでの距離(頂点iから頂点jに枝がない場合，値はfloat('inf'))となるような2次元リスト(正方行列)
start: 始点のID
goal: オプション引数．終点のID
出力
goalを引数に... | '''
1つの始点から全頂点への最短距離を求めるアルゴリズム
辺の数E,頂点の数Vに対し、O((E+V)log(V))
edge[u]=[(d1, v1), (d2, v2), ...]が頂点uと頂点viに距離diの辺があることを表す隣接リストが入力
無向グラフにて検証済み。有効グラフのたぶんいけるので確認したらここを書き換えて欲しい。
'''
from heapq import heappush, heappop
INF = 10**15
def dijkstra(s, edges):
que = []
d = [INF] * n
d[s] = 0
heappu... | p03305 |
'''
1つの始点から全頂点への最短距離を求めるアルゴリズム
辺の数E,頂点の数Vに対し、O((E+V)log(V))
edge[u]=[(d1, v1), (d2, v2), ...]が頂点uと頂点viに距離diの辺があることを表す隣接リストが入力
無向グラフにて検証済み。有効グラフのたぶんいけるので確認したらここを書き換えて欲しい。
'''
from heapq import heappush, heappop
INF = 10**15
def dijkstra(s, edges):
que = []
d = [INF] * n
d[s] = 0
heappu... | '''
1つの始点から全頂点への最短距離を求めるアルゴリズム
辺の数E,頂点の数Vに対し、O((E+V)log(V))
edge[u]=[(d1, v1), (d2, v2), ...]が頂点uと頂点viに距離diの辺があることを表す隣接リストが入力
無向グラフにて検証済み。有効グラフのたぶんいけるので確認したらここを書き換えて欲しい。
'''
from heapq import heappush, heappop
INF = 10**15
def dijkstra(s, edges):
n = len(edges)
que = []
d = [INF] * n
... | p03305 |
import heapq
from itertools import accumulate
inf = float('inf')
def dijkstra(ad_lst, n, s):
costs = [inf for i in range(n+1)]
costs[s], Q = 0, []
heapq.heappush(Q, [costs[s], s])
while(Q != []):
c, u = heapq.heappop(Q)
for v, c in ad_lst[u]:
if costs[u] + c < c... | import heapq
from itertools import accumulate
inf = float('inf')
def dijkstra(ad_lst, n, s):
costs = [inf for i in range(n+1)]
costs[s], Q = 0, []
heapq.heappush(Q, [costs[s], s])
while(Q != []):
c, u = heapq.heappop(Q)
for v, c in ad_lst[u].items():
if costs[u]... | p03305 |
import sys
input = sys.stdin.readline
n, m, s, t = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(m)]
s -= 1
t -= 1
# O((V + E)log(V))
# Cは [[スタート頂点, ゴール頂点, 重み], ...] のリスト
for i in range(m):
for j in range(2):
C[i][j] -= 1
M = [[] for i in range(n)]
for... | import sys
input = sys.stdin.readline
n, m, s, t = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(m)]
s -= 1
t -= 1
# O((V + E)log(V))
# Cは [[スタート頂点, ゴール頂点, 重み], ...] のリスト
M = [[] for i in range(n)]
for i in range(len(C)):
M[C[i][0]-1].append([C[i][1]-1, C[i][2]]) ... | p03305 |
import sys
input = sys.stdin.readline
n, m, s, t = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(m)]
s -= 1
t -= 1
# O((V + E)log(V))
# Cは [[スタート頂点, ゴール頂点, 重み], ...] のリスト
# for i in range(m):
# for j in range(2):
# C[i][j] -= 1
M = [[] for i in range(n)... | import sys
input = sys.stdin.readline
n, m, s, t = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(m)]
s -= 1
t -= 1
# O((V + E)log(V))
# Cは [[スタート頂点, ゴール頂点, 重み], ...] のリスト
# for i in range(m):
# for j in range(2):
# C[i][j] -= 1
M = [[] for i in range(n)... | p03305 |
import sys
input = sys.stdin.readline
n, m, s, t = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(m)]
s -= 1
t -= 1
# O((V + E)log(V))
# Cは [[スタート頂点, ゴール頂点, 重み], ...] のリスト
M = [[] for i in range(n)]
for i in range(len(C)):
M[C[i][0]-1].append([C[i][1]-1, C[i][2]]) ... | # 「C[i][0]から1を引くのを別のループでやらない」「大きい値にはinfでなく10**16を使う」
# この2つはTLEしないために必須。それでも数回に1回、TLEすることがある
import sys
input = sys.stdin.readline
n, m, s, t = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(m)]
s -= 1
t -= 1
# O((V + E)log(V))
# Cは [[スタート頂点, ゴール頂点, 重み], ...] のリスト
# ... | p03305 |
from collections import defaultdict
import sys
import heapq
sys.setrecursionlimit(10**8)
#N:頂点数 M:辺数
N,M,s,t = list(map(int,input().split()))
#root[n] -> nからいけるlist
root_yen = defaultdict(set)
root_snu = defaultdict(set)
#cost[a][b] = a -> b のコスト
cost_yen = [[0 for i in range(N+1)] for j in ran... | from collections import defaultdict
import sys
import heapq
sys.setrecursionlimit(10**8)
#N:頂点数 M:辺数
N,M,s,t = list(map(int,input().split()))
#root[n] -> nからいけるlist
roots = defaultdict(set)
#weight[a] = start -> a のコスト 未探索->-1
weight_yen = [-1 for i in range(N+1)]
weight_snu = [-1 for i in range(... | p03305 |
from collections import defaultdict
import sys
import heapq
sys.setrecursionlimit(10**8)
#N:頂点数 M:辺数
N,M,s,t = list(map(int,input().split()))
#root[n] -> nからいけるlist
root_yen = defaultdict(set)
root_snu = defaultdict(set)
#cost[a][b] = a -> b のコスト
cost_yen = [[0 for i in range(N+1)] for j in ran... | from collections import defaultdict
import sys
import heapq
sys.setrecursionlimit(10**8)
#N:頂点数 M:辺数
N,M,s,t = list(map(int,input().split()))
#root[n] -> nからいけるlist
roots = defaultdict(set)
#weight[a] = start -> a のコスト 未探索->-1
weight_yen = [-1 for i in range(N+1)]
weight_snu = [-1 for i in range(... | p03305 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | p03305 |
from heapq import heappush, heappop
n,m,s,t = list(map(int,input().split()))
e = [[] for i in range(n+1)]
for i in range(m):
u,v,a,b = list(map(int,input().split()))
e[u].append((v,a,b))
e[v].append((u,a,b))
S = [float("INF")]*(n+1)
S[s] = 0
h = []
heappush(h,[s,0])
while h:
now,d = heap... | from heapq import heappush, heappop
n,m,s,t = list(map(int,input().split()))
e = [[] for i in range(n+1)]
for i in range(m):
u,v,a,b = list(map(int,input().split()))
e[u].append((v,a,b))
e[v].append((u,a,b))
S = [float("INF")]*(n+1)
S[s] = 0
h = []
heappush(h,[0,s])
while h:
d,now = heap... | p03305 |
from heapq import heappush, heappop
n,m,s,t = map(int,input().split())
e = [[] for i in range(n+1)]
for i in range(m):
u,v,a,b = map(int,input().split())
e[u].append((v,a,b))
e[v].append((u,a,b))
def dik(s,v):
S = [float("INF")]*(n+1)
S[s] = 0
h = []
heappush(h,[0,s])
... | from heapq import heappush as pu, heappop as po
n,m,s,t = map(int,input().split())
e = [[] for i in range(n+1)]
for i in range(m):
u,v,a,b = map(int,input().split())
e[u].append((v,a,b))
e[v].append((u,a,b))
def dik(s,v):
S = [float("INF")]*(n+1)
S[s] = 0
h = []
pu(h,[0,s])
... | p03305 |
from collections import defaultdict
import heapq
class Dijkstra:
"""
dijkstraの最短経路問題を解く
input:
S: start node
mat : mat[a][b] = edge_weight(a,b)
"""
def __init__(self, start, num_node, mat):
"""
mat: mat[a][b] = edge_weight(a,b)
num_node: num ... | import heapq
N,M,S,T = list(map(int,input().split()))
adj=[[] for _ in range(N)]
for _ in range(M):
a,b,c,d = list(map(int,input().split()))
adj[a-1].append((b-1,c,d))
adj[b-1].append((a-1,c,d))
D_S=[float("inf")]*N
D_T=[float("inf")]*N
D_S[S-1]=0
D_T[T-1]=0
Q=[]
heapq.heappush(Q,S-1... | p03305 |
import heapq as hq
from collections import deque
n,m,s,t=list(map(int,input().split()))
yenLinks={}
snkLinks={}
for _ in range(m):
u,v,a,b=list(map(int,input().split()))
if u not in yenLinks:
yenLinks[u]=[(v,a)]
snkLinks[u]=[(v,b)]
else:
yenLinks[u].append((v,a))
... | import heapq as hq
from collections import deque
n,m,s,t=list(map(int,input().split()))
#リンク情報をつくる
yenLinks={}
snkLinks={}
for _ in range(m):
u,v,a,b=list(map(int,input().split()))
if u not in yenLinks:
yenLinks[u]=[(v,a)]
snkLinks[u]=[(v,b)]
else:
yenLinks[u].append((v,a... | p03305 |
import heapq as hq
from collections import deque
n,m,s,t=list(map(int,input().split()))
#リンク情報をつくる
yenLinks={}
snkLinks={}
for _ in range(m):
u,v,a,b=list(map(int,input().split()))
if u not in yenLinks:
yenLinks[u]=[(v,a)]
snkLinks[u]=[(v,b)]
else:
yenLinks[u].append((v,a... | import heapq as hq
from collections import deque
n,m,s,t=list(map(int,input().split()))
#リンク情報をつくる
yenLinks={}
snkLinks={}
for _ in range(m):
u,v,a,b=list(map(int,input().split()))
if u not in yenLinks:
yenLinks[u]=[(v,a)]
snkLinks[u]=[(v,b)]
else:
yenLinks[u].append((v,a... | p03305 |
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)
MOD = 10**9 + 7
import heapq
class Heapq:
def __init__(self, que=[], asc=True):
if not asc:
... | from heapq import heappop, heappush
N, M, S, T = map(int, input().split())
K = 10**15
S -= 1
T -= 1
edgesYen = [[] for _ in range(N)]
edgesSun = [[] for _ in range(N)]
for _ in range(M):
fr, to, yen, sun = map(int, input().split())
fr -= 1
to -= 1
edgesYen[fr].append((to, yen))
edg... | p03305 |
import heapq
n, m, s, t = list(map(int, input().split()))
INF = 2**63-1
data = []
for _ in range(m):
data.append(list(map(int, input().split())))
check = [False for i in range(n+1)]
graph = [[] for i in range(n+1)]
for i in range(m):
graph[data[i][0]].append([data[i][1], data[i][2], data[i][3]])
... | import heapq
n, m, s, t = list(map(int, input().split()))
INF = 2**63-1
data = []
for _ in range(m):
data.append(list(map(int, input().split())))
check = [False for i in range(n+1)]
graph = [[] for i in range(n+1)]
for i in range(m):
graph[data[i][0]].append([data[i][1], data[i][2], data[i][3]])
... | p03305 |
import heapq
n, m, s, t = list(map(int, input().split()))
INF = 10**20
data = []
for _ in range(m):
data.append(list(map(int, input().split())))
check = [False] * (n+1)
graph = [[] for i in range(n+1)]
for i in range(m):
graph[data[i][0]].append([data[i][1], data[i][2], data[i][3]])
graph[data... | import heapq
n, m, s, t = list(map(int, input().split()))
INF = 10**20
data = []
for _ in range(m):
data.append(list(map(int, input().split())))
check = [False] * (n+1)
graph = [[] for i in range(n+1)]
for i in range(m):
graph[data[i][0]].append([data[i][1], data[i][2], data[i][3]])
graph[data... | p03305 |
import heapq
class Dijkstra:
def __init__(self, rote_map, start_point, goal_point=None):
self.rote_map = rote_map
self.start_point = start_point
self.goal_point = goal_point
def execute(self):
"""
:param rote_map:
:param start_point:
:par... | import heapq
class Dijkstra:
def __init__(self, rote_map, start_point, goal_point=None):
self.rote_map = rote_map
self.start_point = start_point
self.goal_point = goal_point
def execute(self):
"""
:param rote_map:
:param start_point:
:par... | p03305 |
from heapq import heappush, heappop
from collections import defaultdict
n, m, s, t = list(map(int, input().split()))
y = 10**15
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def add_edge(self, src, dst, weight=1):
self.graph[src].append((dst, weight))
... | from heapq import heappush, heappop
from collections import defaultdict
n, m, s, t = list(map(int, input().split()))
y = 10**15
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def add_edge(self, src, dst, weight=1):
self.graph[src].append((dst, weight))
... | p03305 |
import heapq
def dijkstra(s, type=0):
dist = [float('inf')] * N
dist[s] = 0
que = [(0, s)]
heapq.heapify(que)
while que:
d, v = heapq.heappop(que)
if d > dist[v]:
continue
for u, a, b in E[v]:
if type != 0:
a, b = b, a
... | import heapq
def dijkstra(s, neighbor):
dist = [float('inf')] * N
dist[s] = 0
que = [(0, s)]
heapq.heapify(que)
while que:
d, v = heapq.heappop(que)
if d > dist[v]:
continue
for u, l in neighbor[v]:
tmp_d = d + l
if tmp_d < dist... | p03305 |
from collections import defaultdict
from queue import PriorityQueue
def dijkstra(G, s):
q = PriorityQueue()
prev = [None] * len(list(G.keys()))
dist = [float('inf')] * len(list(G.keys()))
dist[s] = 0
for v in sorted(G.keys()):
q.put((dist[v],v))
while not q.empty():
_... | from collections import defaultdict
import heapq
def dijkstra(G, s):
q = []
heapq.heapify(q)
prev = [None] * len(list(G.keys()))
dist = [float('inf')] * len(list(G.keys()))
dist[s] = 0
for v in sorted(G.keys()):
heapq.heappush(q, (dist[v],v))
while True:
try:
... | p03305 |
import heapq
N, M, S, T = list(map(int, input().split()))
class Dijkstra:
def dijkstra(self, adj, start, goal=None):
num = N # グラフのノード数
dist = [float('inf') for i in range(num)] # 始点から各頂点までの最短距離を格納する
prev = [float('inf') for i in range(num)] # 最短経路における，その頂点の前の頂点のIDを格納する
... | import heapq
N, M, S, T = list(map(int, input().split()))
class Dijkstra:
def dijkstra(self, adj, start, goal=None):
num = N # グラフのノード数
dist = [float('inf') for i in range(num)] # 始点から各頂点までの最短距離を格納する
prev = [float('inf') for i in range(num)] # 最短経路における，その頂点の前の頂点のIDを格納する
... | p03305 |
import heapq
N, M, S, T = list(map(int, input().split()))
class Dijkstra:
def dijkstra(self, adj, start, goal=None):
num = N # グラフのノード数
dist = [float('inf') for i in range(num)] # 始点から各頂点までの最短距離を格納する
prev = [float('inf') for i in range(num)] # 最短経路における，その頂点の前の頂点のIDを格納する
... | import sys
def main():
N, M, S, T = list(map(int, input().split()))
A = [[] for _ in range(N+1)]
B = [[] for _ in range(N+1)]
for u, v, a, b in zip(*[iter(map(int, sys.stdin.read().split()))]*4):
A[u].append((v, a))
A[v].append((u, a))
B[u].append((v, b))
B[v].... | p03305 |
from collections import defaultdict
from heapq import heappush, heappop
def dijkstra(V, E, s):
'''
Input:
V = list(range(N))
E = defaultdict(dict)
s (in V) : start vertex
Output:
dist: the list of the minimum cost from s to arbitrary vertex v in the given graph
... | from collections import defaultdict
from heapq import heappush, heappop
def dijkstra(V, E, s):
'''
Input:
V = list(range(N))
E = defaultdict(dict)
s (in V) : start vertex
Output:
dist: the list of the minimum cost from s to arbitrary vertex v in the given graph
... | p03305 |
from heapq import *
n,m,s,t=list(map(int,input().split()))
s-=1
t-=1
INF=10**19
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=list(map(int,input().split()))
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([u,b])
... | from heapq import *
n,m,s,t=map(int,input().split())
s-=1
t-=1
INF=10**19
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=map(int,input().split())
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([u,b])
def dijks... | p03305 |
from heapq import *
n,m,s,t=map(int,input().split())
s-=1
t-=1
INF=10**19
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=map(int,input().split())
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([u,b])
def dijks... | from heapq import *
n,m,s,t=map(int,input().split())
s-=1
t-=1
INF=10**19
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=map(int,input().split())
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([u,b])
def dijks... | p03305 |
from heapq import *
n,m,s,t=map(int,input().split())
s-=1
t-=1
INF=float("inf")
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=map(int,input().split())
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([u,b])
def... | from heapq import *
n,m,s,t=map(int,input().split())
s-=1
t-=1
INF=float("inf")
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=map(int,input().split())
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([u,b])
def... | p03305 |
from heapq import *
n,m,s,t=list(map(int,input().split()))
s-=1
t-=1
INF=float("inf")
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=list(map(int,input().split()))
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([... | from heapq import *
n,m,s,t=map(int,input().split())
s-=1
t-=1
INF=10**19
Gyen=[[]for i in range(n)]
Gsnu=[[]for i in range(n)]
for i in range(m):
u,v,a,b=map(int,input().split())
u-=1
v-=1
Gyen[u].append([v,a])
Gyen[v].append([u,a])
Gsnu[u].append([v,b])
Gsnu[v].append([u,b])
def dijks... | p03305 |
#### import ####
import sys
import math
from collections import defaultdict
#### 設定 ####
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
#### 定数 ####
mod = 10**9 + 7
#### 読み込み ####
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III... | #### import ####
import sys
import math
from collections import defaultdict
#### 設定 ####
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
#### 定数 ####
mod = 10**9 + 7
#### 読み込み ####
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III... | p03305 |
n,m,s,t=map(int,input().split())
uvab=[map(int,input().split()) for i in range(m)]
inf=10**20
c1=[[inf]*n for i in range(n)]
c2=[[inf]*n for i in range(n)]
for u,v,a,b in uvab:
c1[u-1][v-1]=c1[v-1][u-1]=a
c2[u-1][v-1]=c2[v-1][u-1]=b
for i in range(n):
c1[i][i]=c2[i][i]=0
from heapq import heappop,... | n,m,s,t=map(int,input().split())
uvab=[map(int,input().split()) for i in range(m)]
inf=10**20
c1=[[] for i in range(n)]
c2=[[] for i in range(n)]
for u,v,a,b in uvab:
c1[u-1].append((v-1,a))
c1[v-1].append((u-1,a))
c2[u-1].append((v-1,b))
c2[v-1].append((u-1,b))
from heapq import heappop,heapp... | p03305 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/soundhound2018-summer-qual/editorial.pdf
https://ikatakos.com/pot/programming_algorithm/contest_history/atcoder/2018/0707_soundhound2018_summer_qual
"""
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, fa... | # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
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 rang... | p03305 |
import heapq
n,m,s,t = list(map(int,input().split()))
edgeY = [[] for _ in range(n)]
edgeS = [[] for _ in range(n)]
for i in range(m):
u,v,a,b = list(map(int,input().split()))
edgeY[u-1].append([a, v-1])
edgeY[v-1].append([a, u-1])
edgeS[u-1].append([b, v-1])
edgeS[v-1].append([b, u-1])
co... | import heapq
n,m,s,t = list(map(int,input().split()))
edgeY = [[] for _ in range(n)]
edgeS = [[] for _ in range(n)]
for i in range(m):
u,v,a,b = list(map(int,input().split()))
edgeY[u-1].append((a, v-1))
edgeY[v-1].append((a, u-1))
edgeS[u-1].append((b, v-1))
edgeS[v-1].append((b, u-1))
co... | p03305 |
# -*- coding: utf-8 -*-
import heapq
n,m,s,t = list(map(int, input().split()))
e = [[] for _ in range(n+1)]
for _ in range(m):
v,u,a,b = list(map(int, input().split()))
e[v].append((u,(a,b)))
e[u].append((v,(a,b)))
inf = 10**18
def dijkstra(s,cu):
d = [inf]*(n+1)
d[s] = 0
q = [... | # -*- coding: utf-8 -*-
import heapq
n,m,s,t = list(map(int, input().split()))
e = [[] for _ in range(n+1)]
for _ in range(m):
v,u,a,b = list(map(int, input().split()))
e[v].append((u,(a,b)))
e[u].append((v,(a,b)))
inf = 10**18
def dijkstra(s,cu):
d = [inf]*(n+1)
d[s] = 0
q = [... | p03305 |
import heapq
n,m,s,t=list(map(int,input().split()))
src = [ tuple( map( int, input().split() ) ) for i in range(m)]
nl=[ [ ] for j in range(n+1) ]
for u,v,a,b in src:
nl[u].append( (v,a,b) )
nl[v].append( (u,a,b) )
def dij(v,type):
d=[ float("inf")]*(n+1)
d[v]=0
Q=[]
heapq.heappush(Q,v)... | import heapq
N,M,S,T = list(map(int,input().split()))
S,T = S-1,T-1
src = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for i in range(N)]
for u,v,a,b in src:
u,v = u-1,v-1
es[u].append((v,a,b))
es[v].append((u,a,b))
INF = float('inf')
cy = [INF] * N
cy[S] = 0
hq = [(0,S)... | p03305 |
import heapq
n,m,s,t=list(map(int,input().split()))
src = [ tuple( map( int, input().split() ) ) for i in range(m)]
nl=[ [ ] for j in range(n+1) ]
for u,v,a,b in src:
nl[u].append( (v,a,b) )
nl[v].append( (u,a,b) )
#Dijkstra yen
d_y=[ float("inf") ]*(n+1)
d_y[s]=0
Q=[]
heapq.heappush(Q,s)
... | import heapq
n,m,s,t=list(map(int,input().split()))
src = [ tuple( map( int, input().split() ) ) for i in range(m)]
nl=[ [ ] for j in range(n+1) ]
for u,v,a,b in src:
nl[u].append( (v,a,b) )
nl[v].append( (u,a,b) )
#Dijkstra yen
d_y=[ float("inf") ]*(n+1)
d_y[s]=0
Q=[]
heapq.heappush(Q, (0,s)... | p03305 |
import heapq as hq
#0 input
INF = 10**16
OKANE = 10**15
N, M, S, T = list(map(int, input().split()))
graph_yen = [[] for _ in range(N+1)]
graph_snk = [[] for _ in range(N+1)]
for i in range(M):
u, v, a, b = list(map(int, input().split()))
graph_yen[u].append((v, a))
graph_yen[v].append((u,... | import heapq
n,m,s,t=list(map(int,input().split()))
s-=1
t-=1
Gyen=[dict() for i in range(n)]
Gsnu=[dict() for i in range(n)]
for i in range(m):
u,v,a,b=list(map(int,input().split()))
u-=1
v-=1
Gyen[u][v]=a
Gyen[v][u]=a
Gsnu[u][v]=b
Gsnu[v][u]=b
def dijkstra(adj, start):
n... | p03305 |
import heapq as hq
INF = 10**16
OKANE = 10**15
N, M, S, T = list(map(int, input().split()))
graph_yen = [[] for _ in range(N+1)]
graph_snk = [[] for _ in range(N+1)]
for i in range(M):
u, v, a, b = list(map(int, input().split()))
graph_yen[u].append((a, v))
graph_yen[v].append((a, u... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
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.r... | p03305 |
def dijkstra_heap(n,s,edge):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
used = [True] * n # True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heappush(edgelist, e)
while edgelist:
minedge = heappop(edgelist)
# まだ使われてない頂点の中から最小の距離のものを探す
... | def dijkstra_heap(n,s,edge,k):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
used = [True] * n # True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heappush(edgelist, [e[k],e[2]])
while edgelist:
minedge = heappop(edgelist)
# まだ使われてない頂点の中から最小の... | p03305 |
def dijkstra_heap(n,s,edge,k):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
used = [True] * n # True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heappush(edgelist, [e[k],e[2]])
while edgelist:
minedge = heappop(edgelist)
# まだ使われてない頂点の中から最小の... | def dijkstra_heap(n,s,edge,k):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
d[s] = 0
edgelist = [s]
while edgelist:
nextedge = []
for i in edgelist:
for j in edge[i]:
next = j[2]
c = j[k]
if d[next] > c + d[i]:
... | p03305 |
import sys
input = sys.stdin.buffer.readline
from collections import deque
def main():
N,M,s,t = map(int,input().split())
INF = 10**15
yedge = [[] for _ in range(N)]
sedge = [[] for _ in range(N)]
for _ in range(M):
u,v,a,b = map(int,input().split())
yedge[u-1].appe... | import sys
input = sys.stdin.buffer.readline
import heapq
def main():
N,M,s,t = map(int,input().split())
INF = 10**15
yedge = [[] for _ in range(N)]
sedge = [[] for _ in range(N)]
for _ in range(M):
u,v,a,b = map(int,input().split())
yedge[u-1].append((a,v-1))
... | p03305 |
from heapq import heappush, heappop
def dijkstra(s, edge):
'''
始点sから各頂点への最短距離を求める
'''
d = [float("inf")] * n
d[s] = 0
used = [False] * n
used[s] = True
edgelist = []
for e in edge[s]:
heappush(edgelist, e)
while edgelist:
cost, v = heappop(edgel... | from heapq import heappush, heappop
def dijkstra(s, edge):
'''
始点sから各頂点への最短距離を求める
'''
d = [float("inf")] * n
d[s] = 0
used = [False] * n
used[s] = True
edgelist = []
for e in edge[s]:
heappush(edgelist, e)
while edgelist:
cost, v = heappop(edgel... | p03305 |
import heapq
from collections import defaultdict
def gijkstra(n,E,s=1):
d = [float('inf')]*(n+1)
p = [-1]*(n+1)
hq = [(0,s)]
d[s] = 0
while hq:
u = heapq.heappop(hq)[1]
for v, c in E[u]:
if d[v] > d[u] + c:
d[v], p[v] = d[u]+c, u
... | import heapq
from collections import defaultdict
def gijkstra(n,E,s=1):
d = [float('inf')]*(n+1)
p = [-1]*(n+1)
hq = [(0,s)]
d[s] = 0
while hq:
u = heapq.heappop(hq)[1]
for v, c in E[u]:
if d[v] > d[u] + c:
d[v], p[v] = d[u]+c, u
... | p03305 |
import collections
import heapq
class Dijkstra():
def __init__(self):
self.e = collections.defaultdict(list)
def add(self, u, v, d):
self.e[u].append([v, d])
self.e[v].append([u, d])
def delete(self, u, v):
self.e[u] = [_ for _ in self.e[u] if _[0] != v]
... | import collections
import heapq
class Dijkstra():
def __init__(self):
self.e = collections.defaultdict(list)
def add(self, u, v, d):
self.e[u].append([v, d])
self.e[v].append([u, d])
def delete(self, u, v):
self.e[u] = [_ for _ in self.e[u] if _[0] != v]
... | p03305 |
N,M,S,T = map(int,input().split())
S,T = S-1,T-1
UVAB = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
for u,v,a,b in UVAB:
u,v = u-1,v-1
es[u].append((v,a,b))
es[v].append((u,a,b))
import heapq
INF = float('inf')
dy = [INF]*N
dy[S] = 0
hq = [(0,S)]
heapq.heap... | N,M,S,T = map(int,input().split())
S,T = S-1,T-1
UVAB = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
for u,v,a,b in UVAB:
u,v = u-1,v-1
es[u].append((v,a,b))
es[v].append((u,a,b))
import heapq
INF = float('inf')
cy = [INF] * N
cy[S] = 0
hq = [(0,S)]
heapq.he... | p03305 |
import heapq
import sys
input = sys.stdin.readline
N, M, S, T = list(map(int, input().split()))
import heapq
class Edge():
""" 重み付き有向辺 """
def __init__(self, _to, _cost):
self.to = _to
self.cost = _cost
class Dijkstra():
def __init__(self, V):
self.G = [[]... | import heapq
import sys
input = sys.stdin.readline
N, M, S, T = list(map(int, input().split()))
class Edge():
def __init__(self, _to, _cost):
self.to = _to
self.cost = _cost
class Dijkstra():
def __init__(self, V):
self.G = [[] for i in range(V+1)]
self._... | p03305 |
import heapq
n, m, s, t = list(map(int, input().split()))
def to_v(i, j):
return 2*i+j
N = 2*n
edges = [[]for _ in range(N)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
edges[to_v(u, 0)].append((a, to_v(v, 0)))
edges[to_v(v, 0)].append((a, to_... | import heapq
n, m, s, t = list(map(int, input().split()))
edges_yen = [[]for _ in range(n)]
edges_snuuk = [[]for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
edges_yen[u-1].append((a, v-1))
edges_yen[v-1].append((a, u-1))
edges_snuuk[u-1].append((b, v-1))
e... | p03305 |
import heapq
import sys
input = sys.stdin.readline
def dijkstra(start: int, graph: list) -> list:
"""dijkstra法: 始点startから各頂点への最短距離を求める
重み付きグラフgraphは隣接リストで与えられる
計算量: O(|E|log|V|)
"""
INF = float("inf")
n = len(graph)
distance = [INF] * n
distance[start] = 0
q = [... | import heapq
import sys
input = sys.stdin.readline
def dijkstra(start: int, graph: list) -> list:
"""dijkstra法: 始点startから各頂点への最短距離を求める
重み付きグラフgraphは隣接リストで与えられる
計算量: O(|E|log|V|)
"""
INF = float("inf")
n = len(graph)
distance = [INF] * n
distance[start] = 0
q = [(0, st... | p03305 |
from queue import PriorityQueue
from collections import defaultdict
n,m,s,t = map(int,input().split())
s-=1
t-=1
edge_a = defaultdict(set)
edge_b = defaultdict(set)
for i in range(m):
u,v,a,b = map(int, input().split())
u -= 1
v -= 1
edge_a[u].add((v, a))
edge_a[v].add((u, a))
edg... | from heapq import heapify, heappop, heappush
from collections import defaultdict
n,m,s,t = map(int,input().split())
s-=1
t-=1
edge_a = defaultdict(set)
edge_b = defaultdict(set)
for i in range(m):
u,v,a,b = map(int, input().split())
u -= 1
v -= 1
edge_a[u].add((v, a))
edge_a[v].add((u,... | p03305 |
from heapq import *
from collections import defaultdict
def Dijkstra(s, V, E):
# https://ja.wikipedia.org/wiki/%E3%83%80%E3%82%A4%E3%82%AF%E3%82%B9%E3%83%88%E3%83%A9%E6%B3%95
d = defaultdict(lambda:10**30)
d[s] = 0
Q = []
for v in V:
heappush(Q, (d[v], v))
while Q:
... |
from heapq import *
from collections import defaultdict
def Dijkstra(s, N, E):
# https://ja.wikipedia.org/wiki/%E3%83%80%E3%82%A4%E3%82%AF%E3%82%B9%E3%83%88%E3%83%A9%E6%B3%95
d = [10**30] * (N + 1)
d[s] = 0
Q = []
for v in range(1, N + 1):
heappush(Q, (d[v], v))
while Q:
... | p03305 |
from collections import defaultdict
from itertools import accumulate
import heapq
n,m,s,t=list(map(int, input().split()))
s-=1
t-=1
yen=[[0 for _ in range(n)] for _ in range(n)]
snk=[[0 for _ in range(n)] for _ in range(n)]
adj=defaultdict(list)
for _ in range(m):
u,v,a,b=list(map(int, input().split()))
... | from collections import defaultdict
from itertools import accumulate
import heapq
n,m,s,t=list(map(int, input().split()))
s-=1
t-=1
yen={}
snk={}
adj=defaultdict(list)
for _ in range(m):
u,v,a,b=list(map(int, input().split()))
u-=1
v-=1
adj[u].append(v)
adj[v].append(u)
ye... | p03305 |
from collections import defaultdict
from itertools import accumulate
import heapq
n,m,s,t=list(map(int, input().split()))
s-=1
t-=1
yen={}
snk={}
adj=defaultdict(list)
for _ in range(m):
u,v,a,b=list(map(int, input().split()))
u-=1
v-=1
adj[u].append(v)
adj[v].append(u)
ye... | from itertools import accumulate
import heapq
n,m,s,t=list(map(int, input().split()))
s-=1
t-=1
yen=[{} for _ in range(n)]
snk=[{} for _ in range(n)]
for _ in range(m):
u,v,a,b=list(map(int, input().split()))
u-=1
v-=1
yen[u][v]=a
yen[v][u]=a
snk[u][v]=b
snk[v][u]=b
... | p03305 |
import heapq
from collections import defaultdict
n, m, s, t = list(map(int, input().split()))
money = defaultdict(set)
snuke = defaultdict(set)
for i in range(m):
a, b, c, d = list(map(int, input().split()))
money[a-1].add((b-1, c))
money[b-1].add((a-1, c))
snuke[a-1].add((b-1, d))
snu... | import heapq
from collections import defaultdict
n, m, s, t = list(map(int, input().split()))
money = defaultdict(set)
snuke = defaultdict(set)
for i in range(m):
a, b, c, d = list(map(int, input().split()))
money[a-1].add((b-1, c))
money[b-1].add((a-1, c))
snuke[a-1].add((b-1, d))
snu... | p03305 |
import sys
input = sys.stdin.buffer.readline
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getlist():
return list(map(int, input().split()))
import math
import heapq
import fractions
from collections import defaultdict, Counter, deque
MOD = 10**9 +... | import sys
input = sys.stdin.buffer.readline
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getlist():
return list(map(int, input().split()))
import math
import heapq
import fractions
from collections import defaultdict, Counter, deque
MOD = 10**9 +... | p03305 |
import heapq
from heapq import heapify, heappush, heappop
global G
def input_graph(M, uvab):
global G
for i in range(M):
u, v, a, b = uvab[i]
G[u-1] += [[v-1, (a, b)]]
G[v-1] += [[u-1, (a, b)]]
def dijkstra(N, S, flag):
global G
dist = [float('inf') for _ in range(N)]
dist[S] =... | import heapq
from heapq import heapify, heappush, heappop
global G
def input_graph(M, uvab):
global G
for i in range(M):
u, v, a, b = uvab[i]
G[u-1] += [[v-1, (a, b)]]
G[v-1] += [[u-1, (a, b)]]
def dijkstra(N, S, flag):
global G
dist = [float('inf') for _ in range(N)]
dist[S] =... | p03305 |
import heapq
n, m, s, t = list(map(int, input().split()))
money = 10**15
graph = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
graph[u] += [[v, a, b]]
graph[v] += [[u, a, b]]
def dijkstra(s, y):
dist = [float('inf')]*n
dist[s] = 0... |
import heapq
n, m, s, t = list(map(int, input().split()))
money = 10**15
graph = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
graph[u] += [[v, a, b]]
graph[v] += [[u, a, b]]
def dijkstra(s, y):
dist = [float('inf')]*n
dist[s] = 0... | p03305 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
N, M, S, T = [int(_) for _ in input().split()]
UVAB = [[int(_) for _ in input().split()] for _ in range(M)]
G1 = collections.defaultdict(lambda: collections.defaultdict(int))
G2 = collections.default... | import math, string, itertools, fractions, collections, re, array, bisect, sys, random, time, copy, functools
from heapq import heappush, heappop, heappushpop, heapify, heapreplace
input = sys.stdin.readline
N, M, S, T = [int(_) for _ in input().split()]
UVAB = [[int(_) for _ in input().split()] for _ in range(M)... | p03305 |
import math, string, itertools, fractions, collections, re, array, bisect, sys, random, time, copy, functools
from heapq import heappush, heappop, heappushpop, heapify, heapreplace
#input = sys.stdin.readline
N, M, S, T = [int(_) for _ in input().split()]
UVAB = [[int(_) for _ in input().split()] for _ in range(M... | import math, string, itertools, fractions, collections, re, array, bisect, sys, random, time, copy, functools
from heapq import heappush, heappop, heappushpop, heapify, heapreplace
N, M, S, T = [int(_) for _ in input().split()]
UVAB = [[int(_) for _ in input().split()] for _ in range(M)]
G1 = collections.defaultd... | p03305 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, s, t = list(map(int, input().split()))
graph = [0] + [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
# (cost, dest)
graph[u].append(({'yen': a, 'sunuke': b}, v))
graph[v].append((... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, s, t = list(map(int, input().split()))
graph = [0] + [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
# (cost, dest)
graph[u].append(({'yen': a, 'sunuke': b}, v))
graph[v].append((... | p03305 |
n,m,s,t = list(map(int,input().split()))
en = []
su = []
for i in range(m):
x1,y1,z1,a1=[int(i) for i in input().split()]
en.append([x1-1,y1-1,z1])
en.append([y1-1,x1-1,z1])
su.append([x1-1,y1-1,a1])
su.append([y1-1,x1-1,a1])
def shortest_path(edge,num_v,start):
inf = float("inf")
... | import heapq
n,m,s,t = list(map(int,input().split()))
en = []
su = []
for i in range(m):
x1,y1,z1,a1=[int(i) for i in input().split()]
en.append([x1-1,y1-1,z1])
en.append([y1-1,x1-1,z1])
su.append([x1-1,y1-1,a1])
su.append([y1-1,x1-1,a1])
def shortest_path(edge,num_v,start):
inf = flo... | p03305 |
import heapq
def dijkstra(adj, start):
# adj: [[to, cost] * vertices], 0th index must be empty
dist = [float('inf')] * len(adj)
dist[start] = 0
q = []
heapq.heappush(q, [0, start])
while q:
min_dist, v_from = heapq.heappop(q)
if min_dist > dist[v_from]:
... | import heapq
import sys
input = sys.stdin.readline
def dijkstra(adj, start):
# adj: [[to, cost] * vertices], 0th index must be empty
dist = [float('inf')] * len(adj)
dist[start] = 0
q = []
heapq.heappush(q, [0, start])
while q:
min_dist, v_from = heapq.heappop(q)
i... | p03305 |
n,m,s,t = map(int,input().split())
uvab = [list(map(int,input().split())) for i in range(m)]
gyen = [[] for i in range(n+1)]
gsnu = [[] for i in range(n+1)]
for u,v,a,b in uvab:
gyen[u].append((v,a))
gyen[v].append((u,a))
gsnu[u].append((v,b))
gsnu[v].append((u,b))
import heapq as hq
def dijkstra(star... | import sys
input = sys.stdin.readline
n,m,s,t = map(int,input().split())
uvab = [list(map(int,input().split())) for i in range(m)]
gyen = [[] for i in range(n+1)]
gsnu = [[] for i in range(n+1)]
for u,v,a,b in uvab:
gyen[u].append((v,a))
gyen[v].append((u,a))
gsnu[u].append((v,b))
gsnu[v].append((u,b)... | p03305 |
from heapq import heappush, heappop
money = 10**15
N, M, s, t = map(int, input().split())
s -= 1; t -= 1
graph = [[[] for i in range(N)] for _ in range(2)]
for i in range(M):
u, v, a, b = map(int, input().split())
u -= 1; v -= 1
graph[0][u].append((v, a)); graph[0][v].append((u, a))
graph[1][u].appen... | from heapq import heappush, heappop
import sys
input = sys.stdin.readline
money = 10**15
N, M, s, t = map(int, input().split())
s -= 1; t -= 1
graph = [[[] for i in range(N)] for _ in range(2)]
for i in range(M):
u, v, a, b = map(int, input().split())
u -= 1; v -= 1
graph[0][u].append((v, a)); graph[0... | p03305 |
def main():
import sys
input = sys.stdin.readline
import heapq
n,m,s,t = list(map(int,input().split()))
edgesYen = [[]for _ in range(n+1)]
edgesSnuuk = [[]for _ in range(n+1)]
for _ in range(m):
u,v,a,b = list(map(int,input().split()))
edgesYen[u].append((v,a))
... | """
前処理として、各地点で両替した場合に最終的に残るスヌークを計算しておく。
これは、s地点から各地点までの円での最小コストと t地点から各地点までのスヌークでの最小コストを計算することで可能である。
次に、各地点で両替した場合に残るスヌークを昇順で保持しておく。
これで前処理は完了。
あとは、小さい順に残スヌークを取り出し、その両替地点の番号がi以下であれば、新しい最小値を取り出し、そうでなければ、その値を出力する。
"""
def main():
import sys
input = sys.stdin.readline
import heapq
n,m,s,t = ... | p03305 |
from heapq import heappop,heappush
def dijkstra(s,n,edge):
"""
始点sから各頂点への最短距離を返す
Parameters
----------
s : int
視点とする頂点（0-indexed）
n : int
グラフの要素数
eage:list
グラグ
Returns
-------
dist ：list
始点sから各頂点への最短距離
"""
dist=[float("inf")]*n
dist[s]=0
used=[-1]*n... | import sys
input=sys.stdin.readline
from heapq import heappop,heappush
def dijkstra(s,n,edge):
"""
始点sから各頂点への最短距離を返す
Parameters
----------
s : int
視点とする頂点（0-indexed）
n : int
グラフの要素数
eage:list
グラグ
Returns
-------
dist ：list
始点sから各頂点への最短距離
"""
dist=[float... | p03305 |
from heapq import heappush, heappop
inf = float('inf')
mod = 10**9 + 7
class dijkstra:
def __init__(self, to, start):
self.N = len(to)
self.to = [s[:] for s in to]
self.start = start
self.dist = [inf] * self.N
self.dist[start] = 0
self.cnt = [0] * self.N
... | from heapq import heappush, heappop
inf = float('inf')
# mod = 10**9 + 7
class dijkstra:
def __init__(self, to, start):
self.N = len(to)
self.to = [s[:] for s in to]
self.start = start
self.dist = [inf] * self.N
self.dist[start] = 0
# self.cnt = [0] * self... | p03305 |
INF = 10 ** 20
def main():
d, n = list(map(int,input().split()))
temp = [int(eval(input())) for i in range(d)]
temp.insert(0,0)
alst = []
blst = []
clst = []
for i in range(n):
a,b,c = list(map(int,input().split()))
alst.append(a)
blst.append(b)
clst.append(c)
dp = [[0] ... | INF = 10 ** 20
def main():
d, n = list(map(int,input().split()))
temp = [int(eval(input())) for i in range(d)]
temp.insert(0,0)
alst = []
blst = []
clst = []
for i in range(n):
a,b,c = list(map(int,input().split()))
alst.append(a)
blst.append(b)
clst.append(c)
... | p00502 |
import sys
from pprint import pprint
s = sys.stdin.readline().strip()
t = sys.stdin.readline().strip()
len_s = len(s)
len_t = len(t)
# print(len_s, len_t)
cand = []
for i in range(0, len_s - len_t + 1):
a = list(s)
flag = True
for j in range(len_t):
# print(s[i+j], t[j])
i... | import sys
S = list(sys.stdin.readline().rstrip())
T = list(sys.stdin.readline().rstrip())
len_s = len(S)
len_t = len(T)
for i in range(len_s - len_t, -1, -1):
for j in range(len_t):
if S[i+j] == T[j] or S[i+j] == "?":
continue
else:
break
else:
... | p03565 |
S = input()[::-1]
T = input()[::-1]
flag = False
for i in range(len(S) - len(T) + 1):
matched = True
for j in range(len(T)):
if S[i + j] != "?" and S[i + j] != T[j]:
matched = False
if matched:
S = S[:i] + T + S[i + len(T):]
flag = True
brea... | S = input()[::-1]
T = input()[::-1]
flag = False
for i in range(len(S) - len(T) + 1):
matched = True
for j in range(len(T)):
if S[i + j] != "?" and S[i + j] != T[j]:
matched = False
break
if matched:
S = S[:i] + T + S[i + len(T):]
flag =... | p03565 |
def resolve():
'''
code here
'''
S_dash = input()
T = input()
is_flag = False
res = ''
res_list = ['zzzzz']
for i in range(len(S_dash) - len(T) +1):
res = S_dash[:i]
# print(i, res)
if len(S_dash) - len(res) >= len(T):
for j in ran... | def resolve():
'''
code here
'''
S_dash = input()[::-1]
T = input()[::-1]
is_flag = False
res = ''
for i in range(len(S_dash)):
res = S_dash[:i]
# print(res)
if len(S_dash) - len(res) >= len(T):
for j in range(len(T)):
... | p03565 |
S = input().strip()
T = input().strip()
N = len(S)
K = len(T)
A = list(S)
for i in range(N-K,-1,-1):
a = S[i:i+K]
flag = 0
for j in range(K):
if a[j]!="?" and a[j]!=T[j]:
flag = 1
break
if flag==1:continue
A[i:i+K] = T[:]
for j in range(N):
... | S1 = list(input().strip())
T = list(input().strip())
n = len(S1)
k = len(T)
G = []
for i in range(n-k+1):
flag = 0
for j in range(i,i+k):
if S1[j]!="?" and S1[j]!=T[j-i]:
flag = 1
break
if flag==0:
A = S1[:]
A[i:i+k] = T[:]
for j in range... | p03565 |
S1 = list(input().strip())
T = list(input().strip())
n = len(S1)
k = len(T)
G = []
for i in range(n-k+1):
flag = 0
for j in range(i,i+k):
if S1[j]!="?" and S1[j]!=T[j-i]:
flag = 1
break
if flag==0:
A = S1[:]
A[i:i+k] = T[:]
for j in range... | S = input().strip()
N=len(S)
T = input().strip()
M=len(T)
A = []
for i in range(N-M+1):
flag = 0
for j in range(i,i+M):
if S[j]=="?" or S[j]==T[j-i]:continue
else:
flag=1
break
if flag==0:
X = list(S)
for j in range(i,i+M):
X... | p03565 |
S = input().strip()
N=len(S)
T = input().strip()
M=len(T)
A = []
for i in range(N-M+1):
flag = 0
for j in range(i,i+M):
if S[j]=="?" or S[j]==T[j-i]:continue
else:
flag=1
break
if flag==0:
X = list(S)
for j in range(i,i+M):
X... | S = input().strip()
N = len(S)
T = input().strip()
K = len(T)
flag = 0
ind = -1
for i in range(N-K,-1,-1):
A = list(S[i:i+K])
flag = 0
for j in range(K):
if A[j]!="?" and A[j]!=T[j]:
flag = 1
break
if flag == 0:
ind = i
break
if ind<0:
... | p03565 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
t = str(readline().rstrip().decode('utf-8'))
k = len(t)
for i in range(len(s) - k, -1, -1):
ts = s[i:i+k]
b = True
for j in range(k):
... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
t = str(readline().rstrip().decode('utf-8'))
lt = len(t)
for i in range(len(s) - lt, -1, -1):
ts = s[i:i+lt]
b = True
for j in range(l... | p03565 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)... | p03211 |
# 2019-11-11 16:07:35(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
... | import sys
target = 753
s = sys.stdin.readline().rstrip()
def main():
d = 642
for i in range(len(s) - 2):
d = min(d, abs(target - int(s[i:i+3])))
return d
if __name__ == '__main__':
ans = main()
print(ans) | p03211 |
def cmb(n, r, mod):#コンビネーションの高速計算
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353
N = 2*10**3
g1 = [1]*(N+1) # 元テーブル
g2 = [1]*(N+1) #逆元テーブル
inverse = [1]*(N+1) #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1[i]=( ( g1[i-1] * i ) % mo... | def cmb(n, r, mod):#コンビネーションの高速計算
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353
N = 2*10**3
g1 = [1]*(N+1) # 元テーブル
g2 = [1]*(N+1) #逆元テーブル
inverse = [1]*(N+1) #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1[i]=( ( g1[i-1] * i ) % mo... | p02636 |
N, M = list(map(int, input().split()))
Alist = list(map(int, input().split()))
Alist = sorted(Alist, reverse=True)
for i in range(M):
Alist[0] = Alist[0]//2
Alist = sorted(Alist, reverse=True)
print((sum(Alist))) | import heapq
N, M = list(map(int, input().split()))
Alist = list(map(int, input().split()))
q = []
for a in Alist:
heapq.heappush(q, -a)
for i in range(M):
m = heapq.heappop(q)
heapq.heappush(q, -((-m)//2))
print((-sum(q))) | p02912 |
import bisect
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
for i in range(M):
a = A.pop()
a = a // 2
bisect.insort_right(A, a)
# print(A)
x = sum(A)
print(x)
if __name__ == "__main__":
mai... | import heapq
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [-1 * i for i in A]
heapq.heapify(A)
for i in range(M):
a = heapq.heappop(A)
a = -1 * (-1 * a // 2)
heapq.heappush(A, a)
x = -1 * sum(A)
print(... | p02912 |
n,m=list(map(int,input().split()))
l=list(map(int,input().split()))
for i in range(m):
j= l.index(max(l))
l[j] = l[j]//2
print((sum(l)))
| import heapq
n, m = list(map(int, input().split()))
a = list([-int(x) for x in input().split()])
heapq.heapify(a)
for _ in range(m):
tmp = -heapq.heappop(a)
tmp //= 2
heapq.heappush(a,-tmp)
print((-sum(a)))
| p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
for i in range(M):
A[A.index(max(A))] //= 2
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = list([int(x)*(-1) for x in input().split()])
heapq.heapify(A)
for _ in range(M):
mn = heapq.heappop(A)
heapq.heappush(A, -mn//2*(-1))
print((-sum(A))) | p02912 |
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A = sorted(A,reverse=True)
for i in range(M):
maxindex = A.index(max(A))
A[maxindex] = A[maxindex]//2
print((sum(A))) | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A = list([x*(-1) for x in A])
import heapq
heapq.heapify(A)
for i in range(M):
maxA = (((heapq.heappop(A))*(-1))//2)*(-1)
heapq.heappush(A,maxA)
print((sum(A)*-1))
| p02912 |
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(M):
A=sorted(A)
A[len(A)-1]=A[len(A)-1]//2
print((sum(A))) | N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
while M>0:
A.sort(reverse=True)
if A[0]==0:
break
judge=A[0]//2
for i in range(len(A)):
if A[i]>judge and M>0:
A[i]=A[i]//2
M-=1
else:
break
print((sum(A))) | p02912 |
import math
def max_index(list, max_index):
r = -1
max = -1
for i in range(max_index + 1):
v = list[i]
if v > max:
max = v
r = i
return r
def use_coupon(a, m):
current_index = 0
for _ in range(m):
index = max_index(a, current_i... | import math
from heapq import heappush, heappop
def rint(s):
return -int(s)
def sum(a):
s = 0
for v in a:
s += math.floor(-v)
return s
n, m = list(map(int, input().split(" ")))
a = list(map(rint, input().split(" ")))
a.sort()
for i in range(m):
v = heappop(a)
... | p02912 |
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
list.sort(A, reverse=True)
#print(A)
for m in range(M):
tmp = A[0] / 2
del A[0]
insindex = N
for i in range(len(A)):
if A[i] < tmp:
insindex = i
break
A.insert(insindex, tmp)
for i in r... | import heapq
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
q = []
for x in A:
heapq.heappush(q, -x)
for m in range(M):
x = heapq.heappop(q)
x /= 2
heapq.heappush(q, x)
ans = 0
for x in q:
ans += int(-x)
print(ans) | p02912 |
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
x = a.index(max(a))
a[x] //= 2
print((sum(a)))
| import heapq
n, m = list(map(int, input().split()))
a = [int(i) * (-1) for i in input().split()]
heapq.heapify(a)
for i in range(m):
x = heapq.heappop(a) * (-1) // 2
heapq.heappush(a, x * (-1))
print((-sum(a)))
| p02912 |
n,m=list(map(int, input().split()))
a=list(map(int, input().split()))
for i in range(m):
ma=max(a)
a.remove(ma)
a.append(ma//2)
print((sum(a)))
| import heapq
n,m=list(map(int, input().split()))
a=[-int(j) for j in input().split()]
heapq.heapify(a)
for i in range(m):
v=heapq.heappop(a)
heapq.heappush(a, -(-v//2))
print((-sum(a)))
| p02912 |
import math
n,a=list(map(int,input().split()))
list=list(map(int,input().split()))
list.sort()
x=0
for i in range(a):
x = max(list)/2
x=math.floor(x)
list.pop()
list.append(x)
list.sort()
print((sum(list))) | import heapq
N, M = list(map(int,input().split()))
h = []
for i in input().split():
heapq.heappush(h,-int(i))
for i in range(M):
x = -heapq.heappop(h)
x //=2
heapq.heappush(h,-x)
print((-sum(h))) | p02912 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.