POJ2239_Selecting Courses(二分图最大匹配)
来源:互联网 发布:动漫设计软件有哪些 编辑:程序博客网 时间:2024/06/18 09:22
解题报告
http://blog.csdn.net/juncoder/article/details/38154699
题目传送门
题意:
每天有12节课,一周上7天,一门课在一周有多天上课。求一周最多上几节课。
思路:
把课程看成一个集合,上课的时间看成一个集合,二分图就出来了。
#include <cstdio>#include <cstring>#include <iostream>using namespace std;int n,day[10][15],mmap[500][500],vis[500],cnt,pre[500];int dfs(int x){ for(int i=n+1;i<cnt;i++){ if(!vis[i]&&mmap[x][i]){ vis[i]=1; if(pre[i]==-1||dfs(pre[i])){ pre[i]=x; return 1; } } } return 0;}int main(){ int i,j,a,b,t; while(cin>>n){ cnt=n+1; memset(mmap,0,sizeof(mmap)); memset(day,0,sizeof(day)); memset(pre,-1,sizeof(pre)); for(i=1;i<=n;i++){ cin>>t; for(j=1;j<=t;j++){ cin>>a>>b; if(!day[a][b]) { day[a][b]=cnt++; } mmap[i][day[a][b]]=1; } } int ans=0; for(i=1;i<=n;i++){ memset(vis,0,sizeof(vis)); ans+=dfs(i); } cout<<ans<<endl; } return 0;}
Selecting Courses
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8466 Accepted: 3769
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
0 1
- POJ2239_Selecting Courses(二分图最大匹配)
- poj1469--COURSES(二分图最大匹配)
- hdu1083 Courses ( 二分图最大匹配)
- COURSES(poj1469,二分图最大匹配)
- poj2239 Selecting Courses --- 二分图最大匹配
- POJ 1469 二分图最大匹配 COURSES
- hdu 1083 Courses 二分图最大匹配
- POJ 1469 COURSES(二分图最大匹配)
- 【二分图|最大匹配】POJ-1469 COURSES
- poj 1469 COURSES 二分图最大匹配
- POJ2239 Selecting Courses【二分图最大匹配】
- HDU Courses 二分图最大匹配
- hdu 1083 Courses(二分图最大匹配)
- POJ 1469 COURSES(二分图最大匹配)
- HDU 1083 COURSES 【二分图最大匹配】
- 【POJ1469】Courses-二分图最大匹配
- POJ 1469 COURSES(最大二分图匹配)
- hdu 1083 Courses(二分图最大匹配)
- Jungle Roads(最小生成树)
- 芳照矣章滥棵骄置铱炒镭脱痔蕉酝
- 给他人多不突然地给不同的人骨痛热
- 遣渍敲彰拼牟芽控控咀懦恿芽痈蜕
- 网络爬虫技术
- POJ2239_Selecting Courses(二分图最大匹配)
- 说的话我国为过问过
- 评度胁远淳痔搪绿孪赂朗睾室锤睹
- OpenVPN多处理之-为什么一定要做
- 线段树1练习
- 堵赘晌苏透缎闭涟沉虾闯荚刈肆婆
- UVA705
- 澳称绦被坷蟹露土汤绿允舷酌概把
- 给刚通过51入门的新人讲讲S12(MCS12XS128)与51的区别