题意: 有P门课,有N个学生,学生可以选 多个课,也可以不选 ,现在要在每一门先这课的人里面选一个学生
做为颗代表。问是否每一门都有代表。
解法:用匈牙利算法(虽然不会用,只会套一下模板),用计算得到的需要匹配的数与课程数相等就行
#include<iostream>
#include<algorithm>
using namespace std;
//freopen("C://i.txt","r",stdin);
#define N 433
int p,n;
bool vist[N];
int y[N];
bool map[N][N];
bool search(int k)
{
for (int i=1;i<=n;i++) if (!vist[i])
{
if (map[k][i])
{
vist[i]=true;
if (y[i]==-1 || search(y[i]))
{
y[i]=k;
return true;
}
}
}
return false;
}
int MaxMatch()
{
int ans=0;
memset(y,-1,sizeof(y));
for (int i=1;i<=p;i++)
{
memset(vist,false,sizeof(vist));
if (search(i))
ans++;
}
return ans;
}
int main()
{
freopen("C://i.txt","r",stdin);
int i,j,k;
int cas;
cin>>cas;
while (cas--)
{
scanf("%d%d",&p,&n);
memset(map,false,sizeof(map));
for (i=1;i<=p;i++)
{
int num;
scanf("%d",&num);
for (j=1;j<=num;j++)
{
scanf("%d",&k);
map[i][k]=true;
}
}
k=MaxMatch();
if (k==p)
puts("YES");
else
puts("NO");
}
return 0;
}
COURSES
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 13220 | Accepted: 5178 |
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.
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