結果
問題 | No.2669 Generalized Hitting Set |
ユーザー | 👑 rin204 |
提出日時 | 2024-04-02 20:16:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,590 ms / 4,000 ms |
コード長 | 1,197 bytes |
コンパイル時間 | 474 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 216,700 KB |
最終ジャッジ日時 | 2024-04-02 20:17:08 |
合計ジャッジ時間 | 33,206 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
59,580 KB |
testcase_01 | AC | 40 ms
59,580 KB |
testcase_02 | AC | 51 ms
64,320 KB |
testcase_03 | AC | 104 ms
81,940 KB |
testcase_04 | AC | 96 ms
80,660 KB |
testcase_05 | AC | 92 ms
79,892 KB |
testcase_06 | AC | 122 ms
82,836 KB |
testcase_07 | AC | 65 ms
76,692 KB |
testcase_08 | AC | 71 ms
77,204 KB |
testcase_09 | AC | 99 ms
80,276 KB |
testcase_10 | AC | 83 ms
78,228 KB |
testcase_11 | AC | 77 ms
77,076 KB |
testcase_12 | AC | 122 ms
81,428 KB |
testcase_13 | AC | 2,525 ms
206,768 KB |
testcase_14 | AC | 320 ms
92,080 KB |
testcase_15 | AC | 62 ms
68,496 KB |
testcase_16 | AC | 128 ms
79,920 KB |
testcase_17 | AC | 319 ms
92,080 KB |
testcase_18 | AC | 59 ms
66,424 KB |
testcase_19 | AC | 96 ms
77,696 KB |
testcase_20 | AC | 57 ms
66,424 KB |
testcase_21 | AC | 125 ms
79,920 KB |
testcase_22 | AC | 74 ms
73,604 KB |
testcase_23 | AC | 187 ms
84,760 KB |
testcase_24 | AC | 139 ms
82,452 KB |
testcase_25 | AC | 227 ms
87,320 KB |
testcase_26 | AC | 2,590 ms
208,732 KB |
testcase_27 | AC | 138 ms
80,920 KB |
testcase_28 | AC | 2,512 ms
216,444 KB |
testcase_29 | AC | 2,541 ms
216,700 KB |
testcase_30 | AC | 2,446 ms
216,464 KB |
testcase_31 | AC | 2,458 ms
216,464 KB |
testcase_32 | AC | 2,370 ms
216,460 KB |
testcase_33 | AC | 193 ms
85,016 KB |
testcase_34 | AC | 157 ms
84,244 KB |
testcase_35 | AC | 691 ms
114,840 KB |
testcase_36 | AC | 41 ms
59,580 KB |
testcase_37 | AC | 189 ms
83,888 KB |
testcase_38 | AC | 65 ms
71,056 KB |
testcase_39 | AC | 2,525 ms
216,672 KB |
testcase_40 | AC | 2,550 ms
216,420 KB |
ソースコード
import sys input = sys.stdin.readline n, m, k = map(int, input().split()) PC = [0] * (1 << 12) for i in range(1, 1 << 12): p = i & -i PC[i] = PC[i ^ p] + 1 dp = [0] * (1 << n) for _ in range(m): S = int(input(), 2) dp[S] += 1 for i in range(n): dbit = 1 << i for s in range(0, 1 << n, 2 * dbit): for j in range(s, s + dbit): dp[j] += dp[dbit + j] 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] 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 bit in range(1 << n): p = PC[bit >> 12] + PC[bit & 4095] dp[bit] *= C[p] for i in range(n): dbit2 = 1 << i for s in range(0, 1 << n, 2 * dbit2): for j in range(s, s + dbit2): dp[dbit2 + j] += dp[j] ans = [n] * m for bit in range(1 << n): c = dp[bit] - 1 if c >= 0: p = PC[bit >> 12] + PC[bit & 4095] ans[c] = min(ans[c], p) for i in range(m - 2, -1, -1): ans[i] = min(ans[i], ans[i + 1]) print(*ans, sep="\n")