#944181 (Nim) No.2669 Generalized Hitting Set

• 問題: No.2669 Generalized Hitting Set
• ユーザー: suisen
• 提出日時: 2024-01-14 04:33:35
• 言語: Nim (2.2.0)
• 結果: MLE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 1,298 bytes
• コンパイル時間: 4,596 ms
• コンパイル使用メモリ: 66,224 KB
• 実行使用メモリ: 269,412 KB
• 最終ジャッジ日時: 2024-09-28 02:51:23
• 合計ジャッジ時間: 28,650 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
other	AC * 32 MLE * 9

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
import sequtils
import strutils
import algorithm
const N_MAX = 24
var binom: array[N_MAX + 1, array[N_MAX + 1, int]]
for i in 0 .. N_MAX:
    binom[i][0] = 1
    for j in 1 .. i:
        binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j]
var popcnt: array[1 shl N_MAX, int]
for t in 1 ..< 1 shl N_MAX:
    popcnt[t] = 1 + popcnt[t and (t - 1)]
var n, m, k: int
var nmk = stdin.readLine.split.map parseInt
n = nmk[0]
m = nmk[1]
k = nmk[2]
var f = newSeq[int](1 shl n)
for i in 0 ..< m:
    # reversed, but it's ok
    let s = stdin.readLine
    var x = 0
    for j in 0 ..< n:
        x += int(s[j] == '1') shl j
    f[x] += 1
var a = newSeq[int](n + 1)
for l in k .. n:
    a[l] = binom[l - 1][l - k]
    if bool((l - k) and 1):
        a[l] = -a[l]
# supset zeta
proc supset_zeta(): void =
    var b = 1
    while b < 1 shl n:
        for l in countup(0, (1 shl n) - 1, 2 * b):
            for p in l ..< l + b:
                f[p] += f[p + b]
        b *= 2
supset_zeta()
for t in 0 ..< 1 shl n:
    f[t] *= a[popcnt[t]]
# subset zeta
f.reverse
supset_zeta()
f.reverse
var g = newSeq[int](m + 1)
for i in 0 .. m:
    g[i] = n
for t in 0 ..< 1 shl n:
    g[f[t]] = min(g[f[t]], popcnt[t])
for p in countdown(m - 1, 0):
    g[p] = min(g[p], g[p + 1])
for p in 1 .. m:
    echo g[p]
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX