poj 2239 Selecting Courses
2015-11-12 21:21
363 查看
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?
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
5 1 1 1 2 1 1 2 2 1 2 2 2 3 2 3 3 1 3 3
Sample Output
4
Key To Problem
二分图求最大匹配裸题Code
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #define N 310 using namespace std; struct ss { int next,to; }; ss Edge[N*N]; int n,tot; int f ; int head ; bool used ; void add(int x,int y) { Edge[++tot].next=head[x]; Edge[tot].to=y; head[x]=tot; } bool dfs(int u) { for(int i=head[u];i;i=Edge[i].next) { int to=Edge[i].to; if(!used[to]) { used[to]=true; if(f[to]==-1||dfs(f[to])) { f[to]=u; return true; } } } return false; } int hungary() { int cnt=0; memset(f,-1,sizeof(f)); for(int i=1;i<=n;i++) { memset(used,0,sizeof(used)); if(dfs(i))cnt++; } return cnt; } int main() { while(scanf("%d",&n)!=EOF) { memset(head,0,sizeof(head)); tot=0; for(int i=1;i<=n;i++) { int x,y,z; scanf("%d",&x); for(int j=1;j<=x;j++) { scanf("%d%d",&y,&z); add(i,12*(y-1)+z); } } printf("%d\n",hungary()); } return 0; } //orz PoPoQQQ
相关文章推荐
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1001
- POJ ACM 1002
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- POJ 2773 HAPPY 2006
- POJ 3090 Visible Lattice Points
- POJ-2409-Let it Bead&&NYOJ-280-LK的项链
- POJ-1695-Magazine Delivery-dp
- POJ1523 SPF dfs
- POJ-1001 求高精度幂-大数乘法系列
- POJ-1003 Hangover
- POJ-1004 Financial Management
- 用单调栈解决最大连续矩形面积问题
- 2632 Crashing Robots的解决方法
- 1573 Robot Motion (简单题)
- POJ 1200 Crazy Search(简单哈希)
- 【高手回避】poj3268,一道很水的dijkstra算法题
- POJ 1088 滑雪
- poj2387 Til the Cows Come Home—Dijkstra模板