HDU 1083 Courses(二分图,匈牙利算法)
来源:互联网 发布:js年龄正则表达式 编辑:程序博客网 时间:2024/06/08 10:14
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5851 Accepted Submission(s): 2813
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:
. 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
23 33 1 2 32 1 21 13 32 1 32 1 31 1
Sample Output
YESNO
分析:第一个二分图的题目,套用的模板。
代码如下:
#include <stdio.h> #include <string.h>int map[311][311];int n,m;int vis[311],pre[311]; int find(int x){int i;for(i=1;i<=m;i++){if(map[x][i] && !vis[i])//学生是否被访问 {vis[i]=1;if(!pre[i] || find(pre[i])){pre[i]=x;return 1;}}}return 0;}int main(){int T; int i,j,k;int a;int sum;scanf("%d",&T);while(T--){memset(map,0,sizeof(map));memset(pre,0,sizeof(pre));scanf("%d %d",&n,&m);for(i=1;i<=n;i++){scanf("%d",&k);for(j=1;j<=k;j++){scanf("%d",&a);map[i][a]=1;}}sum=0;for(i=1;i<=n;i++){memset(vis,0,sizeof(vis));sum+=find(i);}if(sum==n)printf("YES\n");elseprintf("NO\n");}return 0;}
0 0
- HDU 1083 Courses(二分图,匈牙利算法)
- 【二分图匹配-匈牙利算法】Courses HDU
- hdu 1083 Courses(二分图匹配 匈牙利算法)
- HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
- hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
- hdu 1083 Courses(二分匹配之匈牙利算法)
- hdu 1082 Courses 二分图最大匹配(匈牙利算法)
- HDU 1082 COURSES (二分图匹配之匈牙利算法)
- 【匈牙利算法】hdu 1083 Courses
- hdoj 1083 Courses 【匈牙利算法&&二分图匹配】
- HDU 1083 Courses( 匈牙利算法 )
- HDU-1083 Courses(匈牙利算法)
- HDU 1083 Courses(二分匹配匈牙利算法模板题啊)
- HDU 1083 Courses 匈牙利算法二分匹配(邻接矩阵存关系)
- poj2239 Selecting Courses(最大二分图匹配 (匈牙利算法) 实现 )
- poj题目1469 COURSES (二分图匹配,匈牙利算法)
- 【二分图最大匹配】【匈牙利算法】poj1469 COURSES && poj2446 Chessboard
- POJ 1469 COURSES (二分图最大匹配 匈牙利算法)
- Cocos2d-x-3.11生成预编译库编译安卓报错的解决办法
- 标准模板库
- 深入理解C++中public、protected及private用法
- ble蓝牙通信
- MySQL 实例
- HDU 1083 Courses(二分图,匈牙利算法)
- Java设计模式
- jquery对象和js的dom对象之间的转换
- UItextField
- Oracle 动态性能视图之V$LOCK
- 哈理工OJ 1031 _OOOO_ Problem(简单模拟问题)
- mysql中如何获取当前时间以及对时间的处理函数
- HTML 中thead tbody tfoot 的使用方法
- HDU 3078 Network 在线LCA