結果

問題 No.2387 Yokan Factory
ユーザー rlangevin
提出日時 2023-07-21 21:42:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,823 ms / 5,000 ms
コード長 1,447 bytes
コンパイル時間 163 ms
コンパイル使用メモリ 82,388 KB
実行使用メモリ 278,888 KB
最終ジャッジ日時 2024-09-21 23:09:35
合計ジャッジ時間 22,486 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
input = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')
def dijkstra(s, g, N, G):
# g=-1
def cost(v, m):
return v * N + m
dist = [inf] * N
mindist = [inf] * N
seen = [False] * N
Q = [cost(0, s)]
while Q:
c, m = divmod(heappop(Q), N)
if seen[m]:
continue
seen[m] = True
dist[m] = c
if m == g:
return dist
#------heap--------
for u, C in G[m]:
if seen[u]:
continue
newdist = dist[m] + C
#------------------------------------
if newdist >= mindist[u]:
continue
mindist[u] = newdist
heappush(Q, cost(newdist, u))
return dist
N, M, X = map(int, input().split())
Edge = []
for i in range(M):
Edge.append(list(map(int, input().split())))
def check(m):
G = [[] for i in range(N)]
for u, v, a, b in Edge:
if b < m:
continue
u, v = u - 1, v - 1
G[u].append((v, a))
G[v].append((u, a))
D = dijkstra(0, N - 1, N, G)
return D[-1] <= X
if not check(0):
print(-1)
exit()
yes = 0
no = 10 ** 18 + 5
while no - yes != 1:
mid = (yes + no)//2
if check(mid):
yes = mid
else:
no = mid
print(yes)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0