集训队专题(6)1008 Courses
2016-02-22 14:32
218 查看
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5497 Accepted Submission(s): 2649
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:
Sample Input
2 3 3 3 1 2 3 2 1 2 1 1 3 3 2 1 3 2 1 3 1 1
Sample Output
YES NO
Source
Southeastern Europe 2000
此题就是一个裸的二分图题,比起专题前面的题都简单很多,小编这里就不多加赘述。
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 300+10; int uN,vN; int g[maxn][maxn],linker[maxn]; bool used[maxn]; bool dfs(int u) { int v; for(v=1; v<=vN; 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<=uN; u++) { memset(used,0,sizeof(used)); if(dfs(u)) res++; } return res; } int main() { int t,n,m,u,v; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(g,0,sizeof(g)); for(int i=1; i<=n; i++) { scanf("%d",&u); while(u--) { scanf("%d",&v); g[i][v] = 1; } } uN = n; vN = m; int ans = hungary(); if(ans == n) printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- 微信企业号开发1--连接
- jsp 内置对象总结
- mac下面点击右键
- 安卓开发Activity转换动画
- js for循环输出i为同一值得问题
- 有免费的邮件系统 为何要选择收费的?
- servlet类的简单运用
- Git 命令行详解
- 了解负载均衡 会话保持 session同步 session同步、共享的3种解决方法
- 有免费的邮件系统 为何要选择收费的?
- 拉普拉斯矩阵
- 全面了解 iOS 静态库开发
- maven命令
- [Wireshark]wireshark 教程
- 源码推荐(02.22B):模仿QQ弹出视图,tableView和collectionView间转场动画
- JS调试必备的5个debug技巧(转)
- jQuery源码解析(1)—— jq基础、data缓存系统
- 真机运行时问题
- iOS 设计模式之工厂方法模式(FactoryMethod)
- PHP安装PHPRedis扩展