poj Selecting Courses 2239 （二分图最大匹配）

Selecting Courses

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9853		Accepted: 4434

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

//题意：在高校一个星期内有7天的课程，每天有12门课程。

一个学霸有n门想学的课程，但这些课程可能会有冲突，现在给出每门课一星期的课程数，和上课的具体时间，问这个学霸最多能上多少门课？

先输入一个n，表示有n门想上的课，接下来n行，每行先输入一个k，表示在一个星期没第i门课有几节，然后再输入k对数（p,q）,表示这节课在周p，第q节有课。

//思路：

二分图最大匹配，也是个模板，就是加一个转换可以让这个题更简单点。

转换：将（p,q）转换成一个数，j=(p-1)*12+q,也就是将每节课固定到一个具体时间，转换后就简单了。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>
#define INF 0x3f3f3f3f
#define IN __int64
#define ull unsigned long long
#define ll long long
#define N 310
#define M 1000000007
using namespace std;
int map[N][N];
int x[N],y[N];
int vis[N];
int n;
int dfs(int xx)
{
	for(int i=1;i<=84;i++)
	{
		if(!vis[i]&&map[xx][i])
		{
			vis[i]=1;
			if(!y[i]||dfs(y[i]))
			{
				y[i]=xx;
				x[xx]=i;
				return 1;
			}
		}
	}
	return 0;
}
int main()
{
	int i,j;
	while(scanf("%d",&n)!=EOF)
	{
		memset(map,0,sizeof(map));
		memset(x,0,sizeof(x));
		memset(y,0,sizeof(y));
		for(i=1;i<=n;i++)
		{
			int k;
			scanf("%d",&k);
			while(k--)
			{
				int p,q;
				scanf("%d%d",&p,&q);
				map[i][(p-1)*12+q]=1;
			}
		}
		int sum=0;
		for(i=1;i<=n;i++)
		{
			memset(vis,0,sizeof(vis));
			if(dfs(i))
				sum++;
		}
		printf("%d\n",sum);
	}
	return 0;
}