hdu1083——Courses(匈牙利算法)
来源:互联网 发布:java date 加减 编辑:程序博客网 时间:2024/05/18 13:24
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
求课程与人数能不能组成一一对应的关系,其实就是求二分图的最大匹配是否等于课程数
#include <iostream>#include <cstring>#include <string>#include <vector>#include <queue>#include <cstdio>#include <set>#include <cmath>//#include <map>#include <algorithm>#define INF 0x3f3f3f3f#define MAXN 305#define Mod 10001using namespace std;bool vis[MAXN];int n,p;int mp[MAXN][MAXN],pre[MAXN]; //匹配路径;int find(int cur){ for(int i=1; i<=n; ++i) { if(!vis[i]&&mp[cur][i]) { vis[i] = true; if(pre[i] == 0 || find(pre[i])) { pre[i]=cur; return 1; } } } return 0;}int main(){ int t; scanf("%d",&t); while(t--) { memset(mp,0,sizeof(mp)); memset(pre,0,sizeof(pre)); scanf("%d%d",&p,&n); for(int i=1;i<=p;++i) { int cnt,x; scanf("%d",&cnt); while(cnt--) { scanf("%d",&x); mp[i][x]=1; } } int ans=0; for(int i=1;i<=p;++i) { memset(vis,0,sizeof(vis)); if(find(i)) ans++; } if(ans==p) printf("YES\n"); else printf("NO\n"); } return 0;}
- hdu1083——Courses(匈牙利算法)
- hdu1083 COURSES(匈牙利水题)
- hdu1083 Courses(二分匹配)
- hdu1083 Courses
- 【HDU1083】 Courses
- Hdu1083 Courses
- hdu1083 Courses
- HDU1083+POJ1469 (匈牙利算法+最大二分匹配)
- java实现二分图匹配匈牙利算法(HDU1083)
- hdu1083 Courses--最大匹配 & HK算法
- 杭电OJ 1083——courses(二分图的匹配问题!匈牙利算法解答)
- HDU 1083 Courses( 匈牙利算法 )
- HDU-1083 Courses(匈牙利算法)
- poj_1469 COURSES匈牙利算法
- 匈牙利算法Courses
- Courses 【匈牙利算法】
- HDU1083--Courses(二分图最大匹配)
- HDU1083---Courses (二分图匹配)
- 1097. Deduplication on a Linked List
- 【JZOJ4799】我的快乐时代
- Linux 安装 MongoDB总结
- POJ 2262 Goldbach's Conjecture 简单的素数
- 3 Python 函数传参_(不)可变类型
- hdu1083——Courses(匈牙利算法)
- 全排列问题
- HTMl5的存储方式sessionStorage和localStorage详解
- F - shǎ崽 OrOrOrOrz
- CSS3 Filter特效详解
- Uva 133 救济金发放
- 注入(3)--远程线程注入(CreateRemoteThread)
- 找第k大的东西(密码,uva 1262)
- 求两个整数的最大公约数和最小公倍数(通过调用自定义函数实现)