結果
問題 | No.1690 Power Grid |
ユーザー | ansain |
提出日時 | 2021-06-30 20:25:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 920 ms / 3,000 ms |
コード長 | 2,329 bytes |
コンパイル時間 | 1,073 ms |
コンパイル使用メモリ | 87,064 KB |
実行使用メモリ | 82,628 KB |
最終ジャッジ日時 | 2023-09-18 20:23:36 |
合計ジャッジ時間 | 13,759 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,512 KB |
testcase_01 | AC | 93 ms
71,588 KB |
testcase_02 | AC | 93 ms
71,508 KB |
testcase_03 | AC | 93 ms
71,564 KB |
testcase_04 | AC | 93 ms
71,488 KB |
testcase_05 | AC | 94 ms
71,300 KB |
testcase_06 | AC | 462 ms
81,992 KB |
testcase_07 | AC | 462 ms
82,004 KB |
testcase_08 | AC | 461 ms
81,972 KB |
testcase_09 | AC | 459 ms
81,892 KB |
testcase_10 | AC | 119 ms
81,792 KB |
testcase_11 | AC | 876 ms
82,160 KB |
testcase_12 | AC | 95 ms
71,560 KB |
testcase_13 | AC | 123 ms
77,576 KB |
testcase_14 | AC | 197 ms
78,920 KB |
testcase_15 | AC | 918 ms
82,080 KB |
testcase_16 | AC | 496 ms
82,020 KB |
testcase_17 | AC | 326 ms
80,024 KB |
testcase_18 | AC | 210 ms
78,880 KB |
testcase_19 | AC | 497 ms
82,360 KB |
testcase_20 | AC | 506 ms
82,628 KB |
testcase_21 | AC | 93 ms
71,832 KB |
testcase_22 | AC | 901 ms
82,404 KB |
testcase_23 | AC | 912 ms
82,304 KB |
testcase_24 | AC | 909 ms
82,208 KB |
testcase_25 | AC | 920 ms
82,340 KB |
testcase_26 | AC | 913 ms
82,000 KB |
testcase_27 | AC | 93 ms
71,564 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial # from math import isqrt, prod,comb # python3.8用(notpypy) #from bisect import bisect_left,bisect_right #from functools import lru_cache,reduce #from heapq import heappush,heappop,heapify,heappushpop,heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) def main(): mod = 10**9+7 mod2 = 998244353 n, m, k = map(int, input().split()) A = list(map(int, input().split())) if k==1: print(min(A)) return cost = [[float("inf")]*n for i in range(n)] for i in range(m): x, y, z = map(int, input().split()) x -= 1 y -= 1 cost[x][y] = z cost[y][x] = z for i in range(n): cost[i][i] = 0 for kk in range(n): for ii in range(n): for jj in range(n): cost[ii][jj] = min(cost[ii][jj], cost[ii][kk] + cost[kk][jj]) ans = 10**12 dp = [10**12]*2**n dp[0] == 0 popcnt = [0]*2**n for bit in range(1, 2**n): popcnt[bit] = popcnt[bit ^ (bit & (-bit))]+1 if 2 <= popcnt[bit] <= k: for i in range(n): if bit & 2**i: for j in range(i+1, n): if bit & 2**j: dp[bit] = min( A[i]+cost[i][j]+dp[bit ^ (2**i)], A[j]+cost[i][j]+dp[bit ^ (2**j)], dp[bit]) if popcnt[bit]==k and ans > dp[bit]: ans=dp[bit] elif popcnt[bit]==1: for i in range(n): if bit & 2**i: dp[bit]=A[i] print(ans) if __name__ == '__main__': main()