結果
問題 | No.1812 Uribo Road |
ユーザー |
![]() |
提出日時 | 2022-11-05 00:33:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,056 ms / 5,000 ms |
コード長 | 3,231 bytes |
コンパイル時間 | 243 ms |
コンパイル使用メモリ | 82,308 KB |
実行使用メモリ | 233,932 KB |
最終ジャッジ日時 | 2024-07-18 21:59:00 |
合計ジャッジ時間 | 28,880 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
from typing import List, Tuple, Optionalimport sysimport itertoolsimport heapqimport bisectfrom collections import deque, defaultdictfrom functools import lru_cache, cmp_to_keyinput = sys.stdin.readline# for AtCoder Easy testif __file__ != 'prog.py':sys.setrecursionlimit(10 ** 6)def readints(): return map(int, input().split())def readlist(): return list(readints())def readstr(): return input().rstrip()class Dijkstra:def __init__(self, N: int, E: List[List[Tuple[int, int]]],start: int = 0, inf: int = 1 << 50):self.N = Nself.E = Eself.start = startself.inf = infself.C = [self.inf] * Nself.prev = [None] * Nself._calculate()def get_cost(self, i: int) -> int:"""return cost to i-th vertex. return inf if the vertex is unreachable."""return self.C[i]def get_path(self, i) -> Optional[List[int]]:"""return shortest path to i-th vertex if reachable otherwise None"""if not self.reachable(i):return Nonep = []cur = iwhile cur is not None:p.append(cur)cur = self.prev[cur]p.reverse()return pdef reachable(self, i) -> bool:"""return whether i-th vertex is reachable from start"""return self.C[i] < self.infdef _calculate(self) -> None:h = [(0, self.start)]self.C[self.start] = 0visited = [False] * self.Nwhile h:_, v = heapq.heappop(h)if visited[v] is True:continuevisited[v] = Truefor c, d in self.E[v]:if self.C[d] > self.C[v] + c:self.C[d] = self.C[v] + cself.prev[d] = vheapq.heappush(h, (self.C[d], d))N, M, K = readints()R = set(map(lambda x: int(x) - 1, input().split()))E = [[] for _ in range(N)]v = []path = []for i in range(M):a, b, c = readints()a -= 1b -= 1E[a].append((c, b))E[b].append((c, a))if i in R:v.append(a)v.append(b)path.append((a, b, c))V = sorted(set(v))idx = {}for i, a in enumerate(V):idx[a] = ipath = [(idx[a], idx[b], c) for a, b, c in path]C = [[0 for _ in range(len(V))] for _ in range(len(V))]for i in range(len(V)):for j in range(i + 1, len(V)):solver = Dijkstra(N, E, start=V[i])c = solver.get_cost(V[j])C[i][j] = cC[j][i] = cC0 = []solver = Dijkstra(N, E, start=0)for v in V:C0.append(solver.get_cost(v))CN = []solver = Dijkstra(N, E, start=N - 1)for v in V:CN.append(solver.get_cost(v))INF = 1 << 50dp = [[INF for _ in range(len(V))] for _ in range(1 << K)]for i in range(len(V)):dp[0][i] = C0[i]for s in range(1 << K):for j in range(K):a, b, c = path[j]if s & (1 << j):continuefor k in range(len(V)):nxt = s | (1 << j)dp[nxt][a] = min(dp[nxt][a], dp[s][k] + C[k][b] + c)dp[nxt][b] = min(dp[nxt][b], dp[s][k] + C[k][a] + c)ans = INFfor k in range(len(V)):ans = min(ans, dp[-1][k] + CN[k])print(ans)