結果
問題 | No.1814 Uribo Road (Easy) |
ユーザー | MasKoaTS |
提出日時 | 2021-10-25 14:35:48 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 928 ms / 2,000 ms |
コード長 | 1,019 bytes |
コンパイル時間 | 246 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 13,796 KB |
最終ジャッジ日時 | 2024-05-01 17:29:16 |
合計ジャッジ時間 | 15,921 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
10,880 KB |
testcase_01 | AC | 48 ms
10,880 KB |
testcase_02 | AC | 27 ms
10,880 KB |
testcase_03 | AC | 26 ms
10,752 KB |
testcase_04 | AC | 26 ms
10,752 KB |
testcase_05 | AC | 27 ms
10,752 KB |
testcase_06 | AC | 28 ms
10,752 KB |
testcase_07 | AC | 26 ms
10,752 KB |
testcase_08 | AC | 27 ms
10,752 KB |
testcase_09 | AC | 44 ms
10,752 KB |
testcase_10 | AC | 30 ms
10,880 KB |
testcase_11 | AC | 47 ms
11,136 KB |
testcase_12 | AC | 85 ms
11,136 KB |
testcase_13 | AC | 58 ms
11,008 KB |
testcase_14 | AC | 113 ms
11,392 KB |
testcase_15 | AC | 482 ms
11,776 KB |
testcase_16 | AC | 831 ms
12,160 KB |
testcase_17 | AC | 883 ms
12,288 KB |
testcase_18 | AC | 848 ms
12,288 KB |
testcase_19 | AC | 803 ms
12,288 KB |
testcase_20 | AC | 518 ms
12,288 KB |
testcase_21 | AC | 626 ms
11,904 KB |
testcase_22 | AC | 508 ms
13,056 KB |
testcase_23 | AC | 596 ms
12,416 KB |
testcase_24 | AC | 510 ms
12,928 KB |
testcase_25 | AC | 467 ms
12,928 KB |
testcase_26 | AC | 558 ms
13,184 KB |
testcase_27 | AC | 618 ms
13,412 KB |
testcase_28 | AC | 623 ms
13,540 KB |
testcase_29 | AC | 629 ms
13,412 KB |
testcase_30 | AC | 922 ms
13,668 KB |
testcase_31 | AC | 928 ms
13,796 KB |
testcase_32 | AC | 93 ms
11,136 KB |
testcase_33 | AC | 38 ms
10,880 KB |
testcase_34 | AC | 30 ms
10,752 KB |
testcase_35 | AC | 104 ms
11,520 KB |
testcase_36 | AC | 51 ms
10,880 KB |
testcase_37 | AC | 84 ms
11,264 KB |
testcase_38 | AC | 151 ms
11,648 KB |
testcase_39 | AC | 59 ms
11,008 KB |
testcase_40 | AC | 76 ms
11,264 KB |
testcase_41 | AC | 546 ms
13,056 KB |
testcase_42 | AC | 326 ms
11,904 KB |
testcase_43 | AC | 82 ms
11,136 KB |
testcase_44 | AC | 162 ms
11,648 KB |
testcase_45 | AC | 42 ms
11,008 KB |
testcase_46 | AC | 525 ms
13,056 KB |
ソースコード
import itertools import sys input = sys.stdin.readline N,M,K = map(int,input().split()) R = [i-1 for i in map(int,input().split())] INF = 10**9 dist = [[INF]*N for _ in [0]*N] route = [[0]*2 for _ in [0]*M] for i in range(M): A,B,C = map(int,input().split()) A -= 1; B -= 1 route[i] = [A,B,C] dist[A][B] = dist[B][A] = C def warshall_floyd(dist): for i in range(N): dist[i][i] = 0 for k in range(N): for i in range(N): for j in range(N): d = dist[i][k]+dist[k][j] if(dist[i][j] > d): dist[i][j] = d return 0 warshall_floyd(dist) ans = INF rsum = sum(route[i][2] for i in R) for rlist in itertools.permutations(R): for bit in range(1 << K): s = rsum path = [0] for i in range(K): if(bit & (1 << i)): path.append(route[rlist[i]][0]) path.append(route[rlist[i]][1]) else: path.append(route[rlist[i]][1]) path.append(route[rlist[i]][0]) path.append(N-1) s += sum(dist[path[i]][path[i+1]] for i in range(0,len(path)-1,2)) if(ans > s): ans = s print(ans)