結果

問題 No.2669 Generalized Hitting Set
ユーザー suisen
提出日時 2024-01-14 02:59:50
言語 PyPy3
(7.3.15)
結果
MLE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,136 bytes
コンパイル時間 482 ms
コンパイル使用メモリ 82,116 KB
実行使用メモリ 348,252 KB
最終ジャッジ日時 2024-09-28 02:44:13
合計ジャッジ時間 43,135 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other MLE * 41
権限があれば一括ダウンロードができます

ソースコード

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

import sys
N_MAX = 24
popcnt = [0] * (1 << N_MAX)
for t in range(1, 1 << N_MAX):
popcnt[t] = 1 + popcnt[t & (t - 1)]
f = [0] * (1 << N_MAX)
readline = sys.stdin.readline
n, m, k = map(int, readline().split())
s = [0] * m
for i in range(m):
# reversed, but it's ok
s[i] = int(readline(), 2)
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]
a = [0] * (n + 1)
for l in range(k, n + 1):
a[l] = 1
for i in range(k, l):
a[l] -= a[i] * binom[l][i]
for u in s:
f[u] += 1
b = 1
while b < 1 << n:
for l in range(0, 1 << n, 2 * b):
for p in range(l, l + b):
f[p] += f[p + b]
b *= 2
for t in range(1 << n):
f[t] *= a[popcnt[t]]
b = 1
while b < 1 << n:
for l in range(0, 1 << 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(1 << n):
g[f[t]] = min(g[f[t]], popcnt[t])
for p in reversed(range(m)):
g[p] = min(g[p], g[p + 1])
print('\n'.join(map(str, g[1:])))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0