hdu 1083 D-COURSES
来源:互联网 发布:微信 数据迁移 sd卡 编辑:程序博客网 时间:2024/05/18 01:56
问题描述
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 the std input. The first line of the input contains the number of the data sets. Each data set is presented in the following format:
P N
Count1 Student 1 1 Student 1 2 ... Student 1 Count1
Count2 Student 2 1 Student 2 2 ... Student 2 Count2
...
CountP Student P 1 Student P 2 ... Student P 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抣l 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.
P N
Count1 Student 1 1 Student 1 2 ... Student 1 Count1
Count2 Student 2 1 Student 2 2 ... Student 2 Count2
...
CountP Student P 1 Student P 2 ... Student P 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抣l 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.
样例输入
23 33 1 2 32 1 21 13 32 1 32 1 31 1
样例输出
YESNO简单二分图匹配,用匈牙利算法;代码如下:#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;int p,n;int ma[301][101];int vis[301];//记录人的访问情况int link[301];bool find(int x){ for(int j=1;j<=n;j++) { if(ma[j][x]&&!vis[j]) { vis[j]=1; if(!link[j]||find(link[j])) { link[j]=x; return true; } } } return false;}int main(){ int t; scanf("%d",&t); while(t--) { memset(ma,0,sizeof(ma)); memset(link,0,sizeof(link)); scanf("%d%d",&p,&n); for(int i=1;i<=p;i++) { int nn; scanf("%d",&nn); for(int j=0;j<nn;j++) { int jj; scanf("%d",&jj); ma[jj][i]=1; } } //课程选人 bool mark=true; for(int i=1;i<=p;i++) { memset(vis,0,sizeof(vis)); if(!find(i)) { mark=false;break; } } if(mark) printf("YES\n"); else printf("NO\n"); }}
0 0
- hdu 1083 D-COURSES
- hdu 1083 Courses
- HDU 1083 Courses
- HDU 1083 Courses 匹配
- hdu 1083 Courses
- hdu 1083 Courses
- hdu/hdoj 1083 Courses
- hdu - 1083 - Courses
- HDU 1083 — Courses
- hdu 1083 Courses
- HDU 1083:Courses
- HDOJ HDU 1083 Courses
- HDU 1083 二分匹配 Courses
- 【匈牙利算法】hdu 1083 Courses
- hdu 1083 Courses 【完全匹配】
- hdu/hdoj 1083 courses 题解
- HDU 1083Courses(最大匹配)
- HDU-1083-Courses [二分匹配]
- 豪沃克幕墙工程计算软件(XWall) v3.5
- centos 7 下安装pandas的小问题
- Kernel硬件中断的初始化流程
- 【第九章】 Spring的事务 之 9.3 编程式事务 ——跟我学spring3
- OPC DCOM 配置说明
- hdu 1083 D-COURSES
- js倒计时
- 内核 API,第 1 部分:从内核调用用户空间应用程序
- 【转】gerrit
- Android APN设置及获得手机号
- 豪沃克幕墙工具包2014下载 v3.3官方版 含64位
- c++11的10个新特性
- C++与Java使用SOCKET通信遇到的一种阻塞问题的解决
- Android不同分辨率的Drawable资源配置