按照二进制中1的个数的奇偶性,把数字分为两个集合,即二分图的两个点集。因为1的个数奇偶性相同的,1的个数至少相差两个,不可能通过一个*来变换到。然后这两个点集中,把二进制位不同位数为1个的数字相连建边。则二分图的最大独立集就是结果。
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <bitset>
const int MAXN = 2010;//点数的最大值
const int MAXM = 5010;//边数的最大值
struct Edge
{
int to,next;
} edge[MAXM];
int head[MAXN],tot;
void init()
{
tot = 0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v)
{
edge[tot].to = v;
edge[tot].next = head[u];
head[u] = tot++;
}
int linker[MAXN];
bool used[MAXN];
int uN;
bool dfs(int u)
{
for(int i = head[u]; i != -1 ; i = edge[i].next)
{
int v = edge[i].to;
if(!used[v])
{
used[v] = true;
if(linker[v] == -1 || dfs(linker[v]))
{
linker[v] = u;
return true;
}
}
}
return false;
}
int hungary()
{
int res = 0;
memset(linker,-1,sizeof(linker));
for(int u = 0; u < uN; u++) //点的编号0~uN-1
{
memset(used,false,sizeof(used));
if(dfs(u))res++;
}
return res;
}
char str[15];
int main()
{
using namespace std;
vector<int> vec;
int n,m,t;
while(scanf("%d %d",&n,&m) && n+m)
{
init();
vec.clear();
for(int i = 0; i < m; ++i)
{
t = 0;
scanf("%s",str);
for(int i = 0; i < n; ++i)
if(str[i] == '1')
t += (1<<(n-i-1));
vec.push_back(t);
for(int i = 0; i < n; ++i)
if(str[i] == '*')
t += (1<<(n-i-1));
vec.push_back(t);
}
sort(vec.begin(),vec.end());
vec.erase(unique(vec.begin(),vec.end()),vec.end());
int vlen = vec.size();
uN = vlen;
for(int i = 0; i < vlen; ++i)
{
for(int j = 0; j < vlen; ++j)
{
bitset<32> diff = vec[i] ^ vec[j];
if(diff.count() == 1)
{
addedge(i,j);
}
}
}
printf("%d\n",vlen-hungary()/2);
}
return 0;
}