結果
問題 | No.1345 Beautiful BINGO |
ユーザー | chineristAC |
提出日時 | 2021-01-16 13:42:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 720 ms / 2,000 ms |
コード長 | 1,502 bytes |
コンパイル時間 | 583 ms |
コンパイル使用メモリ | 87,208 KB |
実行使用メモリ | 86,016 KB |
最終ジャッジ日時 | 2023-08-18 23:59:01 |
合計ジャッジ時間 | 18,812 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge9 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 83 ms
71,284 KB |
testcase_01 | AC | 87 ms
70,936 KB |
testcase_02 | AC | 91 ms
71,092 KB |
testcase_03 | AC | 85 ms
71,052 KB |
testcase_04 | AC | 84 ms
71,116 KB |
testcase_05 | AC | 92 ms
75,172 KB |
testcase_06 | AC | 86 ms
71,256 KB |
testcase_07 | AC | 144 ms
77,376 KB |
testcase_08 | AC | 81 ms
71,260 KB |
testcase_09 | AC | 82 ms
70,984 KB |
testcase_10 | AC | 84 ms
71,064 KB |
testcase_11 | AC | 90 ms
75,148 KB |
testcase_12 | AC | 82 ms
71,344 KB |
testcase_13 | AC | 120 ms
77,668 KB |
testcase_14 | AC | 75 ms
71,348 KB |
testcase_15 | AC | 74 ms
71,120 KB |
testcase_16 | AC | 76 ms
71,376 KB |
testcase_17 | AC | 78 ms
71,120 KB |
testcase_18 | AC | 74 ms
71,268 KB |
testcase_19 | AC | 74 ms
71,184 KB |
testcase_20 | AC | 74 ms
70,956 KB |
testcase_21 | AC | 78 ms
71,180 KB |
testcase_22 | AC | 223 ms
81,528 KB |
testcase_23 | AC | 526 ms
79,956 KB |
testcase_24 | AC | 344 ms
78,796 KB |
testcase_25 | AC | 183 ms
79,752 KB |
testcase_26 | AC | 339 ms
81,244 KB |
testcase_27 | AC | 503 ms
79,524 KB |
testcase_28 | AC | 199 ms
80,448 KB |
testcase_29 | AC | 231 ms
78,984 KB |
testcase_30 | AC | 205 ms
79,232 KB |
testcase_31 | AC | 227 ms
81,736 KB |
testcase_32 | AC | 149 ms
78,452 KB |
testcase_33 | AC | 519 ms
79,996 KB |
testcase_34 | AC | 169 ms
79,212 KB |
testcase_35 | AC | 167 ms
79,016 KB |
testcase_36 | AC | 706 ms
82,776 KB |
testcase_37 | AC | 177 ms
79,000 KB |
testcase_38 | AC | 400 ms
82,332 KB |
testcase_39 | AC | 585 ms
81,948 KB |
testcase_40 | AC | 380 ms
79,892 KB |
testcase_41 | AC | 543 ms
82,920 KB |
testcase_42 | AC | 73 ms
71,288 KB |
testcase_43 | AC | 73 ms
71,352 KB |
testcase_44 | AC | 73 ms
71,184 KB |
testcase_45 | AC | 72 ms
71,148 KB |
testcase_46 | AC | 72 ms
71,120 KB |
testcase_47 | AC | 74 ms
70,980 KB |
testcase_48 | AC | 77 ms
71,084 KB |
testcase_49 | AC | 79 ms
71,360 KB |
testcase_50 | AC | 77 ms
70,988 KB |
testcase_51 | AC | 76 ms
71,268 KB |
testcase_52 | AC | 586 ms
86,016 KB |
testcase_53 | AC | 566 ms
83,100 KB |
testcase_54 | AC | 504 ms
79,944 KB |
testcase_55 | AC | 552 ms
80,212 KB |
testcase_56 | AC | 612 ms
85,648 KB |
testcase_57 | AC | 571 ms
80,040 KB |
testcase_58 | AC | 539 ms
79,828 KB |
testcase_59 | AC | 529 ms
79,616 KB |
testcase_60 | AC | 720 ms
85,800 KB |
testcase_61 | AC | 548 ms
80,448 KB |
testcase_62 | AC | 523 ms
79,276 KB |
ソースコード
N,M = map(int,input().split()) A = [list(map(int,input().split())) for i in range(N)] S = [sum(A[j][i] for j in range(N)) for i in range(N)] tmp_A = [[A[i][j] for j in range(N)] for i in range(N)] tmp_S = [S[i] for i in range(N)] def dfs(i,cost,cnt): res = 10**18 if i==N+2: column = [tmp_S[j] for j in range(N)] column.sort() cost += sum(column[:cnt]) return cost elif i<N: tmp1 = dfs(i+1,cost,cnt) for j in range(N): tmp_A[i][j] = 0 cost += A[i][j] tmp_S[j] -= A[i][j] tmp2 = dfs(i+1,cost,cnt-1) for j in range(N): tmp_A[i][j] = A[i][j] tmp_S[j] += A[i][j] return min(res,tmp1,tmp2) elif i==N: tmp1 = dfs(i+1,cost,cnt) memo = [tmp_A[j][j] for j in range(N)] for j in range(N): tmp_A[j][j] = 0 cost += memo[j] tmp_S[j] -= memo[j] tmp2 = dfs(i+1,cost,cnt-1) for j in range(N): tmp_A[j][j] = memo[j] tmp_S[j] += memo[j] return min(res,tmp1,tmp2) else: tmp1 = dfs(i+1,cost,cnt) memo = [tmp_A[N-1-j][j] for j in range(N)] for j in range(N): tmp_A[N-1-j][j] = 0 cost += memo[j] tmp_S[j] -= memo[j] tmp2 = dfs(i+1,cost,cnt-1) for j in range(N): tmp_A[N-1-j][j] = memo[j] tmp_S[j] += memo[j] return min(res,tmp1,tmp2) print(dfs(0,0,M))