結果

問題 No.1812 Uribo Road
ユーザー tobusakana
提出日時 2022-10-23 20:15:10
言語 PyPy3
(7.3.15)
結果
MLE  
実行時間 -
コード長 1,440 bytes
コンパイル時間 362 ms
コンパイル使用メモリ 82,572 KB
実行使用メモリ 777,784 KB
最終ジャッジ日時 2024-07-02 10:37:21
合計ジャッジ時間 8,948 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 8 MLE * 1 -- * 21
権限があれば一括ダウンロードができます

ソースコード

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

import sys
readline = sys.stdin.readline
# dp[v][S] = Sv
N,M,K = map(int,readline().split())
R = list(map(int,readline().split()))
Rdic = {} #
for i in range(K):
Rdic[R[i] - 1] = i
G = [[] for i in range(N)]
for i in range(M):
a,b,c = map(int,readline().split())
ino = -1
if i in Rdic: #
ino = Rdic[i] #
G[a - 1].append([b - 1, c, ino])
G[b - 1].append([a - 1, c, ino])
INF = 1 << 60
dp = [[INF] * (1 << K) for i in range(N)]
best = [[INF] * (1 << K) for i in range(N)]
import heapq as hq
q = []
hq.heappush(q, (0, 0, 0)) #
complete = (1 << K) - 1
while q:
d,v,status = hq.heappop(q)
if dp[v][status] != INF:
continue
dp[v][status] = d
if v == N - 1 and status == complete:
print(dp[v][status])
break
for child, cost, ino in G[v]:
if ino != -1:
next_status = status | (1 << ino)
if dp[child][next_status] != INF or best[child][next_status] <= d + cost:
continue
best[child][next_status] = d + cost
hq.heappush(q, (d + cost, child, status | (1 << ino)))
else:
if dp[child][status] != INF or best[child][status] <= d + cost:
continue
best[child][status] = d + cost
hq.heappush(q, (d + cost, child, status))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0