POJ 2724 最小边覆盖

题意

传送门 POJ 2724

题解

最多的操作数即对于每一个被感染奶酪都进行一次操作；目标是最小化操作数，则关注带 ${}^{\prime }{\ast }^{\prime }$ 的操作，使满足此类操作的奶酪数最多，则操作数最小；其实是求最小边覆盖，转化为最大二分匹配问题。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#define min(a,b)    (((a) < (b)) ? (a) : (b))
#define max(a,b)    (((a) > (b)) ? (a) : (b))
#define abs(x)    ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-10
#define PI 3.14159265358979323846
using namespace std;

#define MAX_V 1024
int V;
vector<int> G[MAX_V];
int match[MAX_V];
bool used[MAX_V];

void add_edge(int u, int v){
	G[u].push_back(v);
	G[v].push_back(u);
}

bool dfs(int v){
	used[v] = true;
	for(int i = 0; i < G[v].size(); i++){
		int u = G[v][i], w = match[u];
		if(w < 0 || (!used[w] && dfs(w))){
			match[v] = u;
			match[u] = v;
			return true;
		}
	}
	return false;
}

int bipartite_matching(){
	int res = 0;
	memset(match, -1, sizeof(match));
	for(int v = 0; v < V; v++){
		if(match[v] < 0){
			memset(used, 0, sizeof(used));
			if(dfs(v)){
				++res;
			}
		}
	}
	return res;
}

#define MAX_N 10
#define MAX_M 1000
int N, M;
int infect[1 << MAX_N]; // 是否感染

void clear_graph(){
	for(int v = 0; v < V; v++) G[v].clear();
}

void solve(){
	V = 1 << N;
	clear_graph();
	int cnt = 0; // 感染奶酪数量
	for(int i = 0; i < 1 << N; i++){
		if(infect[i]){
			++cnt;
			for(int j = 0; j < N; j++){
				int k = i ^ (1 << j);
				// 避免重复连边
				if(infect[k] && i < k){
					add_edge(i, k);
				}
			}
		}
	}
	
	printf("%d\n", cnt - bipartite_matching());
}

int main(){
	while(~scanf("%d%d", &N, &M) && (N | M)){
		memset(infect, 0, sizeof(infect));
		for(int i = 0; i < M; i++){
			char s[12];
			scanf(" %s", s);
			int n1 = 0, n2 = 0;
			for(int j = 0; j < N; j++){
				if(s[j] == '*') n1 = (n1 << 1) + 1, n2 = n2 << 1;
				else if(s[j] == '0') n1 <<= 1, n2 <<= 1;
				else n1 = (n1 << 1) + 1, n2 = (n2 << 1) + 1;
			}
			infect[n1] = infect[n2] = 1;
		}
		
		solve();
	}
	return 0;
}