HDOJ Courses 1083
来源:互联网 发布:云端软件平台 替代 编辑:程序博客网 时间:2024/06/10 18:22
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4313 Accepted Submission(s): 2054
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 <iostream>#include <stdio.h>#include<string.h>#include<algorithm>#include<queue>#include<stack>using namespace std;int pipei[310];bool used[310];int map[300][301];int n,p;bool find(int x){for(int i=1;i<=n;i++){if(!used[i]&&map[x][i]){used[i]=true;if(pipei[i]==-1||find(pipei[i])){pipei[i]=x;return true;}}}return false;}int main(){int t;scanf("%d",&t);while(t--){scanf("%d%d",&p,&n);int m;memset(map,0,sizeof(map));memset(pipei,-1,sizeof(pipei));int x;for(int i=1;i<=p;i++){scanf("%d",&m);while(m--){scanf("%d",&x);map[i][x]=1;}}int res=0;for(int i=1;i<=p;i++){memset(used,0,sizeof(used));if(find(i))res++;}if(res==p)printf("YES\n");else printf("NO\n");} return 0;}
0 0
- hdu/hdoj 1083 Courses
- ACM HDOJ 1083 (Courses)
- hdoj 1083 Courses
- HDOJ Courses 1083
- HDOJ HDU 1083 Courses
- hdu/hdoj 1083 courses 题解
- hdoj--1083--Courses(最大匹配)
- hdoj 1083 Courses 【匈牙利算法&&二分图匹配】
- Hdoj 3697 Selecting courses 【贪心】
- HDOJ 题目1083Courses(二分图匹配,匈牙利算法模板)
- hdu 1083 Courses
- HDU 1083 Courses
- HDU 1083 Courses 匹配
- hdu 1083 Courses
- 杭电1083-Courses
- hdu 1083 Courses
- hdu - 1083 - Courses
- HDU 1083 — Courses
- Android动画
- 抓包技术
- TextView_跑马灯效果
- 修改 protobuf repeated类型数据结构
- android 实现在照片上涂鸦
- HDOJ Courses 1083
- 如何清除Android Studio下载的远程aar缓存
- 《PNG文件格式》(一)PNG文件概述
- hadoop2.6.0三台服务器分布式集群环境的搭建
- 安裝 CentOS 7 後必做的七件事
- Java 回调函数的理解
- 理想的程序大师是如何样炼成的
- 如何在Ubuntu14.04下Matlab调用摄像头
- jfinal easyui datagrid