poj--2239--Selecting Courses(最大匹配)
来源:互联网 发布:淘宝必须用支付宝吗 编辑:程序博客网 时间:2024/05/18 19:19
Selecting Courses
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9782 Accepted: 4400
Description
It is well known that it is not easy to select courses in the college, for there is usually conflict among the time of the courses. Li Ming is a student who loves study every much, and at the beginning of each term, he always wants to select courses as more as possible. Of course there should be no conflict among the courses he selects.
There are 12 classes every day, and 7 days every week. There are hundreds of courses in the college, and teaching a course needs one class each week. To give students more convenience, though teaching a course needs only one class, a course will be taught several times in a week. For example, a course may be taught both at the 7-th class on Tuesday and 12-th class on Wednesday, you should assume that there is no difference between the two classes, and that students can select any class to go. At the different weeks, a student can even go to different class as his wish. Because there are so many courses in the college, selecting courses is not an easy job for Li Ming. As his good friends, can you help him?
There are 12 classes every day, and 7 days every week. There are hundreds of courses in the college, and teaching a course needs one class each week. To give students more convenience, though teaching a course needs only one class, a course will be taught several times in a week. For example, a course may be taught both at the 7-th class on Tuesday and 12-th class on Wednesday, you should assume that there is no difference between the two classes, and that students can select any class to go. At the different weeks, a student can even go to different class as his wish. Because there are so many courses in the college, selecting courses is not an easy job for Li Ming. As his good friends, can you help him?
Input
The input contains several cases. For each case, the first line contains an integer n (1 <= n <= 300), the number of courses in Li Ming's college. The following n lines represent n different courses. In each line, the first number is an integer t (1 <= t <= 7*12), the different time when students can go to study the course. Then come t pairs of integers p (1 <= p <= 7) and q (1 <= q <= 12), which mean that the course will be taught at the q-th class on the p-th day of a week.
Output
For each test case, output one integer, which is the maximum number of courses Li Ming can select.
Sample Input
51 1 12 1 1 2 21 2 22 3 2 3 31 3 3
Sample Output
4
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int map[400][10][20];int used[10][20],pipei[10][20];int find(int x){for(int i=1;i<=7;i++){for(int j=1;j<=12;j++){if(!used[i][j]&&map[x][i][j]){used[i][j]=1;if(!pipei[i][j]||find(pipei[i][j])){pipei[i][j]=x;return 1;}}}}return 0;}int main(){int n;while(scanf("%d",&n)!=EOF){memset(map,0,sizeof(map));memset(pipei,0,sizeof(pipei));for(int i=1;i<=n;i++){int t;scanf("%d",&t);while(t--){int x,y;scanf("%d%d",&x,&y);map[i][x][y]=1;}}int sum=0;for(int i=1;i<=n;i++){memset(used,0,sizeof(used));sum+=find(i);}printf("%d\n",sum);}return 0;}
0 0
- poj--2239--Selecting Courses(最大匹配)
- poj 2239 Selecting Courses 最大匹配
- poj Selecting Courses 2239 (二分图最大匹配)
- POJ 2239 Selecting Courses(最大匹配数)
- poj 2239 Selecting Courses 匹配
- POJ 2239Selecting Courses(二分图最大匹配之最大匹配)
- poj 2239 Selecting Courses 二分图最大匹配数
- poj 2239 Selecting Courses 二分图最大匹配
- Poj 2239 Selecting Courses 二分图最大匹配
- POJ 2239 Selecting Courses(二分图最大匹配)
- POJ 2239 Selecting Courses(二分图最大匹配)
- poj 2239 Selecting Courses 二分图最大匹配
- POJ 2239-Selecting Courses(二分图_最大匹配+哈希建图)
- poj 2239 Selecting Courses 【二分图最大匹配】
- POJ - 2239 Selecting Courses 二分图 最大匹配
- POJ 2239--Selecting Courses【二分图 && 最大匹配数 && 水题】
- POJ 2239 Selecting Courses(二分图最大匹配)
- POJ 2239 Selecting Courses(二分图最大匹配)
- SQL serber 删除带有默认值的字段
- Reverse Linked List 2
- helloworld及基础
- ZendStudio快捷键
- 深度学习笔记(一)空间金字塔池化阅读笔记Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition
- poj--2239--Selecting Courses(最大匹配)
- git常用命令学习笔记
- Android 的自定义等待对话框
- 九宫格拼图 我的java学习之路
- 504 Gateway Time-out
- 【ROS学习】(三)package.xml和CmakeList.txt文件的编写
- acct(系统调用)
- IOS学习之提示框第三方库之MBProgressHUD
- ZOJ 1042 W's cipher