結果

問題 No.2669 Generalized Hitting Set
ユーザー suisen
提出日時 2024-01-16 21:28:27
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,248 bytes
コンパイル時間 376 ms
コンパイル使用メモリ 82,116 KB
実行使用メモリ 210,624 KB
最終ジャッジ日時 2024-09-28 03:00:14
合計ジャッジ時間 34,630 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 11 WA * 6 RE * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
readline = sys.stdin.readline
popcnt = [0] * (2 ** 12)
for t in range(1, 2 ** 12):
popcnt[t] = 1 + popcnt[t & (t - 1)]
MASK_32 = 2 ** 32 - 1
n, m, k = map(int, readline().split())
binom = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(n + 1):
binom[i][0] = 1
for j in range(1, i + 1):
binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j]
f = [0] * (2 ** n)
for i in range(m):
# reversed, but it's ok
s = int(readline(), 2)
f[s] += 1
a = [0] * (n + 1)
for l in range(k, n + 1):
a[l] = binom[l - 1][l - k]
if a[l] and ((l - k) & 1):
a[l] = MASK_32 - a[l]
# supset zeta
b = 1
while b < 2 ** n:
for l in range(0, 2 ** n, 2 * b):
for p in range(l, l + b):
f[p] += f[p + b]
b *= 2
for t in range(2 ** n):
f[t] = (f[t] * a[popcnt[t >> 12] + popcnt[t & 0xfff]]) & MASK_32
# subset zeta
b = 1
while b < 2 ** n:
for l in range(0, 2 ** n, 2 * b):
for p in range(l, l + b):
f[p + b] += f[p]
b *= 2
g = [n + 1] * (m + 1)
for t in range(2 ** n):
f[t] &= MASK_32
g[f[t]] = min(g[f[t]], popcnt[t >> 12] + popcnt[t & 0xfff])
for p in reversed(range(m)):
g[p] = min(g[p], g[p + 1])
print('\n'.join(map(str, g[1:])))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0