POJ 2239 化二分图右集合二维为一位的最大匹配

Selecting Courses

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10183		Accepted: 4594

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

题意：就是n节课程匹配课时，课时为p天q节课，这样右集合不好下手，把一个星期化为12*7节课时，用(p-1)+q转化，这样右集合就变成1维的了。直接上匈牙利算法：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 300+5;
int e[maxn][maxn];
int match[maxn];
int book[maxn];
int n;
const int m = 12*7+10;

int dfs(int u)
{
    int i;
    for(i=1;i<=m;i++)
    {
        if(book[i]==0&&e[u][i]==1)
        {
            book[i]=1; //标记点i已访问过
            if(match[i]==0||dfs(match[i]))
            {
                //更新配对关系
                match[i]=u;

                return 1;
            }
        }
    }
         return 0;
    }
int main()
{
   //freopen("in.txt","r",stdin);
   int i,j,t1,t2,sum=0;
   int k,a,b,t;
   while(scanf("%d",&n)!=EOF){
     memset(e,0,sizeof(e));
     memset(book,0,sizeof(book));
     memset(match,0,sizeof(match));
     sum=0;
   for(i=1;i<=n;i++){
    scanf("%d",&k);
    while(k--){
        scanf("%d%d",&a,&b);
        t=(a-1)*12+b;
        e[i][t]=1;

   }
   }

   for(i=1;i<=n;i++){

    memset(book,0,sizeof(book));//清空上次搜索时的标记

    if(dfs(i))
        sum++;     //寻找增广路，如果找到，配对数加1.
   }
   printf("%d\n",sum);
   }
    return 0;
}

还有就是注意freopen的注释啊！！！提交的时候一定要注释！白白浪费时间！