HDU1083--Courses(二分图最大匹配)
来源:互联网 发布:淘宝网上有电击枪吗 编辑:程序博客网 时间:2024/05/22 04:51
Do more with less
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:
Input
2
3 3
3 1 2 3
2 1 2
1 1
3 3
2 1 3
2 1 3
1 1
Output
YES
NO
代码
#include <iostream>#include <cstdio>#include <cstring>int stu[305];int n,m;bool findx[305][305];bool used[305];bool find(int x){ for(int i = 1; i <= m; i ++) { if(findx[x][i] && !used[i]) { used[i] = 1; if(!stu[i] || find(stu[i])) { stu[i] = x; return true; } } } return false;}int main(){ int T; scanf("%d",&T); while(T--) { memset(findx,false,sizeof(findx)); memset(stu,0,sizeof(stu)); scanf("%d %d",&n,&m); for(int i = 1; i <= n; i ++) { int k,h; scanf("%d",&k); for(int j = 0; j < k; j ++) { scanf("%d",&h); findx[i][h] = true; } } int all = 0; for(int i = 1; i <= n; i ++) { memset(used,false,sizeof(used)); if(find(i)) all++; } if(all == n) printf("YES\n"); else printf("NO\n"); }}
- HDU1083--Courses(二分图最大匹配)
- hdu1083 Courses ( 二分图最大匹配)
- HDU1083---Courses (二分图匹配)
- Courses HDU1083 -二分图匹配
- HDU1083 Courses(二分图匹配)
- hdu1083 Courses(二分匹配)
- 【二分匹配】 hdu1083 Courses
- 【二分匹配】HDU1083-Courses
- HDU1083 Courses 二分匹配
- Courses HDU1083(二分图的匹配)
- 【二分图匹配】HDU1083-Courses【模板题】
- hdu1083【二分图】【最大匹配】
- HDU1083 最大二分匹配
- 【HDU1083】【最大二分匹配】
- HDU1083 最大二分匹配
- poj1469--COURSES(二分图最大匹配)
- COURSES(poj1469,二分图最大匹配)
- hdu1083(二分图匹配)
- Android ImageLoader DisplayImageOptions 函数详解
- geoserver
- listener
- 【代码积累】FutureTask
- 微信小程序开发(1)---简介
- HDU1083--Courses(二分图最大匹配)
- 软件工程师解决问题指导手册
- 手把手教你入门MySQL零基础入门教程!
- QT5.7报错error: undefined reference to `XXX::staticMetaObject'
- VPN连接配置
- 文章标题
- 资源分享:嵌入式stm32项目开发 心率检测仪的设计与实现
- 注解&servlet3.0
- Precision和Recall