hdoj 1083 Courses 【匈牙利算法&&二分图匹配】
来源:互联网 发布:养车软件哪个好 知乎 编辑:程序博客网 时间:2024/05/03 10:34
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5293 Accepted Submission(s): 2542
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<cstdio>#include<cstring>#include<queue>#include<stack>#include<vector>#define mem(x,y) memset(x,y,sizeof(x))#define SI(x) scanf("%d",&x)using namespace std;const int N=330;int map[N][N],link[N],vis[N];int n,p;bool dfs(int g){for(int i=1;i<=n;i++){if(map[g][i]==1&&vis[i]==0){vis[i]=1;if(link[i]==0||dfs(link[i])){link[i]=g;return true;}}}return false;}int main(){int t,h,m,cnt,i;SI(t);while(t--){scanf("%d%d",&p,&n);mem(map,0);for(i=1;i<=p;i++){SI(m);for(int j=1;j<=m;j++){SI(h);map[i][h]=1;}}mem(link,0);cnt=0;for(i=1;i<=p;i++){mem(vis,0);if(dfs(i))cnt++;}if(cnt==p)printf("YES\n");else printf("NO\n");}return 0;}
0 0
- hdoj 1083 Courses 【匈牙利算法&&二分图匹配】
- HDOJ 题目1083Courses(二分图匹配,匈牙利算法模板)
- 【二分图匹配-匈牙利算法】Courses HDU
- hdu 1083 Courses(二分图匹配 匈牙利算法)
- HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
- HDU 1083 Courses(二分图,匈牙利算法)
- hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
- hdu 1083 Courses(二分匹配之匈牙利算法)
- poj2239 Selecting Courses(最大二分图匹配 (匈牙利算法) 实现 )
- hdu 1082 Courses 二分图最大匹配(匈牙利算法)
- poj题目1469 COURSES (二分图匹配,匈牙利算法)
- 【二分图最大匹配】【匈牙利算法】poj1469 COURSES && poj2446 Chessboard
- POJ 1469 COURSES (二分图最大匹配 匈牙利算法)
- poj 1469 COURSES 二分图最大匹配 匈牙利算法
- POJ 1469 COURSES(匈牙利算法二分图最大匹配)
- POJ 1469-COURSES(二分图匹配入门-匈牙利算法)
- HDU 1082 COURSES (二分图匹配之匈牙利算法)
- POJ1469[COURSES] 二分图最大匹配 匈牙利算法
- 制造锚点小技巧
- 进程间通信(IPC: inter process Communication)
- cocoa pods的安装和使用 更新镜像
- 如何在新版本caffe里添加新的一层
- android的消息处理机制(图+源码分析)——Looper,Handler,Message
- hdoj 1083 Courses 【匈牙利算法&&二分图匹配】
- Xcode调试工具Instruments指南
- MyEclipse professional 2014破解教程-转载并修正错误
- Android Samples视频系列之ApiDemos讲解视频
- [转载]spring+mybatis加载属性文件设置数据源失败原因及解决方案 - 泡在网上的日子
- maven 设置编译版本为java8 设置字符集为utf8
- hadoop2.6.1版本集群环境搭建
- Ubuntu设置时区和更新时间
- 线程间的通信,避免创建过多线程