POJ 1469 COURSES

COURSES

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 15404		Accepted: 6085

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
  

Input

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

P N
Count1 Student _{1 1} Student _{1 2} ... Student _{1 Count1}
Count2 Student _{2 1} Student _{2 2} ... Student _{2 Count2}
...
CountP Student _{P 1} Student _{P 2} ... Student _{P 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抣l 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.

Output

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.

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

 

题意：

不同学生学习不同课程

每个学生要上与他人不同的课程 每门课程都要有学生来上

问所给数据是否成立

 

代码：

#include<cstdio>
#include<cstring>
#define MAX 302

bool map[MAX][MAX];
bool vist[MAX];
int pre[MAX];
int p,n;

bool find(int cur)
{
	for(int i=1;i<=n;i++)
	{
		if(map[cur][i] && !vist[i])
		{
			vist[i]=true;
			if(pre[i]==-1 || find(pre[i]))
			{
				pre[i]=cur;
				return true;
			}
		}
	}
	return false;
}

int main()
{
	int t;
	while(scanf("%d",&t)!=EOF)
	{
		while(t--)
		{
			memset(map,false,sizeof(map));
			memset(pre,-1,sizeof(pre));

			scanf("%d%d",&p,&n);
			int m;
			for(int i=1;i<=p;i++)
			{
				scanf("%d",&m);
				int tmp;
				while(m--)
				{
					scanf("%d",&tmp);
					map[i][tmp]=true;
				}
			}

			int ans=0;
			for(int i=1;i<=p;i++)
			{
				memset(vist,false,sizeof(vist));
				if(find(i)) ans++;
			}

			if(ans==p) printf("YES\n");
			else printf("NO\n");
		}
	}
	return 0;
}

思路：

课程与学生一一对应 为最基本的二分匹配