hdu 1045 Fire Net 二分行列匹配

类似hdu 5093

#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>

using namespace std;

int n, m, k;
vector<int> v[20];
int link[20], vis[20];
char a[5][5];
int b[5][5] ,c[5][5];

void init()
{
	for( int i = 1; i <= 19; i++ )
		v[i].clear();
	m = n = 0;
	memset(b, 0, sizeof(b));
	memset(c, 0, sizeof(c));
}

int dfs( int u )
{
	for( int i = 0; i < v[u].size(); i++ )
	{
		int to = v[u][i];
		if( !vis[to] )
		{
			vis[to] = 1;
			if( link[to] == -1 || dfs( link[to] ) )
			{
				link[to] = u;
				return 1;
			}
		}
	}
	return 0;
}

int main()
{
	while(~scanf("%d", &k) && k)
	{
		for( int i = 1; i <= k; i++ )
		{
			scanf("%s", a[i] + 1);
		}
		
		init();
		
		for( int i = 1; i <= k; i++ )
		{
			bool f = 0;
			for( int j = 1; j <= k; j++ )
			{
				if( a[i][j] == '.' )
				{
					if( !f )
					{
						b[i][j] = ++n;
						f = 1;
					}
					else
						b[i][j] = n;
				}
				if( a[i][j] == 'X' )
				{
					if( f )
						f = 0;
				}
			}
		}
		
		for( int j = 1; j <= k; j++ )
		{
			bool f = 0;
			for( int i = 1; i <= k; i++ )
			{
				if( a[i][j] == '.' )
				{
					if( !f )
					{
						c[i][j] = ++m;
						f = 1;
					}
					else
						c[i][j] = m;
				}
				if( a[i][j] == 'X' )
				{
					if( f )
						f = 0;
				}
			}
		}
		
		/*for( int i = 1; i <= k ;i++ )
		{
			for( int j = 1; j <= k; j++ )
			{
				printf("%d ", b[i][j]);
			}
			puts("");
		}
		for( int i = 1; i <= k ;i++ )
		{
			for( int j = 1; j <= k; j++ )
			{
				printf("%d ", c[i][j]);
			}
			puts("");
		}*/
		
		for ( int i = 1; i <= k; i++ )
		{
			for( int j = 1; j <= k; j++ )
			{
				//printf("%d ", b[i][j]);
				if(a[i][j] == '.')
				{
					v[b[i][j]].push_back(c[i][j]);
				}
			}
			//puts("");
		}
		
		int ans = 0;
		memset(link, -1, sizeof(link));
		for (int i = 1; i <= n; i++ )
		{
			memset(vis, 0, sizeof(vis));
			ans += dfs(i);
		}
		printf("%d\n", ans);
	}
	return 0;
}