結果

問題 No.1345 Beautiful BINGO
ユーザー mkawa2
提出日時 2023-05-10 15:08:41
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,419 ms / 2,000 ms
コード長 2,019 bytes
コンパイル時間 357 ms
コンパイル使用メモリ 82,296 KB
実行使用メモリ 77,644 KB
最終ジャッジ日時 2024-11-26 20:33:59
合計ジャッジ時間 23,204 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 61
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
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 = (1 << 63)-1
# md = 10**9+7
md = 998244353

def popcnt(a): return bin(a).count("1")

def f(s, m):
    if m == 0: return 0
    if m < 0 or m > n: return inf
    cc = []
    for j in range(n):
        cur = 0
        for i in range(n):
            if s >> i & 1: continue
            cur += a[i][j]
        cc.append(cur)
    cc.sort()
    return sum(cc[:m])

n, m = LI()
ori = LLI(n)

ans = inf

a = [r[:] for r in ori]
pre = 0
for s in range(1 << n):
    row = 0
    for i in range(n):
        if s >> i & 1: row += sum(a[i])
    ans=min(ans,f(s,m-popcnt(s))+pre+row)

a = [r[:] for r in ori]
pre = 0
for i in range(n):
    pre += a[i][i]
    a[i][i] = 0
for s in range(1 << n):
    row = 0
    for i in range(n):
        if s >> i & 1: row += sum(a[i])
    ans=min(ans,f(s,m-popcnt(s)-1)+pre+row)

a = [r[:] for r in ori]
pre = 0
for i in range(n):
    pre += a[i][n-1-i]
    a[i][n-1-i] = 0
for s in range(1 << n):
    row = 0
    for i in range(n):
        if s >> i & 1: row += sum(a[i])
    ans=min(ans,f(s,m-popcnt(s)-1)+pre+row)

a = [r[:] for r in ori]
pre = 0
for i in range(n):
    pre += a[i][i]
    a[i][i] = 0
    pre += a[i][n-1-i]
    a[i][n-1-i] = 0
for s in range(1 << n):
    row = 0
    for i in range(n):
        if s >> i & 1: row += sum(a[i])
    ans=min(ans,f(s,m-popcnt(s)-2)+pre+row)

print(ans)
0