fwt_xor Codeforces663E Binary Table

传送门：点击打开链接

题意：操作任意的行和列，把01调换，使得最后的1的个数最少。

因为n<=20，我们很容易想到考虑状压。设mask的第i位为1就表示对第i行经行操作。

用F函数来记录所有的mask出现的次数。用G函数来记录某个状态翻转这一列或者不翻转这一列，最少的1的个数。

之后对F函数和G函数，求异或卷积，就得到了行的方案了，每个位置即是这种方案1的个数。

这个方法实在是太无敌了QAQ

#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <bitset>
#include <string>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#define fuck(x) cout<<"["<<x<<"]";
#define FIN freopen("input.txt","r",stdin);
#define FOUT freopen("output.txt","w+",stdout);
using namespace std;
typedef long long LL;
typedef pair<int, int>PII;

const int MX = 20;
const int MM = 1e5 + 5;
const int mod = 1e9 + 7;

int A[MM], n, m;
char S[MM];
LL F[1 << MX], G[1 << MX];

void fwt_xor(LL a[], int l, int r) {
    if (l == r) return;
    int mid = (l + r) >> 1;
    fwt_xor(a, l, mid);
    fwt_xor(a, mid + 1, r);
    int len = mid - l + 1;
    for (int i = l; i <= mid; ++i) {
        LL x1 = a[i];
        LL x2 = a[i + len];
        a[i] = x1 + x2;
        a[i + len] = x1 - x2;
    }
}
void ifwt_xor(LL a[], int l, int r) {
    if (l == r) return;
    int mid = (l + r) >> 1;
    int len = mid - l + 1;
    for (int i = l; i <= mid; ++i) {
        LL y1 = a[i];
        LL y2 = a[i + len];
        a[i] = (y1 + y2) / 2;
        a[i + len] = (y1 - y2) / 2;
    }
    ifwt_xor(a, l, mid);
    ifwt_xor(a, mid + 1, r);
}
int main() {
    // FIN;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i++) {
        scanf("%s", S);
        for(int j = 0; j < m; j++) {
            A[j] = A[j] << 1 | (S[j] - '0');
        }
    }
    for(int i = 0; i < m; i++) {
        F[A[i]] += 1;
    }
    for(int i = 0; i < 1 << n; i++) {
        int t = __builtin_popcount(i);
        G[i] = min(t, n - t);
    }

    int tot = 1 << n;
    fwt_xor(F, 0, tot - 1); fwt_xor(G, 0, tot - 1);
    for(int i = 0; i < 1 << n; i++) {
        F[i] = F[i] * G[i];
    }
    ifwt_xor(F, 0, tot - 1);

    int ans = n * m;
    for(int i = 0; i < 1 << n; i++) {
        ans = min(ans, (int)F[i]);
    }
    printf("%d\n", ans);
    return 0;
}