Courses
来源:互联网 发布:漳州seo 编辑:程序博客网 时间:2024/06/08 01:00
点击打开链接
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
YYYYYYYYYYYYYYYYYYYYY
二分匹配的模板;
#include<stdio.h>#include<string.h>#define NN 500int used[NN],match[NN];int map[NN][NN];int m,n;int DFS(int u){int i,j,k;for(i=1;i<=n;i++){if(!used[i]&&map[u][i]){used[i]=1;if(match[i]==-1||DFS(match[i])){match[i]=u;return 1;}}}return 0;}int main(){int i,j,k,ncase,a;scanf("%d",&ncase);while(ncase--){scanf("%d%d",&m,&n);memset(map,0,sizeof(map));for(i=1;i<=m;i++){scanf("%d",&k);for(j=1;j<=k;j++){scanf("%d",&a);map[i][a]=1;//一开始将k写成i;wa了;}}int sum=0;memset(match,-1,sizeof(match));for(i=1;i<=m;i++){memset(used,0,sizeof(used));if(DFS(i))sum++;}if(sum==m)puts("YES");else puts("NO");}return 0;}
- Courses
- courses
- Courses
- Courses
- Courses
- Courses
- Courses
- COURSES
- Courses
- Tibco Courses
- Open courses
- hdu1083 Courses
- ZOJ1140:Courses
- poj_1469 COURSES
- poj1469 COURSES
- POJ1469:COURSES
- POJ1469 COURSES
- POJ1469 COURSES
- 使用spring的特殊bean --- 分散配置
- JS中window.showModalDialog()详解
- ubifs文件系统的制作过程&&遇到的问题及解决方案总结---之一“uboot中添加对UBIFS文件系统的支持”
- 将Quartus波形图导入至matlab的方法
- 数据挖掘书籍
- Courses
- 第九周任务一
- 暗时间-不是书评 :《我是一只IT小小鸟》
- 第九周实验二
- 系统环境变量
- 第九周实验报告(五)
- 第九周任务二 (这是个问题)
- H - Climbing Worm解题报告
- E - I Love You Too解题报告