POJ 2724

Purifying Machine

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 4014		Accepted: 1127

Description

Mike is the owner of a cheese factory. He has 2^N cheeses and each cheese is given a binary number from 00...0 to 11...1. To keep his cheese free from viruses, he made himself a purifying machine to clean virus-infected cheese. As a talented programmer, his purifying machine is built in a special way. His purifying machine has N switches, each switch has three states, 1, 0 and *. An operation of this machine is a cleaning action according to the states of the N switches. During one operation, at most one switch can be turned to state *, which can substitute for either 1 or 0. When the machine is turned to a specific state, an operation will clean all the cheeses with corresponding binary numbers. For example, if N equals 6 and the switches are turned to 01*100, the cheeses numbered 010100 and 011100 are under operation by the machine.

One day, Mike's machine was infected. When Mike found out, he had already done some operations and the cheeses operated by this infected machine were infected too. He cleaned his machine as quickly as he could, and now he needs to clean the infected cheeses with the minimum number of operations. If a cheese is infected, cleaning this cheese with the machine one or more times will make this cheese free from virus again; but if a cheese is not infected, operation on this cheese will make it go bad.

Now given the infected operations Mike has done, you need to find out the minimum number of operations that must be performed to clean all the infected cheeses without making any clean cheese go bad.

Input

There are several test cases. Each test case starts with a line containing two numbers N and M (1 <= N <= 10, 1 <= M <= 1000). N is the number of switches in the machine and M is the number of infected operations Mike has done. Each of the following M lines contains a switch state of the machine. A test case with N = M = 0 ends the input and should not be processed.

Output

For each test case, output one line containing an integer, which is the minimum number of operations Mike needs to do.

Sample Input

3 3
*01
100
011
0 0

Sample Output

2

Source

Beijing 2005

 

找出所有被感染的元素，然后对两个元素满足二进制位有且仅有一个不相同的建一条边，不难证明此图是二分图，每多一条匹配边可以减少一次操作，求出最大匹配减掉即可

 

#include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

#define maxn 2005

int n,m,len,ans;
int ele[maxn],match[maxn];
vector<int> G[maxn];
bool vis[maxn];

bool judge(int x1,int x2) {
        int sum = 0;
        for(int i = 0; i < 10; ++i) {
                if((x1 >> i & 1) ^ (x2 >> i & 1)) ++sum;
        }

        return sum == 1;
}
void build() {
    for(int i = 0; i < len; ++i) {
            for(int j = i + 1; j < len; ++j) {
                    if(judge(ele[i],ele[j])) {
                            G[i].push_back(j);
                            G[j].push_back(i);
                    }
            }
    }

}

bool dfs(int u) {
        for(int i = 0; i < G[u].size(); ++i ) {
                int v = G[u][i];
                if(vis[v]) continue;
                vis[v] = 1;
                if(match[v] == -1 || dfs(match[v])) {
                        match[v] = u;
                        return true;
                }
        }

        return false;
}

void solve() {

        for(int i = 0; i < len; ++i) G[i].clear();
        build();

        for(int i = 0; i < len; ++i) {
                match[i] = -1;
        }

        for(int i = 0; i < len; ++i) {
                memset(vis,0,sizeof(vis));
                if(dfs(i)) ++ans;
        }
}

int main()
{
   // freopen("sw.in","r",stdin);
    while(~scanf("%d%d",&n,&m)) {
            len = 0;
            ans = 0;
            if(!n && !m) break;
            char ch[20];
            for(int i = 0; i < m; ++i) {
                    scanf("%s",ch);
                    int pos = -1,sum = 0;
                    for(int j = 0; j < n; ++j) {
                            if(ch[j] == '1')
                                    sum += (1 << (n - j - 1));
                            if(ch[j] == '*')
                                    pos = n - j - 1;
                    }

                    ele[len++] = sum;
                    if(pos != -1) ele[len++] = sum + (1 << pos);

            }

            sort(ele,ele + len);
            len = unique(ele,ele + len) - ele;

            solve();

            printf("%d\n",len - (ans / 2));
    }

    return 0;
}