hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了hdu Courses 1083 二分匹配 ,匈牙利算法。。水题,小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含2804字,纯文字阅读大概需要5分钟。
内容图文
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4233 Accepted Submission(s): 2014
. 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:
2 3 3 3 1 2 3 2 1 2 1 1 3 3 2 1 3 2 1 3 1 1
YES NO
#include <stdio.h> #include <string.h> #define SIZE 350 int pre[SIZE] , p , n ; bool map[SIZE][SIZE] , vis[SIZE]; int find(int pos) { for(int i = 1 ; i <= n ; ++i) { if(!vis[i] && map[pos][i]) { vis[i] = true ; if(pre[i] == -1 || find(pre[i])) { pre[i] = pos ; return 1 ; } } } return 0 ; } int main() { int t ; scanf("%d",&t) ; while(t--) { scanf("%d%d",&p,&n) ; memset(map,false,sizeof(map)) ; memset(pre,-1,sizeof(pre)) ; for(int i = 1 ; i <= p ; ++i) { int j ; scanf("%d",&j); while(j--) { int c ; scanf("%d",&c); map[i][c] = true ; } } int cnt = 0 ; for(int i = 1 ; i <= p ; ++i) { memset(vis,false,sizeof(vis)) ; cnt += find(i) ; } if(cnt==p) puts("YES") ; else puts("NO") ; } return 0 ; }与君共勉
原文:http://blog.csdn.net/lionel_d/article/details/45331061
内容总结
以上是互联网集市为您收集整理的hdu Courses 1083 二分匹配 ,匈牙利算法。。水题全部内容,希望文章能够帮你解决hdu Courses 1083 二分匹配 ,匈牙利算法。。水题所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。