POJ 1469二分图最大匹配
来源:互联网 发布:三个代表重要思想 知乎 编辑:程序博客网 时间:2024/05/20 23:58
COURSES
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15672 Accepted: 6189
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
Input
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.
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.
Output
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.
Sample Input
23 3
3 1 2 3
2 1 2
1 1
3 3
2 1 3
2 1 3
1 1
Sample Output
YESNO
1Y
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>using namespace std;const int N=1005;const int maxn=1005;int map[N][N],Linker[maxn];int used[maxn];int res,Num,P;int DFS(int u){ int v; for(v=1;v<=Num;v++) { if(map[u][v]&&!used[v]) { used[v]=1; if(Linker[v]==-1||DFS(Linker[v])) { Linker[v]=u; return 1; } } } return 0;}int Hungary(){ int res=0; int u; memset(Linker,-1,sizeof(Linker)); for(u=1;u<=P;u++) { memset(used,0,sizeof(used)); if(DFS(u)) res++; } return res;}int main(){ int test,temp,n,v,i,u; scanf("%d",&test); while(test--) { scanf("%d%d",&P,&Num); memset(map,0,sizeof(map)); memset(Linker,-1,sizeof(Linker)); for(u=1;u<=P;u++) { scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&v); map[u][v]=1; } } res=Hungary(); if(res==P) puts("YES"); else puts("NO"); } return 0;}
- POJ 1469 二分图最大匹配
- poj 1469 二分图最大匹配
- POJ 1469二分图最大匹配
- POJ 1469 二分图最大匹配 COURSES
- POJ 1469 COURSES(二分图最大匹配)
- 【二分图|最大匹配】POJ-1469 COURSES
- poj 1469 COURSES 二分图最大匹配
- POJ 1469 COURSES(二分图最大匹配)
- POJ 1469 COURSES(最大二分图匹配)
- POJ-1469 COURSES(二分图最大匹配)
- POJ 1274 / POJ 1469 / POJ 2239 二分图最大匹配
- poj 2446 poj 1469 poj 1274 二分图最大匹配
- poj 1469 COURSES (二分图最大匹配)
- poj 1469 COURSES 二分图最大匹配数
- 二分图最大匹配——POJ 1469
- POJ 1469 COURSES (二分图最大匹配 匈牙利算法)
- poj 1469 COURSES 二分图最大匹配 匈牙利算法
- POJ 1469 && ZOJ 1140 --COURSES【二分图 && 最大匹配】
- 黑马程序员_内部类_2
- poj 1741 (树的分治)
- HDU1166敌兵布阵(线段树单点更新)
- Android 实现事件监听的两个方法
- 强大的vim配置文件,让编程更随意
- POJ 1469二分图最大匹配
- 随机函数rand()[c++]
- Android SDK开发环境搭建
- inno setup打包,win7下安装没有桌面快捷方式,xp下安装正常
- OCP-1Z0-053-V12.02-89题
- https:自行办法浏览器证书
- 局部敏感哈希(Locality-Sensitive Hashing, LSH)方法介绍
- 33 - Sudoku Solver
- HDU1385Minimum Transport Cost--Floyd