Hdu1083 Courses
来源:互联网 发布:数据分析视频教程 编辑:程序博客网 时间:2024/06/08 01:29
Courses
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
Source
Southeastern Europe 2000
Recommend
We have carefully selected several similar problems for you: 1068 2063 1150 1281 1054
——————————————————————————————
题目的意思是给出n个学生想选的课标号,每个人只能选1门课,每门课只能被1个人选,问最大有几组配对关系
思路:将学生和他想选的课建边,然后跑最大二分图匹配
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <cmath>#include <algorithm>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;const int MAXN=1005;int uN,vN; //u,v数目int g[MAXN][MAXN];int linker[MAXN];bool used[MAXN];int color[MAXN];bool dfs(int u){ int v; for(v=1; v<=vN; v++) if(g[u][v]&&!used[v]) { used[v]=true; if(linker[v]==-1||dfs(linker[v])) { linker[v]=u; return true; } } return false;}int hungary(){ int res=0; int u; memset(linker,-1,sizeof(linker)); for(u=1; u<=uN; u++) { memset(used,0,sizeof(used)); if(dfs(u)) res++; } return res;}int main(){ int m,n,x,y,T; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); memset(g,0,sizeof g); for(int i=1; i<=n; i++) { scanf("%d",&x); for(int j=0;j<x;j++) { scanf("%d",&y); g[i][y]=1; } } uN=n,vN=m; printf("%s\n",hungary()==n?"YES":"NO"); } return 0;}
阅读全文
0 0
- hdu1083 Courses
- 【HDU1083】 Courses
- Hdu1083 Courses
- hdu1083 Courses
- 【二分匹配】 hdu1083 Courses
- poj 1469 && hdu1083 COURSES
- 【二分匹配】HDU1083-Courses
- HDU1083 Courses 二分匹配
- ZOJ1140&&POJ1469&&HDU1083-Courses
- hdu1083 Courses(二分匹配)
- Courses HDU1083 -二分图匹配
- HDU1083 Courses(二分图匹配)
- Courses HDU1083(二分图的匹配)
- hdu1083 Courses ( 二分图最大匹配)
- hdu1083 COURSES(匈牙利水题)
- 【二分图匹配】HDU1083-Courses【模板题】
- hdu1083 Courses--最大匹配 & HK算法
- hdu1083——Courses(匈牙利算法)
- Mybatis的一对一的关联映射 插入
- RANSAC算法及其在消除错配中的应用
- 高负载微服务架构学习
- CentOS7 安装Elasticsearch
- protect oneself,舞步学院教你进行社交关系里的自我保护!保护自己最重要!
- Hdu1083 Courses
- vector 基础
- [WARN] Error setting expression xxx
- 监控摄像机镜头角度和距离计算表
- Android优化系列
- Class.forName与DriverManager区别
- 避免android 内存泄漏
- Android APK反编译详解
- 小度wifi的使用说明