結果
問題 | No.2669 Generalized Hitting Set |
ユーザー |
👑 |
提出日時 | 2024-04-01 23:18:16 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 1,129 bytes |
コンパイル時間 | 455 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 348,672 KB |
最終ジャッジ日時 | 2024-09-30 22:45:20 |
合計ジャッジ時間 | 43,098 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 32 TLE * 1 MLE * 8 |
ソースコード
import sys input = sys.stdin.readline n, m, k = map(int, input().split()) PC = [0] * (1 << n) for i in range(1, 1 << n): p = i & -i PC[i] = PC[i ^ p] + 1 nCk = [[0] * (n + 1) for _ in range(n + 1)] nCk[0][0] = 1 for i in range(1, n + 1): nCk[i][0] = 1 for j in range(1, i + 1): nCk[i][j] = nCk[i - 1][j - 1] + nCk[i - 1][j] dp = [0] * (1 << n) for _ in range(m): S = int(input(), 2) dp[S] += 1 C = [0] * (n + 1) C[k] = 1 for i in range(k + 1, n + 1): C[i] = 1 for j in range(i): C[i] -= C[j] * nCk[i][j] for i in range(n): dbit = 1 << i for s in range(0, 1 << n, 2 * dbit): for j in range(dbit): dp[s + j] += dp[s + dbit + j] for bit in range(1 << n): dp[bit] *= C[PC[bit]] for i in range(n): dbit = 1 << i for s in range(0, 1 << n, 2 * dbit): for j in range(dbit): dp[s + dbit + j] += dp[s + j] ans = [1 << 30] * m for bit in range(1 << n): c = dp[bit] - 1 if c >= 0: ans[c] = min(ans[c], PC[bit]) for i in range(m - 2, -1, -1): ans[i] = min(ans[i], ans[i + 1]) print(*ans, sep="\n")