結果

問題 No.3013 ハチマキ買い星人
ユーザー rlangevinrlangevin
提出日時 2025-01-27 12:13:36
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 733 ms / 2,000 ms
コード長 1,284 bytes
コンパイル時間 400 ms
コンパイル使用メモリ 82,348 KB
実行使用メモリ 115,984 KB
最終ジャッジ日時 2025-01-27 12:13:58
合計ジャッジ時間 21,621 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

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

import sys
input = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')
def dijkstra(s, g, N):
# 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, P, Y = map(int, input().split())
G = [[] for i in range(N)]
for i in range(M):
a, b, c = map(int, input().split())
a, b = a - 1, b - 1
G[a].append((b, c))
G[b].append((a, c))
inf = 10 ** 18 + 5
hachi = [inf] * N
for i in range(P):
d, e = map(int, input().split())
hachi[d - 1] = e
D = dijkstra(0, -1, N)
ans = 0
for i in range(N):
ans = max(ans, (Y - D[i])//hachi[i])
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0