杭电OJ 1083——courses(二分图的匹配问题!匈牙利算法解答)
来源:互联网 发布:汽车销量官方数据 编辑:程序博客网 时间:2024/05/22 17:15
Courses
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
问题不难!关键在于算法!这种题型属于二分图的匹配问题!用匈牙利算法来解答最好不过!关于匈牙利算法的描述,请看这里,讲的不能再好了,仔细看,会很有收获的!http://blog.csdn.net/lishuhuakai/article/details/8123878
我花了几个小时,终于把这个算法弄懂了!很强大的算法!没想到离散数学竟然也这么重要!呵!
贴代码吧!
//现在弄到一个判断二分匹配的算法,仔细研究研究,很爽的!#include<iostream>using namespace std;const int Max=500;int g[Max][Max];int linker[Max];bool used[Max];bool dfs(int u){int v;for(v=1;v<=g[0][1];v++){if(g[u][v] && !used[v]){used[v]=true;if(linker[v]==-1 || dfs(linker[v])){linker[v]=u;return true;}}}return false;}int hungary(){int res=0;int u;memset(linker,-1,sizeof(linker));for(u=1;u<=g[0][0];u++){memset(used,0,sizeof(used));if(dfs(u)) res++;}return res;}int main(){int cases;cin>>cases;while(cases--){int num,m;memset(g,0,sizeof(g));cin>>g[0][0]>>g[0][1];for(int i=1;i<=g[0][0];i++){cin>>num;for(int j=0;j<num;j++){cin>>m;g[i][m]=1;}}if(hungary()!=g[0][0])cout<<"NO"<<endl;elsecout<<"YES"<<endl;}return 0;}
- 杭电OJ 1083——courses(二分图的匹配问题!匈牙利算法解答)
- hdu 1083 Courses(二分图匹配 匈牙利算法)
- HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
- 【二分图匹配-匈牙利算法】Courses HDU
- hdoj 1083 Courses 【匈牙利算法&&二分图匹配】
- hdu 1082 Courses 二分图最大匹配(匈牙利算法)
- poj题目1469 COURSES (二分图匹配,匈牙利算法)
- POJ 1469 COURSES(匈牙利算法二分图最大匹配)
- POJ 1469-COURSES(二分图匹配入门-匈牙利算法)
- HDU 1082 COURSES (二分图匹配之匈牙利算法)
- 【杭电oj】过山车(二分图最大匹配,匈牙利算法)
- 杭电2063————匈牙利算法(二分图最大匹配)
- 杭电2063二分图匹配(匈牙利算法)
- HDOJ 题目1083Courses(二分图匹配,匈牙利算法模板)
- POJ 2239 Selecting Courses(二分图匹配——匈牙利算法||网络流)解题报告
- HDU 1083 Courses(二分图,匈牙利算法)
- hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
- hdu 1083 Courses(二分匹配之匈牙利算法)
- asp.net中TextBox设为只读后的取值问题
- SQL实现多行变一行
- hive bucket产生的小文件问题
- WEB7-request
- 年轻人,你何必着急
- 杭电OJ 1083——courses(二分图的匹配问题!匈牙利算法解答)
- 等概率数字筛选问题
- PLSQL查看修改oracle连接数
- 快速排序
- 数据库间数据操作方法汇总
- WEB8-Cookie
- 填报表页面端录入换行问题
- 项目管理过程组图
- 条款8:了解不各种不同意义的new和delete 练习