HDU-1083 Coures
来源:互联网 发布:sql update空值 编辑:程序博客网 时间:2024/05/22 03:13
Courses
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7783 Accepted Submission(s): 3812
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
基础题,巩固算法。
#include <iostream>#include <stdio.h>#include <algorithm>#include <cmath>#include <string.h>using namespace std;#define maxn 305int line[maxn][maxn],used[maxn],pre[maxn];int t,p,n,m,k;int find(int x){ for(int i=0;i<=n;i++){ if(line[x][i]==1&&!used[i]){ used[i]=1; if(!pre[i]||find(pre[i])){ pre[i]=x; return 1; } } } return 0;}int main(){ scanf("%d",&t); while(t--){ memset(line,0,sizeof(line)); memset(pre,0,sizeof(pre)); scanf("%d%d",&p,&n); for(int i=1;i<=p;i++){ scanf("%d",&m); while(m--){ scanf("%d",&k); line[i][k]=1; } } int sum=0; for(int i=1;i<=p;i++){ memset(used,0,sizeof(used)); if(find(i)) sum++; } if(sum==p) printf("YES\n"); else puts("NO"); } return 0;}
阅读全文
0 0
- HDU-1083 Coures
- HDU 1083 Coures(二分图匹配)
- coures包下载和安装 可解决报错ImportError: No module named '_curses'
- coures包下载和安装 可解决报错ImportError: No module named '_curses'
- HDU 1083
- hdu 1083
- HDU 1083
- hdu 1083
- hdu 1083
- HDU 1083
- hdu 1083
- HDU----1083
- HDU-1083
- hdu-2444,hdu-1083 (二分匹配)
- hdu 1083 Courses
- HDU 1083 最大匹配
- HDU 1083 Courses
- HDU 1083 二分匹配
- Maven学习(一) -- 安装Maven及Eclipse中配置Maven
- P2P加速系统解决方案
- 【Google Chrome】 Cross origin requests are only supported for protocol schemes: http, data, chrome, c
- 泛型
- MySQL与Oracle数据类型对应关系(表格形式)
- HDU-1083 Coures
- MySQL下载与安装
- vim 配置
- 手机号码、电子邮箱、身份证、银行卡正则验证
- Mac Safari 打不开网页,因为无法连接到服务器
- 解决ScrollView自动滑动到底部的问题
- PyQt5中文基础教程3 菜单栏和工具栏
- layer.layerInfos为空的问题
- mac上所需软件的安装