結果
問題 | No.1690 Power Grid |
ユーザー | ansain |
提出日時 | 2021-06-30 20:08:59 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,107 bytes |
コンパイル時間 | 537 ms |
コンパイル使用メモリ | 86,736 KB |
実行使用メモリ | 83,120 KB |
最終ジャッジ日時 | 2023-09-18 20:22:58 |
合計ジャッジ時間 | 9,865 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,656 KB |
testcase_01 | AC | 100 ms
71,612 KB |
testcase_02 | AC | 139 ms
77,536 KB |
testcase_03 | AC | 95 ms
71,548 KB |
testcase_04 | AC | 94 ms
71,496 KB |
testcase_05 | AC | 95 ms
71,564 KB |
testcase_06 | AC | 391 ms
82,600 KB |
testcase_07 | AC | 384 ms
82,432 KB |
testcase_08 | AC | 387 ms
82,760 KB |
testcase_09 | AC | 386 ms
82,384 KB |
testcase_10 | AC | 397 ms
82,648 KB |
testcase_11 | WA | - |
testcase_12 | AC | 95 ms
71,656 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 445 ms
82,664 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 94 ms
71,436 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())) 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 adic = {2**i: [A[i], i] for i in range(n)} popcnt = [0]*2**n for bit in range(1, 2**n): a = bit & -bit popcnt[bit] = popcnt[bit ^ a]+1 if popcnt[bit] >= 2: dp[bit] = min(dp[bit], min(dp[bit ^ a]+adic[a][0]+cost[adic[a][1]][i] for i in range(n) if (bit ^ a) & (2**i))) else: dp[bit]=adic[a][0] if popcnt[bit] == k: ans = min(ans, dp[bit]) print(ans) if __name__ == '__main__': main()