結果

問題 No.1812 Uribo Road
ユーザー MasKoaTS
提出日時 2022-01-13 22:48:11
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 2,194 ms / 5,000 ms
コード長 1,873 bytes
コンパイル時間 79 ms
コンパイル使用メモリ 13,184 KB
実行使用メモリ 35,968 KB
最終ジャッジ日時 2024-11-17 16:52:46
合計ジャッジ時間 23,110 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from copy import deepcopy as dcopy
import math
import sys
sys.setrecursionlimit(10**6)
def input():
    return sys.stdin.readline().rstrip()
def getN():
	return int(sys.stdin.readline())
def getNs():
	return map(int,sys.stdin.readline().split())
def getList():
	return list(map(int,sys.stdin.readline().split()))
def strinps(n):
	return [sys.stdin.readline().rstrip() for _ in range(n)]
pi = 3.141592653589793
mod = 10**9+7
MOD = 998244353
INF = math.inf
dx = [1,0,-1,0];	dy = [0,1,0,-1]


"""
Main Code
"""

N, M, K = getNs()
R = [i - 1 for i in getNs()]
S = set(R)

route = [[] for _ in [0] * N]
edge = []
for _ in [0] * M:
	a, b, c = getNs()
	a -= 1;	b -= 1
	edge.append((a, b, c))
	route[a].append((b,c))
	route[b].append((a,c))

def dijkstra(s):
	path = [-1] * N
	que = [(0, s)]
	while(que):
		d, v = hq.heappop(que)
		if(path[v] != -1):
			continue
		path[v] = d
		for nv, nd in route[v]:
			hq.heappush(que, (d + nd, nv))
	return path

dist = [[] for _ in [0] * N]
T = set([0, N - 1])
for i in S:
	T.add(edge[i][0])
	T.add(edge[i][1])
for i in T:
	dist[i] = dijkstra(i)

dp = [[[INF] * 2 for _ in [0] * K] for _ in [0] * (1 << K)]
for i in range(K):
	for j in range(2):
		dp[1 << i][i][j] = dist[0][edge[R[i]][j ^ 1]] + edge[R[i]][2]
for bit in range(1, 1 << K):
	for s in range(K):
		if not((bit >> s) & 1):
			continue
		for t in range(K):
			if((bit >> t) & 1):
				continue
			for x in range(2):
				for y in range(2):
					b = bit | (1 << t)
					p = edge[R[s]][x]
					q = edge[R[t]][y ^ 1]
					d = dp[bit][s][x] + dist[p][q] + edge[R[t]][2]
					if(dp[b][t][y] > d):
						dp[b][t][y] = d
ans = INF
for i in range(K):
	for j in range(2):
		p = edge[R[i]][j]
		d = dp[-1][i][j] + dist[p][N - 1]
		if(ans > d):
			ans = d
print(ans)
0