hdoj--1083--Courses(最大匹配)
来源:互联网 发布:linux 没有home目录 编辑:程序博客网 时间:2024/06/06 19:05
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5411 Accepted Submission(s): 2597
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 2444 1150 1281 1045
#include<stdio.h>#include<string.h>#include<vector>#include<algorithm>using namespace std;int pipei[500],used[500];vector<int>map[500];int find(int x){for(int i=0;i<map[x].size();i++){int y=map[x][i];if(!used[y]){used[y]=1;if(!pipei[y]||find(pipei[y])){pipei[y]=x;return 1;}}}return 0;}int main(){int t;scanf("%d",&t);while(t--){int n,m;scanf("%d%d",&n,&m);memset(pipei,0,sizeof(pipei));for(int i=1;i<=n;i++)map[i].clear();for(int i=1;i<=n;i++){int x,y;int k;scanf("%d",&k);while(k--){scanf("%d",&y);map[i].push_back(y);}}int sum=0;for(int i=1;i<=n;i++){memset(used,0,sizeof(used));sum+=find(i);}if(sum==n)printf("YES\n");elseprintf("NO\n");}return 0;}
0 0
- hdoj--1083--Courses(最大匹配)
- hdu 1083 Courses (最大匹配)
- HDU 1083 Courses (二分最大匹配)
- hdu 1083 Courses(二分最大匹配)
- HDU 1083 Courses(最大匹配)
- HDU 1083Courses(最大匹配)
- hdu 1083 Courses最大匹配
- HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
- HDU 1083 Courses(最大匹配模版题)
- hdu 1083 Courses 二分图最大匹配
- hdu 1083 Courses(二分图最大匹配)
- HDU 1083 COURSES 【二分图最大匹配】
- hdu 1083 Courses(二分图最大匹配)
- poj1469--COURSES(二分图最大匹配)
- COURSES(poj1469,二分图最大匹配)
- poj--2239--Selecting Courses(最大匹配)
- COURSES(裸二部图最大匹配)
- HDU1083--Courses(二分图最大匹配)
- 树状数组
- wxPython 控件
- 172Factorial Trailing Zeroes
- 最短路径(floyd算法)
- VS使用笔记
- hdoj--1083--Courses(最大匹配)
- 用java快速批量insert数据
- iOS App转让
- Mac OS X Git安装教程
- Java 基于 TCP/IP 实现 Socket中的多客户端通信
- Treap平衡树
- 安卓EditView控件回车按钮的监听事件,解决界面onkey无效
- HTML -笔记01-列表使用初识
- POJ2349 (prim)