小白算法练习 hdu courses 1083 匈牙利算法 dfs 邻接矩阵 vector模拟邻接表
来源:互联网 发布:js点击弹出再点击隐藏 编辑:程序博客网 时间:2024/06/06 00:39
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8591 Accepted Submission(s): 4186
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
Code
邻接矩阵
#include<iostream>#include<cstring>using namespace std;int map[305][305]; int mask[305];int mx[305];int my[305];int L;int R;int findpath(int u){ for(int i=1;i<=R;i++) { if(map[u][i]==1 && !mask[i]) { mask[i]=1; if(my[i]==-1 || findpath(my[i])) { my[i]=u; mx[u]=i; return 1; } } } return 0;}int maxMatch(){ int res(0); memset(mx,-1,sizeof(mx)); memset(my,-1,sizeof(my)); for(int i=1;i<=L;i++) { if(mx[i]==-1) { memset(mask,0,sizeof(mask)); if(findpath(i)==1) { res++; } } } return res;}int main(){ int t; cin>>t;//组别 while(t--) { //init & input int p,n;//课程数,学生数 cin>>p>>n; L=p; R=n; memset(map,0,sizeof(map)); for(int i=1;i<=p;i++) { int c;//每个课程选择的人数 cin>>c; while(c--) { int x;//学生编号 cin>>x; map[i][x]=1; //map[x][i]=1; } } if(maxMatch()==p) { cout<<"YES"<<endl; } else { cout<<"NO"<<endl; } } return 0;}
邻接表
#include<iostream>#include<cstring>#include<vector>using namespace std;vector<int>vec[350]; int mask[350];int mx[350];int my[350];int L;int R;int findpath(int u){ for(int i=1;i<vec[u].size();i++) { int v=vec[u][i]; if(!mask[v]) { mask[v]=1; if(my[v]==-1 || findpath(my[v])) { my[v]=u; mx[u]=v; return 1; } } } return 0;}int maxMatch(){ memset(mx,-1,sizeof(mx)); memset(my,-1,sizeof(my)); int res(0); for(int i=1;i<=L;i++) { if(mx[i]==-1) { memset(mask,0,sizeof(mask)); if(findpath(i)==1) { res++; } } } return res;}void init(int i,int x){ vec[i].push_back(x);}int main(){ int t; cin>>t;//组别 while(t--) { //init & input int p,n;//课程数,学生数 cin>>p>>n; L=p; R=n; for(int i=0;i<350;i++) { vec[i].clear(); } for(int i=1;i<=p;i++) { int c;//每个课程选择的人数 cin>>c; vec[i].push_back(i); while(c--) { int x;//学生编号 cin>>x; init(i,x); } } if(maxMatch()==p) { cout<<"YES"<<endl; } else { cout<<"NO"<<endl; } } return 0; }
阅读全文
0 0
- 小白算法练习 hdu courses 1083 匈牙利算法 dfs 邻接矩阵 vector模拟邻接表
- 【匈牙利算法】hdu 1083 Courses
- HDU 1083 Courses 匈牙利算法二分匹配(邻接矩阵存关系)
- HDU 1083 Courses( 匈牙利算法 )
- HDU 1083 Courses(二分图,匈牙利算法)
- HDU-1083 Courses(匈牙利算法)
- 小白算法练习 NYOJ 吝啬的国度 dfs+邻接表
- hdu 1083 Courses(二分图匹配 匈牙利算法)
- hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
- hdu 1083 Courses(二分匹配之匈牙利算法)
- HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
- 【二分图匹配-匈牙利算法】Courses HDU
- poj_1469 COURSES匈牙利算法
- 匈牙利算法Courses
- Courses 【匈牙利算法】
- 过山车 邻接表 匈牙利算法
- HDU1803 Courses(二分图匹配,匈牙利算法,dfs)
- poj 1469 COURSES 匈牙利算法
- Can you solve this equation?
- 【HLS】M3U8格式讲解及实际应用分析
- CSDN-markdown语法之如何使用LaTeX语法编写数学公式
- docker示例--下载ubuntu镜像安装python
- SAP内存和ABAP内存的简单介绍说明
- 小白算法练习 hdu courses 1083 匈牙利算法 dfs 邻接矩阵 vector模拟邻接表
- POJ2243 Knight Moves —— A*算法
- 数学之美 贝叶斯 (转载:推荐)
- 【python 验证码】产生中文验证码
- 3524: [Poi2014]Couriers/2223: [Coci 2009]PATULJCI
- 多态
- php中的无限极分类
- 使用netty结合Protostuff传输对象例子
- 解决Apache长时间占用内存大的问题,Apache 内存优化方法