题目链接:https://ac.nowcoder.com/acm/contest/373/D
思路:二分答案,由于a^b=c,c^b=a这些异或的性质,可以用fwt判断答案可行性
#pragma GCC optimize(2)
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(1e9+7)
#define pb push_back
#define eps 1e-12
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
ll n,m,a[1200008],c[1200008],d[1200008];
char b[58];
void fwt_or(int *a,int n,int opt)
{
for(int i=1;i<n;i<<=1)
for(int k=0;k<n;k+=i<<1)
for(int j=k;j<k+i;++j)
if(opt==1)a[j+i]=(a[j]+a[j+i])%mod;
else a[j+i]=(a[j+i]-a[j]+mod)%mod;
}
void fwt_and(int *a,int n,int opt)
{
for(int i=1;i<n;i<<=1)
for(int k=0;k<n;k+=i<<1)
for(int j=k;j<i+k;++j)
if(opt==1)a[j]=(a[j]+a[j+i])%mod;
else a[j]=(a[j]-a[j+i]+mod)%mod;
}
void fwt_xor(ll *a,int n,int opt)
{
for(int i=1;i<n;i<<=1)
for(int k=0;k<n;k+=i<<1)
for(int j=k;j<i+k;++j)
{
ll x=a[j],y=a[j+i];
//a[j]=(x+y)%mod;a[j+i]=(x-y+mod)%mod;
a[j]=(x+y);a[j+i]=(x-y);
//if(opt==-1) a[j]=1LL*a[j]*inv2%mod,a[j+i]=1LL*a[j+i]*inv2%mod;
if(opt==-1) a[j]=a[j]/2ll,a[j+i]=a[j+i]/2ll;
}
}
int main()
{
cin.tie(0);
cout.tie(0);
cin>>n>>m;
ll zz;
FOR(i,1,n)
{
ss(b);zz=0;
for(int k=0;k<m;k++) zz+=(1<<k)*(b[k]=='1');
a[zz]++;
}
fwt_xor(a,(1<<m),1);
for(int i=1;i<(1<<m);i++) c[i]=c[i>>1]+(i&1);
for(int i=0;i<(1<<m);i++) c[i]=m-c[i];
int l=0,r=m,ans=m;
while(l<=r)
{
int mid=(l+r)>>1,qw=0;
for(int i=0;i<(1<<m);i++) d[i]=(c[i]<=mid);
fwt_xor(d,(1<<m),1);
for(int i=0;i<(1<<m);i++) d[i]*=a[i];
fwt_xor(d,(1<<m),-1);
for(int i=0;i<(1<<m);i++)
if(d[i]==n) qw=1;
if(qw) ans=mid,r=mid-1;
else l=mid+1;
}
cout<<ans<<endl;
return 0;
}