hdu1083二分图匹配
来源:互联网 发布:跟单软件下载 编辑:程序博客网 时间:2024/05/22 03:29
C - Courses
Time Limit:10000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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
#include <iostream>#include <vector>#include <stdio.h>#include <queue>#include <string.h>using namespace std;const int maxn=10010;const int maxm=50050;vector<int>G[maxm];void add_edge(int u,int v){ G[u].push_back(v); G[v].push_back(u);}void init(int n){ for(int i=0;i<=n;i++) G[i].clear();}int linker[maxn];bool used[maxn];int dfs(int u){ for(int i=0;i<G[u].size();i++) { int v=G[u][i]; if(!used[v]) { used[v]=true; if(linker[v]==-1||dfs(linker[v])) { linker[v]=u; return true; } } } return false;}int solve(int n){ int ans=0; memset(linker,-1,sizeof(linker)); for(int i=1;i<=n;i++) { memset(used,false,sizeof(used)); if(dfs(i)) ans++; } return ans;}int main(){ int n,m; int u,v,num; cin>>u; while(u--) { scanf("%d%d",&m,&n); init(n); for(int i=1;i<=m;i++) { scanf("%d",&num); for(int j=0;j<num;j++) { scanf("%d",&v); add_edge(i,v+m); add_edge(v+m,i); } } int ans=solve(m); if(ans==m) printf("YES\n"); else printf("NO\n"); } return 0;}
0 0
- hdu1083二分图匹配
- hdu1083(二分图匹配)
- hdu1083【二分图】【最大匹配】
- Courses HDU1083 -二分图匹配
- HDU1083 Courses(二分图匹配)
- Courses HDU1083(二分图的匹配)
- HDU1083(二分图+最大匹配+匈牙利算法)
- hdu1083 Courses ( 二分图最大匹配)
- 【二分图匹配】HDU1083-Courses【模板题】
- HDU1083--Courses(二分图最大匹配)
- hdu1083培训班 ~~二分图最大匹配
- HDU1083---Courses (二分图匹配)
- 【二分匹配】 hdu1083 Courses
- hdu1083二分匹配基础
- 【二分匹配】HDU1083-Courses
- HDU1083 最大二分匹配
- HDU1083 Courses 二分匹配
- 【HDU1083】【最大二分匹配】
- iOS数据库升级步骤
- php防止sql注入
- 为什么循环队列具有先天的并行性
- 字符串的排列
- R语言学习:数据结构5-因子
- hdu1083二分图匹配
- Hibenate错误汇总:java.lang.NoClassDefFoundError:
- thinking in java 21_03
- bzoj2241 打地鼠 暴力&&二维差分
- CodeForces 609 B. The Best Gift(水~)
- GCD详解
- centos6修改YUM源方法
- binary-search-tree-iterator
- Android ListView 的基本用法