結果
問題 | No.1690 Power Grid |
ユーザー | mkawa2 |
提出日時 | 2021-09-24 22:25:08 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 776 ms / 3,000 ms |
コード長 | 1,435 bytes |
コンパイル時間 | 385 ms |
コンパイル使用メモリ | 86,876 KB |
実行使用メモリ | 79,996 KB |
最終ジャッジ日時 | 2023-09-18 21:42:55 |
合計ジャッジ時間 | 14,486 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
71,208 KB |
testcase_01 | AC | 75 ms
71,228 KB |
testcase_02 | AC | 91 ms
76,464 KB |
testcase_03 | AC | 71 ms
71,248 KB |
testcase_04 | AC | 73 ms
71,308 KB |
testcase_05 | AC | 71 ms
71,476 KB |
testcase_06 | AC | 634 ms
79,540 KB |
testcase_07 | AC | 630 ms
79,384 KB |
testcase_08 | AC | 630 ms
79,436 KB |
testcase_09 | AC | 629 ms
79,380 KB |
testcase_10 | AC | 737 ms
79,264 KB |
testcase_11 | AC | 635 ms
79,620 KB |
testcase_12 | AC | 74 ms
71,536 KB |
testcase_13 | AC | 92 ms
76,368 KB |
testcase_14 | AC | 165 ms
77,656 KB |
testcase_15 | AC | 752 ms
79,996 KB |
testcase_16 | AC | 737 ms
79,896 KB |
testcase_17 | AC | 395 ms
78,516 KB |
testcase_18 | AC | 333 ms
78,440 KB |
testcase_19 | AC | 701 ms
79,564 KB |
testcase_20 | AC | 714 ms
79,348 KB |
testcase_21 | AC | 762 ms
79,340 KB |
testcase_22 | AC | 705 ms
79,700 KB |
testcase_23 | AC | 695 ms
79,240 KB |
testcase_24 | AC | 776 ms
79,528 KB |
testcase_25 | AC | 741 ms
79,780 KB |
testcase_26 | AC | 745 ms
79,432 KB |
testcase_27 | AC | 74 ms
71,392 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 md = 998244353 # md = 10**9+7 n, m, k = LI() aa = LI() to = [[] for _ in range(n)] dist=[[inf]*n for _ in range(n)] for u in range(n):dist[u][u]=0 for _ in range(m): u, v, z = LI() u, v = u-1, v-1 dist[u][v]=dist[v][u]=z for v in range(n): for u in range(n): for w in range(n): dist[u][w]=min(dist[u][w],dist[u][v]+dist[v][w]) dp = [inf]*(1 << n) for u, a in enumerate(aa): dp[1 << u] = a for s in range(1 << n): for u in range(n): if s >> u & 1: continue cost = inf for v in range(n): if s >> v & 1 and dist[u][v] < cost: cost = dist[u][v] dp[s | 1 << u] = min(dp[s | 1 << u], dp[s]+cost+aa[u]) popcnt = lambda x: bin(x).count("1") ans = inf for s in range(1 << n): if popcnt(s) == k and dp[s] < ans: ans = dp[s] print(ans)