ZOJ 1654 Place the Robots(二分图最大匹配)

具体建图思路,是把一有墙隔着的行或列转换成多行或多列,然后建立行和列之间二分图,最后匈牙利算法,

好文章:http://wenku.baidu.com/view/ab32abbec77da26925c5b0f2.html

#include <iostream>
#include <cstdio>
#include <memory.h>
using namespace std;
const int maxn = 51;
struct edge{
	int v, next;
}es[3100];
char mat[maxn][maxn];
int rmat[maxn][maxn],cmat[maxn][maxn];
int fa[3250], head[3250], n, m;
bool vis[3250];
bool dfs(int u){
	for (int ne = head[u]; ne != -1; ne = es[ne].next){
		int v = es[ne].v;
		if(!vis[v]){
			vis[v] = 1;
			if(fa[v] == 0 || dfs(fa[v])){
				fa[v] = u;
				return true;
			}
		}
	}
	return false;
}
int hungary(){
	int ans = 0;
	memset(fa, 0, sizeof(fa));
	for (int i = 1; i <= n; ++i){
		memset(vis,0,sizeof(vis));
		if(dfs(i)){
			ans++;
		}
	}
	return ans;
}
void addEdge(int u, int v, int eidx){
	es[eidx].v = v;
	es[eidx].next = head[u];
	head[u] = eidx;
}
int main(){
	int T, cas = 1;
	scanf("%d", &T);
	while (T--){
		memset(head, -1, sizeof(head));
		memset(mat, 0, sizeof(mat));
		memset(rmat, 0, sizeof(rmat));
		memset(cmat, 0, sizeof(cmat));
		scanf("%d %d\n", &n, &m);
		for (int i = 0; i < n; ++i){
			gets(mat[i]);
		}
		int rr = 1;
		for (int i = 0; i < n; ++i){
			for (int j = 0; j < m; ){
				if(mat[i][j] == '#'){
					rr++;
					while(j < m && mat[i][j] == '#') ++j;
					continue;

				}else if(mat[i][j] == 'o'){
					rmat[i][j] = rr;
				}
				++j;
			}
			rr++;
		}
		int cc = rr + 1;
		for (int j = 0; j < m; ++j){
			for (int i = 0; i < n; ){
				if(mat[i][j] == '#'){
					cc++;
					while(i < n && mat[i][j] == '#') ++i;
					continue;
				}else if(mat[i][j] == 'o'){
					cmat[i][j] = cc;
				}
				++i;
			}
			cc++;
		}
		int eidx = 0;
		for (int i = 0; i < n; ++i){
			for (int j = 0; j < m; ++j){
				if(mat[i][j] == 'o'){
					addEdge(rmat[i][j], cmat[i][j], eidx++);
					addEdge(cmat[i][j], rmat[i][j], eidx++);
				}
			}
		}
		n = rr,m = cc; 
		printf("Case :%d\n%d\n", cas++, hungary());
	}
	return 0;
}