#944143 (C++17(gcc12)) No.2669 Generalized Hitting Set

• 問題: No.2669 Generalized Hitting Set
• ユーザー: suisen
• 提出日時: 2024-01-14 01:52:09
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: TLE
• 実行時間: -
• コード長: 2,407 bytes
• コンパイル時間: 2,323 ms
• コンパイル使用メモリ: 98,844 KB
• 最終ジャッジ日時: 2025-02-18 19:56:05
• ジャッジサーバーID （参考情報）: judge2 / judge2

ファイルパターン	結果
other	AC * 32 TLE * 4 MLE * 5

ソースコード

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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// 789428 KB for N = 24
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
constexpr int MAX_N = 24;
constexpr int HALF = MAX_N / 2;
int res[1 << MAX_N][HALF]{};
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m, k;
    std::cin >> n >> m >> k;
    for (int i = 0; i < m; ++i) {
        std::string S;
        std::cin >> S;
        int val = 0;
        for (int j = 0; j < n; ++j) val |= ((S[j] - '0') << j);
        ++res[val][0];
    }
    if (k <= HALF) {
        /*
        [1,1]
        [1,x]
        */
        for (int B = 1; B < 1 << n; B <<= 1) {
            for (int L = 0; L < 1 << n; L += 2 * B) {
                for (int p = 0; p < B; ++p) {
                    int *u = res[L + p], *v = res[L + B + p];
                    for (int t = k; t--;) {
                        int tmp = u[t];
                        u[t] = tmp + v[t];
                        v[t] = tmp + (t ? v[t - 1] : 0);
                    }
                }
            }
        }
        std::vector<int> g(m + 1, n);
        for (int T = 0; T < 1 << n; ++T) {
            int T_size = __builtin_popcount(T);
            int f_T = m;
            for (int i = 0; i < k; ++i) f_T -= res[T][i];
            g[f_T] = std::min(g[f_T], T_size);
        }
        for (int i = m - 1; i >= 0; --i) g[i] = std::min(g[i], g[i + 1]);
        for (int i = 1; i <= m; ++i) std::cout << g[i] << '\n';
    } else {
        const int r = n - k + 1;
        /*
        [x,x]
        [x,1]
        */
        for (int B = 1; B < 1 << n; B <<= 1) {
            for (int L = 0; L < 1 << n; L += 2 * B) {
                for (int p = 0; p < B; ++p) {
                    int *u = res[L + p], *v = res[L + B + p];
                    for (int t = r; t-- > 1;) {
                        u[t] = u[t - 1] + v[t - 1];
                        v[t] += u[t - 1];
                    }
                    u[0] = 0;
                }
            }
        }
        std::vector<int> g(m + 1, n);
        for (int T = 0; T < 1 << n; ++T) {
            int T_size = __builtin_popcount(T);
            int f_T = 0;
            for (int i = 0; i < r; ++i) f_T += res[T][i];
            g[f_T] = std::min(g[f_T], T_size);
        }
        for (int i = m - 1; i >= 0; --i) g[i] = std::min(g[i], g[i + 1]);
        for (int i = 1; i <= m; ++i) std::cout << g[i] << '\n';
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX