pku1274.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#define SIZE 300
int st[SIZE][SIZE];
int chk[SIZE];
int match[SIZE];
int C, B;

int DFS(int p)
{
	int i, t;
	for (i = 0; i < B; i++)
	{
		if (st[i][p] && !chk[i])
		{
			chk[i] = 1;
			t = match[i];
			match[i] = p;
			if (t == -1 || DFS(t))
			{
				return 1;
			}
			match[i] = t;
		}
	}
	return 0;
}

void Solve()
{
	int i, ans, k, b;
	memset(match, -1, sizeof(match));
	memset(st, 0, sizeof(st));
	for (i = 0; i < C; i++)
	{
		scanf("%d", &k);
		while (k--)
		{
			scanf("%d", &b);
			st[i][b - 1] = 1;
		}
	}
	for (i = 0, ans = 0; i < B; i++)
	{
		memset(chk, 0, sizeof(chk));
		ans += DFS(i);
	}
	printf("%d\n", ans);
}

int main()
{
	while (scanf("%d %d", &C, &B) != -1)
	{
		Solve();
	}
	return 0;
}