poj 1469:COURSES
来源:互联网 发布:网络四大邪书 编辑:程序博客网 时间:2024/06/05 04:19
1469:COURSES
- 查看
- 提交
- 统计
- 提示
- 提问
- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB
- 描述
- 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
- every student in the committee represents a different course (a student can represent a course if he/she visits that course)
- 输入
- Your program should read sets of data from the std input. The first line of the input 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抣l 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.
- 样例输入
23 33 1 2 32 1 21 13 32 1 32 1 31 1
- 样例输出
YESNO
- 来源
- Southeastern Europe 2000
- 匈牙利算法
#include<iostream>#include<cstring>#include<cmath>#include<algorithm>#include<iomanip>#include<cstdlib>#include<vector>#include<set>#include<map>#include<queue>#include<list>using namespace std;int T,P,N,n,x;bool g[305][105];int my[305];bool vst[305];bool Dfs(int i) {for(int j=1;j<=N;++j){if(g[j][i]&&vst[j]==0){vst[j]=true;if(my[j]==0||Dfs(my[j])){my[j]=i;return true;}}}return false;}int Hungary(){int i,Ans=0;memset(my,0,sizeof(my));for(i=1;i<=P;++i){memset(vst,0,sizeof(vst));if(Dfs(i)){Ans++;}}return Ans;}int main(){cin>>T;while(T--) {cin>>P>>N;memset(g,0,sizeof(g));for(int i=1;i<=P;++i){cin>>n;for(int j=1;j<=n;++j){cin>>x;g[x][i]=true;}}if(Hungary()==P){cout<<"YES"<<endl;}else{cout<<"NO"<<endl; } }return 0;}
阅读全文
0 0
- POJ 1469 courses
- POJ-1469 COURSES
- POJ 1469 COURSES
- poj 1469 && hdu1083 COURSES
- POJ 1469 COURSES
- poj(1469)COURSES
- POJ-1469-COURSES
- POJ 1469 COURSES
- poj 1469 COURSES
- POJ 1469 COURSES
- poj 1469 COURSES
- POJ 1469:COURSES
- POJ 1469 COURSES
- poj 1469 COURSES 题解
- POJ 1469 COURSES
- poj 1469 COURSES
- POJ 1469 COURSES
- poj 1469COURSES
- Spark2.0源码学习-Job提交与Task的拆分
- python 函数式编程
- SqlHelper 用法总结
- 深入理解HTTP协议(转)
- 2017年之年中总结
- poj 1469:COURSES
- Mysql数据库中不能插入中文
- python 05
- poj 3243:A Simple Problem with Integers
- 源文件与模块生成时的文件不同
- CUDA编程学习二
- 排序:冒泡排序
- 《Effective C++》读书摘要
- File