1433: [ZJOI2009]假期的宿舍

Description

Input

Output

Sample Input

1
3
1 1 0
0 1 0
0 1 1
1 0 0
1 0 0

Sample Output

ˆ ˆ

二分图匹配

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm = 55;
int map[maxm][maxm], vis[maxm], flag[maxm], home[maxm], n;
int find(int k);
int main()
{
	int i, j, k, sum, rev = 0, t, s;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d", &n);
		memset(flag, 0, sizeof(flag));
		memset(home, 0, sizeof(home));
		memset(vis, 0, sizeof(vis));
		memset(map, 0, sizeof(map));
		s = 0;rev = 0;
		for (i = 1;i <= n;i++)
		{
			scanf("%d", &k);
			if (k == 1)
			{
				flag[i] = 1;
				map[i][i] = 1;
				s++;
			}
		}
		for (i = 1;i <= n;i++)
		{
			scanf("%d", &k);                             
			if (flag[i] && k == 1)
			{
				home[i] = 1;
				rev++;
			}
		}
		for (i = 1;i <= n;i++)
		{
			for (j = 1;j <= n;j++)
			{
				scanf("%d", &k);
				if (k == 1)
				{
					if (flag[j])
						map[i][j] = 1;
				}
			}
		}
		sum = 0;memset(flag, 0, sizeof(flag));
		for (i = 1;i <= n;i++)
		{
			memset(vis, 0, sizeof(vis));
			if (home[i]) continue;
			if (find(i))
				sum++;
		}
		if (sum == n - rev)
			printf("^_^\n");
		else
			printf("T_T\n");
	}
	return 0;
}
int find(int k)
{
	for (int i = 1;i <= n;i++)
	{
		if (!vis[i] && map[k][i])
		{
			vis[i] = 1;
			if (!flag[i] || find(flag[i]))
			{
				flag[i] = k;
				return 1;
			}
		}
	}
	return 0;
}