ZOJ 1137 Girls and Boys（二分图最大匹配+DFS）

the second year of the university somebody started a study on the romantic relations between the students. The relation  romantically involved is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been romantically involved. The result of the program is the number of students in such a set.

The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:

the number of students
the description of each student, in the following format
student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
or
student_identifier:(0)

The student_identifier is an integer number between 0 and n-1, for n subjects.
For each given data set, the program should write to standard output a line containing the result.

An example is given in Figure 1.

Input

7
0: (3) 4 5 6
1: (2) 4 6
2: (0)
3: (0)
4: (2) 0 1
5: (1) 0
6: (2) 0 1
3
0: (2) 1 2
1: (1) 0
2: (1) 0

Output

5
2 

  

 题意描述：给你每个人相匹配的人，然后问最多能找到多少个人互不匹配。其实就是找：最大独立集合！

二分图最大独立集合 =  顶点个数 - 最小顶点覆盖(最大匹配）

分析：二分图最大匹配模板题。

代码如下：

#include<stdio.h>
#include<string.h>
int a[1010][1010];
int book[1010];
int match[1010];
int n;
int dfs(int u)
{
	int i;
	for(i=0;i<n;i++)
	{
		if(book[i]==0&&a[u][i]==1)//如果i未被访问且u与i匹配 
		{
			book[i]=1;//标记点i已被访问
			//如果点i未被配对或者找到了新的配对 
			if(match[i]==0||dfs(match[i]))
			{
				match[i]=u;//更新配对关系 
				return 1;
			}
		}
	}
	return 0;
}
int main()
{
	int m1,t,m,i,ans;
	while(scanf("%d",&n) !=EOF)
	{
		memset(a,0,sizeof(a));
		memset(match,0,sizeof(match));
		for(i=0;i<n;i++)
		{
			scanf("%d: (%d)",&m1,&t);
			while(t--)//读入边 
			{
				scanf("%d",&m);
				a[m1][m]=1;
			}
		}
		ans=0;
		for(i=0;i<n;i++)
		{
			memset(book,0,sizeof(book));//清空上次搜索时的记忆 
			if(dfs(i))//寻找增广路，如果找到，配对数加一 
			ans++;
		}
		printf("%d\n",n-ans/2);//输出最大独立集数 
	}
	return 0;
}