結果

問題 No.2739 Time is money
ユーザー rlangevin
提出日時 2024-04-20 14:20:11
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 773 ms / 2,000 ms
コード長 1,170 bytes
コンパイル時間 149 ms
コンパイル使用メモリ 82,364 KB
実行使用メモリ 119,500 KB
最終ジャッジ日時 2024-10-12 09:52:13
合計ジャッジ時間 9,905 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

import sys
input = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')
def dijkstra(s, g, G):
# g=-1
N = len(G)
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())
G = [[] for i in range(N)]
for i in range(M):
u, v, c, t = map(int, input().split())
u, v = u - 1, v - 1
G[u].append((v, t * X + c))
G[v].append((u, t * X + c))
D = dijkstra(0, N - 1, G)
print((D[-1]+X-1)//X) if D[-1] != inf else print("-1")
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0