题意:
现有一个n*m的网格,每个位置填入数字0或1,一次操作可以将同一行或同一列数字全部取反,目标是让网格中剩余的1最少,问最少能达到几个??? n <= 20, m <= 100000
solution:
显然,每行或每列要么不操作,要么操作一次
注意到n很小,,可以枚举行操作,2^n种,至于每一列是否需要操作,贪心即可O(2^n*m)
但是这个复杂度还远远不能接受--
将一个行操作组合看做一个二十位二进制数码k,第i列的所有数字组成一个20位二进制数码ci
一次枚举,相当于对于所有ci,执行ci xor k,然后贪心
令ci xor k = t,那么有ci xor t = k
预处理每个t的最优选择gt,统计出数码i出现的次数fi
令h = f*g,,,事实上是一个xor卷积,FWT即可
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int T = 20;
const int maxn = 1<<T;
const int maxm = 1E5 + 10;
typedef long long LL;
int n,m,a[T][maxm];
char ch[maxm];
LL f[maxn],g[maxn];
void fwt_xor(LL *h,int n)
{
for (int i = 0; i < n; i++)
for (int j = 0; j < (1<<n); j++) {
if (j & (1<<i)) continue;
LL u = h[j],v = h[j | (1<<i)];
h[j] = u + v; h[j | (1<<i)] = u - v;
}
}
void ifwt_xor(LL *h,int n)
{
for (int i = 0; i < n; i++)
for (int j = 0; j < (1<<n); j++) {
if (j & (1<<i)) continue;
LL u = h[j],v = h[j | (1<<i)];
h[j] = (u + v) >> 1; h[j | (1<<i)] = (u - v) >> 1;
}
}
int main()
{
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
cin >> n >> m;
for (int i = 0; i < n; i++) {
scanf("%s",ch);
for (int j = 0; j < m; j++)
a[i][j] = ch[j] - '0';
}
for (int j = 0; j < m; j++) {
int x = 0;
for (int i = 0; i < n; i++) {
x <<= 1;
x |= a[i][j];
}
++f[x];
}
for (int i = 0; i < (1<<n); i++) {
int x = i,tot = 0;
for (; x; x >>= 1) tot += (x&1);
tot = min(tot,n - tot);
g[i] = tot;
}
fwt_xor(f,n);
fwt_xor(g,n);
for (int i = 0; i < (1<<n); i++)
f[i] = f[i]*g[i];
ifwt_xor(f,n);
LL ans = ~0U>>1;
for (int i = 0; i < (1<<n); i++) ans = min(ans,f[i]);
cout << ans;
return 0;
}