poj1469 COURSES(二分图)
来源:互联网 发布:人工智能介绍视频 编辑:程序博客网 时间:2024/05/22 10:46
题意:有n个学生,p个课程,给出每个课程会有哪些学生去上课,要求我们是否能满足每个课程对应一个不同的学生,这就是二分图匹配,通过非匹配边到匹配边的递归查找,找到最大匹配。这是最简单的二分图,详细看代码模板
COURSESTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu
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
Input
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.
Output
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.
Sample Input
23 33 1 2 32 1 21 13 32 1 32 1 31 1
Sample Output
YESNO
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>#define maxn 304using namespace std;int n, p;int W[105][maxn];//记录边的权值int lef[maxn];//学生的课程匹配点值bool T[maxn];//递归标记,已搜过的不用再搜bool match(int i)//i是课程{for (int j = 1; j <= n; j++)//j是学生{if (W[i][j] && !T[j]){T[j] = true;if (lef[j] == 0 || match(lef[j]))//满足条件:学生和课程没匹配或存在增广路(即非匹配边-匹配边··-非匹配边){lef[j] = i;//学生j与课程i匹配return true;}}}return false;}int main(){int t;scanf("%d", &t);while (t--){scanf("%d%d", &p, &n);int m, temp;memset(W, 0, sizeof(W));memset(lef, 0, sizeof(lef));for (int i = 1; i <= p; i++){scanf("%d", &m);for (int j = 1; j <= m; j++){scanf("%d", &temp);W[i][temp] = 1;}}int sum = 0;for (int i = 1; i <= p; i++){memset(T, 0, sizeof(T));//这是递归路径,所以每次要更新if (match(i))//每次找到会增加一条匹配边sum++;}if (sum == p)printf("YES\n");elseprintf("NO\n");}return 0;}
0 0
- poj1469 COURSES(二分图)
- poj1469--COURSES(二分图最大匹配)
- COURSES(poj1469,二分图最大匹配)
- poj1469 COURSES【二分图匹配】
- 【POJ1469】Courses-二分图最大匹配
- hdu2063 过山车&&poj1469 COURSES(二分匹配)
- POJ1469 COURSES 【二分图最大匹配·HK算法】
- POJ1469——COURSES(二分图最大匹配模板)
- 【二分图最大匹配】【匈牙利算法】poj1469 COURSES && poj2446 Chessboard
- POJ1469[COURSES] 二分图最大匹配 匈牙利算法
- poj1469 COURSES 二分匹配基础题
- poj1469 COURSES 二分匹配模板水题
- POJ1469.COURSES课程——二分匹配
- poj1469 COURSES
- POJ1469:COURSES
- POJ1469 COURSES
- POJ1469 COURSES
- POJ1469 COURSES
- 【IOS】放弃右滑返回后,标题栏上出现了3个蓝点
- Android自定义View进阶《一》
- java 刷题
- Android性能优化之布局优化
- 图像切换器(ImageSwitcher)和画廊视图(Gallery)功能和用法(图片浏览器)
- poj1469 COURSES(二分图)
- 用margin还是用padding 海玉博客笔记
- (开发笔记)转载:-Dmaven.multiModuleProjectDirectory system propery is not set.eclipse中使用maven插件报错
- 第二章 线程安全性
- ORA-21561: OID generation failed
- 发布Qt应用程序(NSIS使用教程)
- 网易内推笔试合集(二)题解
- H.264 NAL层解析(0x00000001,编码,打包,NALU)
- JavaScript垃圾回收机制