結果

問題 No.1812 Uribo Road
ユーザー MasKoaTS
提出日時 2021-12-30 22:31:28
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,432 ms / 5,000 ms
コード長 1,467 bytes
コンパイル時間 271 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 174,824 KB
最終ジャッジ日時 2024-10-07 00:50:43
合計ジャッジ時間 14,430 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

import heapq
import sys
input = sys.stdin.readline
INF = 10 ** 18
N,M,K = map(int,input().split())
R = set([i-1 for i in map(int,input().split())])
lR = list(R)
route = [[] for _ in [0]*N]
edge = [0]*M
st = set([0,N-1])
for i in range(M):
    A,B,C = map(int,input().split())
    A -= 1; B -= 1
    if(i in R):
        edge[i] = [A,B,C]
        st.add(A);  st.add(B)
    if not(1 <= A+1 <= N and 1 <= B+1 <= N and 1 <= C <= 10**4):
        print((i,A+1,B+1,C))
        exit(1)
    route[A].append((B,C))
    route[B].append((A,C))
def dijkstra(route):
    dist = {}
    for i in st:
        q = [(0,i)]
        st2 = set([])
        while(q and len(st2) < len(st)):
            d,v = heapq.heappop(q)
            if((i,v) not in dist):
                if(v in st):
                    st2.add(v)
                dist[(i,v)] = d
                for nv,nd in route[v]:
                    heapq.heappush(q,(d + nd,nv))
    return dist
ans = INF
rsum = sum(edge[i][2] for i in R)
dist = dijkstra(route)
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] = rsum + dist[(0,edge[lR[i]][j])]
for bit in range(1, 1 << K):
    for s in range(K):
        if not(bit & (1 << s)):
            continue
        for i in range(2):
            for t in range(K):
                if not(bit & (1 << t)):
                    b = bit | (1 << t)
                    for j in range(2):
                        d = dp[bit][s][i ^ 1] + dist[(edge[lR[s]][i],edge[lR[t]][j])]
                        if(dp[b][t][j] > d):
                            dp[b][t][j] = d
ans = INF
for i in range(K):
    for j in range(2):
        d = dp[-1][i][j ^ 1] + dist[(edge[lR[i]][j],N - 1)]
        if(ans > d):
            ans = d
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0