CF662C Binary Table FWT

这道题非常好啊，长见识了. 

code:

#include <cstdio> 
#include <algorithm>   
#define N 21 
#define ll long long  
#define setIO(s) freopen(s".in","r",stdin) 
using namespace std;        
char S[1<<N];   
int lim,cnt[1<<N],g[1<<N];     
ll a[1<<N],b[1<<N],ans=100000000;   
int lowbit(int t) { return t&(-t); }   
void FWT(ll *a,int opt) 
{   
    int i,j,k; 
    for(i=1;i<lim;i<<=1) 
    { 
        for(j=0;j<lim;j+=i<<1) 
        {
            for(k=0;k<i;++k) 
            {
                ll x=a[j+k],y=a[j+k+i];    
                a[j+k]=x+y,a[j+k+i]=x-y;      
                if(opt==-1) a[j+k]/=2,a[j+k+i]/=2;  
            }
        }
    }
}   
int main() 
{ 
    // setIO("input");  
    int i,j,n,m; 
    scanf("%d%d",&n,&m),lim=1<<n;    
    for(i=0;i<n;++i) 
    {  
        scanf("%s",S);   
        for(j=0;j<m;++j) 
        {
            if(S[j]=='1')  g[j]|=(1<<i);      
        }        
    }           
    for(i=0;i<m;++i)  ++a[g[i]];   
    for(i=1;i<lim;++i) cnt[i]=cnt[i>>1]+(i&1);      
    for(i=0;i<lim;++i) b[i]=min(cnt[i],n-cnt[i]);                              
    FWT(a,1),FWT(b,1); 
    for(i=0;i<lim;++i) a[i]*=b[i];   
    FWT(a,-1);      
    for(i=0;i<lim;++i) ans=min(ans,a[i]);   
    printf("%lld\n",ans);  
    return 0;
}