結果
問題 | No.2669 Generalized Hitting Set |
ユーザー | chineristAC |
提出日時 | 2024-01-14 01:51:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,534 ms / 4,000 ms |
コード長 | 1,279 bytes |
コンパイル時間 | 145 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 220,044 KB |
最終ジャッジ日時 | 2024-01-16 20:54:51 |
合計ジャッジ時間 | 24,640 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
66,492 KB |
testcase_01 | AC | 53 ms
66,492 KB |
testcase_02 | AC | 61 ms
69,080 KB |
testcase_03 | AC | 124 ms
84,292 KB |
testcase_04 | AC | 114 ms
83,140 KB |
testcase_05 | AC | 109 ms
81,988 KB |
testcase_06 | AC | 140 ms
86,212 KB |
testcase_07 | AC | 82 ms
78,148 KB |
testcase_08 | AC | 89 ms
78,916 KB |
testcase_09 | AC | 118 ms
82,628 KB |
testcase_10 | AC | 102 ms
79,940 KB |
testcase_11 | AC | 91 ms
78,276 KB |
testcase_12 | AC | 139 ms
83,908 KB |
testcase_13 | AC | 3,228 ms
202,248 KB |
testcase_14 | AC | 432 ms
87,560 KB |
testcase_15 | AC | 67 ms
71,172 KB |
testcase_16 | AC | 151 ms
75,272 KB |
testcase_17 | AC | 419 ms
87,560 KB |
testcase_18 | AC | 65 ms
71,172 KB |
testcase_19 | AC | 103 ms
73,224 KB |
testcase_20 | AC | 66 ms
71,172 KB |
testcase_21 | AC | 144 ms
75,272 KB |
testcase_22 | AC | 84 ms
72,200 KB |
testcase_23 | AC | 207 ms
88,008 KB |
testcase_24 | AC | 149 ms
84,420 KB |
testcase_25 | AC | 266 ms
90,184 KB |
testcase_26 | AC | 3,534 ms
209,992 KB |
testcase_27 | AC | 156 ms
83,016 KB |
testcase_28 | AC | 3,426 ms
219,924 KB |
testcase_29 | AC | 3,428 ms
220,044 KB |
testcase_30 | AC | 3,434 ms
219,924 KB |
testcase_31 | AC | 3,419 ms
219,916 KB |
testcase_32 | AC | 3,443 ms
219,924 KB |
testcase_33 | AC | 221 ms
87,752 KB |
testcase_34 | AC | 175 ms
86,724 KB |
testcase_35 | AC | 1,008 ms
117,448 KB |
testcase_36 | AC | 56 ms
66,492 KB |
testcase_37 | AC | 246 ms
79,368 KB |
testcase_38 | AC | 77 ms
71,688 KB |
testcase_39 | AC | 3,390 ms
219,928 KB |
testcase_40 | AC | 3,428 ms
219,920 KB |
ソースコード
import sys from itertools import permutations from heapq import heappop,heappush from collections import deque import random import bisect input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) n,m,k = mi() cnt = [0] * (1<<n) for _ in range(m): cnt[int(input(),2)] += 1 COMB = [[0]*(n+1) for i in range(n+1)] COMB[0][0] = 1 for i in range(1,n+1): COMB[i][0] = 1 for j in range(1,i+1): COMB[i][j] = COMB[i-1][j] + COMB[i-1][j-1] fact = [1] * (n+1) for i in range(2,n+1): fact[i] = i * fact[i-1] f = [0] * (n+1) f[k] = 1 for i in range(k+1,n+1): f[i] = 1 for j in range(k,i): f[i] -= COMB[i][j] * f[j] #print(f) for i in range(n): t = 1<<i for S in range(1<<n): if S & t: cnt[S^t] += cnt[S] #print(cnt) popcnt = [bin(i).count("1") for i in range(1<<12)] mask = 2**12-1 for S in range(1<<n): p = popcnt[S & mask] + popcnt[S>>12] cnt[S] *= f[p] for i in range(n): t = 1<<i for S in range(1<<n): if S & t: cnt[S] += cnt[S^t] g = [n+1] * (m+1) for S in range(1<<n): g[cnt[S]] = min(g[cnt[S]],popcnt[S & mask] + popcnt[S>>12]) for i in range(m)[::-1]: g[i] = min(g[i],g[i+1]) print(*g[1:],sep="\n")