| 提出番号 | 2334 |
|---|---|
| 提出者 | efunyo |
| 言語 | Python3 |
| 提出日時 | 2020-03-24 22:24:16 |
| 問題名 | (70)アルゴリズムのお勉強 |
| 結果 | AC |
| 点数 | 100% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | AC | 100% | 26ms | 35200KB |
| 2 | AC | 100% | 26ms | 34800KB |
| 3 | AC | 100% | 27ms | 34592KB |
| 4 | AC | 100% | 25ms | 35328KB |
| 5 | AC | 100% | 26ms | 35344KB |
| 6 | AC | 100% | 28ms | 34960KB |
| 7 | AC | 100% | 26ms | 34832KB |
| 8 | AC | 100% | 26ms | 34752KB |
| 9 | AC | 100% | 26ms | 35056KB |
| 10 | AC | 100% | 27ms | 35008KB |
| 11 | AC | 100% | 39ms | 35312KB |
| 12 | AC | 100% | 31ms | 34992KB |
| 13 | AC | 100% | 39ms | 34880KB |
| 14 | AC | 100% | 33ms | 34768KB |
| 15 | AC | 100% | 33ms | 34736KB |
| 16 | AC | 100% | 28ms | 34352KB |
| 17 | AC | 100% | 27ms | 34976KB |
| 18 | AC | 100% | 26ms | 34352KB |
| 19 | AC | 100% | 58ms | 34864KB |
| 20 | AC | 100% | 60ms | 35008KB |
| 21 | AC | 100% | 28ms | 35360KB |
| 22 | AC | 100% | 102ms | 34432KB |
| 23 | AC | 100% | 28ms | 34960KB |
| 24 | AC | 100% | 195ms | 35744KB |
| 25 | AC | 100% | 58ms | 34944KB |
| 26 | AC | 100% | 104ms | 34800KB |
| 27 | AC | 100% | 196ms | 36128KB |
| 28 | AC | 100% | 58ms | 35088KB |
| 29 | AC | 100% | 882ms | 40112KB |
| 30 | AC | 100% | 101ms | 35248KB |
#https://kotamanegi.com/Problems/view/index.php?page=70
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
from bisect import bisect_left,bisect_right
import heapq
from math import floor, ceil
#from operator import itemgetter
#inf = 10**17
#mod = 10**9 + 7
N = int(input())
t = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(N)]
inf = 10**6
#dp[s]:sは学習済みのアルゴリズム
# dp[s]はその時かかっている時間
dp = [inf]*(1<<N)
dp[0] = 0
for s in range(1<<N):
for i in range(N):
if (s>>i) & 1:
continue
hiku = 0
for j in range(N):
if (s>>j) & 1:
hiku += a[j][i]
ns = s |1<<i
dp[ns] = min(dp[ns], dp[s]+t[i]-hiku)
print(dp[-1])
if __name__ == '__main__':
main()