hdu 1083 Courses(二分匹配之匈牙利算法)
来源:互联网 发布:仅限数据连接怎么取消 编辑:程序博客网 时间:2024/05/17 22:42
题目地址:
http://acm.hdu.edu.cn/showproblem.php?pid=1083
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5098 Accepted Submission(s): 2454
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
这道题的题目大意是给你n个学生和p门课程,每个课程都有m个学生上课,要求在每门课中选出一个代表,一个人只能担任一个课代表,问是否每个课都有代表
AC代码:
#include<stdio.h>#include<string.h>int n,p;int mp[310][310],vis[310],link[310];int dfs(int x){ int i,j,k; for(i=1;i<=n;i++) { if(vis[i]==0 && mp[x][i]==1) { vis[i]=1; if(link[i]==0 || dfs(link[i])==1){ link[i]=x; return 1; } } } return 0;}int main(){ int t,i,j,s,z,counts,m; scanf("%d",&t); while(t--) { memset(mp,0,sizeof(mp)); counts=0; scanf("%d%d",&p,&n); for(i=1;i<=p;i++) { scanf("%d",&m); for(j=1;j<=m;j++) { scanf("%d",&z); mp[i][z]=1; } } memset(link,0,sizeof(link)); for(i=1;i<=p;i++) { memset(vis,0,sizeof(vis)); if(dfs(i)==1) counts++; } // printf("%d %d\n",counts,p); if(counts==p) printf("YES\n"); else printf("NO\n"); }}
0 0
- hdu 1083 Courses(二分匹配之匈牙利算法)
- HDU 1082 COURSES (二分图匹配之匈牙利算法)
- 【二分图匹配-匈牙利算法】Courses HDU
- hdu 1083 Courses(二分图匹配 匈牙利算法)
- hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
- HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
- HDU 1083 Courses(二分图,匈牙利算法)
- hdu 1082 Courses 二分图最大匹配(匈牙利算法)
- HDU 1083 Courses(二分匹配匈牙利算法模板题啊)
- HDU 1083 Courses 匈牙利算法二分匹配(邻接矩阵存关系)
- hdoj 1083 Courses 【匈牙利算法&&二分图匹配】
- 【匈牙利算法】hdu 1083 Courses
- HDU 1083 二分匹配 Courses
- HDU-1083-Courses [二分匹配]
- HDU OJ 1083 Courses 【二分图匹配之最大匹配】
- pku 1469 COURSES(二分匹配,匈牙利算法)
- poj 匈牙利二分匹配算法2239 Selecting Courses
- poj2239 Selecting Courses(最大二分图匹配 (匈牙利算法) 实现 )
- 大数运算,HDNOJ——1002 A + B Problem II
- Android自定义View---Canvas绘制贝塞尔曲线
- SQL Server - 数据库初识
- 黑马程序员-------正则表达式
- 我的错误
- hdu 1083 Courses(二分匹配之匈牙利算法)
- 在Ubuntu上安装PPTP VPN服务
- uva 540(Team Queue)
- noip2015五校联考2总结
- Java垃圾回收机制与典型的垃圾回收算法
- Android自定义View——动态ProgressBar之模仿360加速球
- APP ID检查过程中,提示核对付款信息
- 创建一个服务
- UI_UISlider