poj 2239
来源:互联网 发布:usbkiller算法注册机 编辑:程序博客网 时间:2024/05/19 08:40
还是一道二分图匹配的入门题,熟悉一下算法,练练手。
代码(C++):
#include <cstdlib>#include <iostream>#include <vector>#define MAX 350using namespace std;//#define LOCALvector<int> G[MAX];int ans,cx[MAX],cy[MAX];bool tag[MAX];void add_edge(int a,int b){ G[a].push_back(b); }bool dfs(int u){ int i,v; for(i=0;i<G[u].size();i++) { v=G[u][i]; if(!tag[v]) { tag[v]=true; if(cy[v]==0||dfs(cy[v])) { cx[u]=v; cy[v]=u; return true; } } } return false;}void Hungary(int n){ int i; for(i=1;i<=n;i++) { if(cx[i]==0) { memset(tag,false,sizeof(tag)); if(dfs(i)) ans++; } } }int main(int argc, char *argv[]){#ifdef LOCAL freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);#endif int n,t,a,b,i,j; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) { scanf("%d",&t); for(j=0;j<t;j++) { scanf("%d %d",&a,&b); add_edge(i,b*10+a); } } ans=0; memset(cx,0,sizeof(cx)); memset(cy,0,sizeof(cy)); Hungary(n); printf("%d\n",ans); for(i=1;i<=n;i++) G[i].clear(); } system("PAUSE"); return EXIT_SUCCESS;}
题目(http://poj.org/problem?id=2239):
Selecting Courses
Time Limit: 1000MS Memory Limit: 65536K
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 0
- POJ 2239
- poj 2239
- POJ 1274 / POJ 1469 / POJ 2239 二分图最大匹配
- 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
- POJ 2239 匈牙利算法
- poj 2239 Selecting Courses
- POJ
- COJ1307 City Tour 最短路+二分
- 线性布局--简单计算器的布局
- 二十九 我在软件园的那些日子里
- java使用POI上传Excel
- web前端开发学习笔记
- poj 2239
- Android 获取手机号码及IMEI码
- 自己动手写CPU之第六阶段(4)——验证移动操作指令实现效果
- NSString与NSDate互相转换及NSDate比较
- struts基础知识
- 记于阿里大数据赛第一季之后
- ppp拨号脚本配置
- Linux内核的内存屏障
- Oracle 性能调优 概述