結果
問題 | No.1814 Uribo Road (Easy) |
ユーザー | Shirotsume |
提出日時 | 2021-11-04 22:52:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 424 ms / 2,000 ms |
コード長 | 1,506 bytes |
コンパイル時間 | 282 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 80,000 KB |
最終ジャッジ日時 | 2024-05-01 17:30:39 |
合計ジャッジ時間 | 11,737 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
52,480 KB |
testcase_01 | AC | 52 ms
61,680 KB |
testcase_02 | AC | 42 ms
52,736 KB |
testcase_03 | AC | 42 ms
52,480 KB |
testcase_04 | AC | 42 ms
52,480 KB |
testcase_05 | AC | 42 ms
52,096 KB |
testcase_06 | AC | 52 ms
60,544 KB |
testcase_07 | AC | 42 ms
52,352 KB |
testcase_08 | AC | 42 ms
52,480 KB |
testcase_09 | AC | 75 ms
70,272 KB |
testcase_10 | AC | 76 ms
67,328 KB |
testcase_11 | AC | 113 ms
77,056 KB |
testcase_12 | AC | 141 ms
76,928 KB |
testcase_13 | AC | 120 ms
76,672 KB |
testcase_14 | AC | 147 ms
77,184 KB |
testcase_15 | AC | 255 ms
74,496 KB |
testcase_16 | AC | 376 ms
76,800 KB |
testcase_17 | AC | 402 ms
76,160 KB |
testcase_18 | AC | 424 ms
76,544 KB |
testcase_19 | AC | 417 ms
76,544 KB |
testcase_20 | AC | 344 ms
77,056 KB |
testcase_21 | AC | 382 ms
77,184 KB |
testcase_22 | AC | 335 ms
78,336 KB |
testcase_23 | AC | 369 ms
77,952 KB |
testcase_24 | AC | 346 ms
79,104 KB |
testcase_25 | AC | 362 ms
79,104 KB |
testcase_26 | AC | 358 ms
79,232 KB |
testcase_27 | AC | 383 ms
80,000 KB |
testcase_28 | AC | 380 ms
79,744 KB |
testcase_29 | AC | 383 ms
79,872 KB |
testcase_30 | AC | 371 ms
79,732 KB |
testcase_31 | AC | 376 ms
79,744 KB |
testcase_32 | AC | 131 ms
76,800 KB |
testcase_33 | AC | 80 ms
68,352 KB |
testcase_34 | AC | 65 ms
65,920 KB |
testcase_35 | AC | 134 ms
76,800 KB |
testcase_36 | AC | 101 ms
76,544 KB |
testcase_37 | AC | 149 ms
77,952 KB |
testcase_38 | AC | 183 ms
77,952 KB |
testcase_39 | AC | 116 ms
76,664 KB |
testcase_40 | AC | 150 ms
77,440 KB |
testcase_41 | AC | 362 ms
79,360 KB |
testcase_42 | AC | 259 ms
77,952 KB |
testcase_43 | AC | 127 ms
77,056 KB |
testcase_44 | AC | 162 ms
77,184 KB |
testcase_45 | AC | 116 ms
76,900 KB |
testcase_46 | AC | 357 ms
78,848 KB |
ソースコード
#嘘 INF = 10 ** 9 N, M, K = map(int,input().split()) #assert (1 <= N <= 200 and K <= 5 and 1 <= K <= M <= N * (N - 1) // 2) dist = [[0 if i == j else INF for i in range(N)] for j in range(N)] R = list(map(int,input().split())) points = [] nes_cost = 0 check_set = set() for i in range(M): A, B, C = map(int,input().split()) #assert(1 <= C <= 10 ** 4 and 1 <= A <= N and 1 <= B <= N and A != B) #assert((A, B) not in check_set and (B, A) not in check_set) if i + 1 in R: nes_cost += C points.append((A - 1, B - 1)) check_set.add((A, B)) dist[A - 1][B - 1] = C dist[B - 1][A - 1] = C for i in range(N): for j in range(N): for k in range(N): dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]) for i in range(N): for j in range(N): for k in range(N): dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]) for i in range(N): for j in range(N): for k in range(N): dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]) import itertools ans = INF for v in itertools.permutations(points): for i in range(2 ** K): now = 0 now_cost = nes_cost for j in range(K): x, y = v[j] if 1 & (i >> j): now_cost += dist[now][x] now = y else: now_cost += dist[now][y] now = x now_cost += dist[now][N - 1] ans = min(ans, now_cost) print(ans)