Poj 1466 Girls and Boys [二分匹配]

Girls and Boys

poj 1466 Girls and Boys
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

解题思路：
一个二分匹配的模板题，这个题目的关键就是将所有同学都放在了一起，编号在一个数组中，而且是从0开始的，所以标记的从1开始比较好，然后就是判断婚配对象的数组match就可以置0了，不会与编号为0 的同学重复，出现错误。

程序代码：

#include <stdio.h>
#include <string.h>
int book[10010];
int match[10010];
int y[1010][1010];
int n;

int yue(int u)
{
	int v,i,j;
	for(i=1;i<=n;i++){
		if(book[i]==0&&y[u][i]==1){
			book[i]=1;
			if(match[i]==0||yue(match[i])){
				match[i]=u;
				return 1;
			}
		}
	}
	return 0;
}

int main()
{
	int i,j,k,a,b,m;
	while(scanf("%d",&n)!=EOF)
	{
		memset(y,0,sizeof(y));
		memset(match,0,sizeof(match));
		for(i=0;i<n;i++){
			scanf("%d: (%d)",&a,&m);
			while(m--){
				scanf("%d",&b);
				y[a+1][b+1]=1;
			}
		}
		k=0;
		for(i=1;i<=n;i++){
			memset(book,0,sizeof(book));
			if(yue(i)==1)
				k++;
		}
		printf("%d\n",n-k/2);
	}
	return 0;
}