HDU 1083 Courses (二分图)
来源:互联网 发布:网络大学有哪些 编辑:程序博客网 时间:2024/05/21 21:39
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5648 Accepted Submission(s): 2717
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: 2444 1150 1281 1045 1054
二分图的最大匹配,模板题
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int map[1110][1110];int xm[1110],ym[1110],v[1110];int n,p;int find(int x){int i;for(i=1;i<=n;i++){if(!v[i]&&map[x][i]){v[i]=1; if(ym[i]==-1||find(ym[i])) { ym[i]=x; xm[x]=i; return 1; } } }return 0;}int main(){int t;scanf("%d",&t);while(t--){int i,j,k,l,m;scanf("%d%d",&p,&n);int sum=0;memset(xm,-1,sizeof(xm));memset(ym,-1,sizeof(ym));memset(map,0,sizeof(map));for(i=1;i<=p;i++){scanf("%d",&m);while(m--){int a;scanf("%d",&a);map[i][a]=1;}}for(i=1;i<=p;i++){if(xm[i]==-1){memset(v,0,sizeof(v));if(find(i))sum++; }}if(sum==p)printf("YES\n");elseprintf("NO\n");}return 0;}
0 0
- hdu 1083 Courses (二分图匹配)
- HDU 1083 Courses(二分图匹配)
- HDU 1083 Courses (二分图)
- hdu 1083 Courses(二分图匹配 匈牙利算法)
- HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
- hdu 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 [二分匹配]
- COURSES(二分图)
- 『C++ Primer学习笔记』Chapter 4
- 跑马灯效果
- 支持向量机SVM算法学习(三)
- Python for
- Android 点击按钮时改变颜色
- HDU 1083 Courses (二分图)
- Android小程序-涂鸦板
- ListView使用多个布局
- 支持向量机SVM算法学习(四)
- java工程中使用freemarker例子
- libvirt源码分析——libvirtd的初始化
- 2016.4.7JavaScript入门
- Ubuntu环境下搭建nutch环境
- lightoj 1122 - Digit Count(dp)