結果
問題 | No.2669 Generalized Hitting Set |
ユーザー | suisen |
提出日時 | 2024-01-14 02:49:54 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,688 bytes |
コンパイル時間 | 175 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 202,036 KB |
最終ジャッジ日時 | 2024-01-16 20:56:35 |
合計ジャッジ時間 | 9,138 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
ソースコード
from typing import List import sys def supset_zeta(f: List[int]): n = len(f) b = 1 while b < n: l = 0 while l < n: for p in range(l, l + b): f[p] += f[p + b] l += 2 * b b *= 2 def subset_zeta(f: List[int]): n = len(f) b = 1 while b < n: l = 0 while l < n: for p in range(l, l + b): f[p + b] += f[p] l += 2 * b b *= 2 N_MAX = 24 popcnt = [0] * (1 << N_MAX) for t in range(1, 1 << N_MAX): popcnt[t] = 1 + popcnt[t & (t - 1)] def calc_f(n: int, m: int, k: int, s: List[int]): 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] f = [0] * (1 << n) for u in s: f[u] += 1 supset_zeta(f) for t in range(1 << n): f[t] *= a[popcnt[t]] subset_zeta(f) return f def calc_g(n: int, m: int, f: List[int]): 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]) return g if __name__ == '__main__': readline = sys.stdin.readline n, m, k = map(int, readline.split()) s = [0] * m for i in range(m): si = readline() for j in range(n): s[i] |= (si[j] == '1') << j f = calc_f(n, m, k, s) g = calc_g(n, m, f) print('\n'.join(map(str, g[1:])))