hdoj--1083--Courses（最大匹配）

Courses

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 5411    Accepted Submission(s): 2597

Problem Description

Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies simultaneously the conditions:



. every student in the committee represents a different course (a student can represent a course if he/she visits that course)



. each course has a representative in the committee



Your program should read sets of data from a text file. The first line of the input file contains the number of the data sets. Each data set is presented in the following format:



P N

Count1 Student1 1 Student1 2 ... Student1 Count1

Count2 Student2 1 Student2 2 ... Student2 Count2

......

CountP StudentP 1 StudentP 2 ... StudentP CountP



The first line in each data set contains two positive integers separated by one blank: P (1 <= P <= 100) - the number of courses and N (1 <= N <= 300) - the number of students. The next P lines describe in sequence of the courses . from course 1 to course P,
each line describing a course. The description of course i is a line that starts with an integer Count i (0 <= Count i <= N) representing the number of students visiting course i. Next, after a blank, you'll find the Count i students, visiting the course,
each two consecutive separated by one blank. Students are numbered with the positive integers from 1 to N.



There are no blank lines between consecutive sets of data. Input data are correct.



The result of the program is on the standard output. For each input data set the program prints on a single line "YES" if it is possible to form a committee and "NO" otherwise. There should not be any leading blanks at the start of the line.



An example of program input and output:

 

Sample Input

2
3 3
3 1 2 3
2 1 2
1 1
3 3
2 1 3
2 1 3
1 1

 

Sample Output

YES
NO 

 

Source

Southeastern Europe 2000

 

Recommend

We have carefully selected several similar problems for you:  1068 2444 1150 1281 1045 

#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int pipei[500],used[500];
vector<int>map[500];
int find(int x)
{
	for(int i=0;i<map[x].size();i++)
	{
		int y=map[x][i];
		if(!used[y])
		{
			used[y]=1;
			if(!pipei[y]||find(pipei[y]))
			{
				pipei[y]=x;
				return 1;
			}
		}
	}
	return 0;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,m;
		scanf("%d%d",&n,&m);
		memset(pipei,0,sizeof(pipei));
		for(int i=1;i<=n;i++)
		map[i].clear();
		for(int i=1;i<=n;i++)
		{
			int x,y;
			int k;
			scanf("%d",&k);
			while(k--)
			{
				scanf("%d",&y);
				map[i].push_back(y);
			}
		}
		int sum=0;
		for(int i=1;i<=n;i++)
		{
			memset(used,0,sizeof(used));
			sum+=find(i);
		}
		if(sum==n)
			printf("YES\n");
		else
			printf("NO\n");
	}
	return 0;
}