Dining poj3281

3281 -- Dining

题目大意：有n头牛，f种食物，d种饮品，每头牛都有自己喜欢的几种食物和饮品，但每头牛只能选一种食物和一种饮品，每种食物和每种饮品一只能给一头牛，问能满足几头牛对于食物和饮品的需求

1<=n<=100;1<=f<=100;1<=d<=100

思路：多约束最大值问题，用最大流解决，因为每头牛只能选一种食物、一种饮品，所以要把一头牛拆成两个点，两个点之间连一条容量为1的边，然后建立汇点，连接所有食物，容量为1，每种食物连接愿意吃它的牛，容量为1，每头牛连接它爱喝的饮品，容量为1，每种饮品连接源点，容量为1，然后因为边的数量是1e5级别，所以用ISAP求解

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int N = 405,INF=0x7fffffff;
struct Edge
{
	int v, flow, next;
}e[200005];
int cnt = 0, tot = 0;
int head[N];
void addedge(int u, int v, int w)
{
	e[cnt].v = v;
	e[cnt].flow = w;
	e[cnt].next = head[u];
	head[u] = cnt;
	cnt++;
}
int h[N], cn[N], pre[N];
void bfs(int t)
{//求每个点从汇点出发的bfs深度
	queue<int>q;
	memset(h, -1, sizeof h);
	memset(cn, 0, sizeof cn);
	h[t] = 0;
	q.push(t);
	while (!q.empty())
	{
		int u = q.front();
		q.pop();
		++cn[h[u]];//记录每个深度对应点的数量
		for (int i = head[u]; ~i; i = e[i].next)
		{
			int v = e[i].v;
			if (h[v]==-1)
			{
				h[v] = h[u] + 1;
				q.push(v);
			}
		}
	}
}
int isap(int s, int t,int n)
{
	bfs(t);
	int ret = 0, d, u = s;
	while (h[s] < n)
	{//源点深度=n说明没有增广路了
		int i = head[u];
		if (u == s)
		{
			d = INF;
		}
		for (; ~i; i = e[i].next)
		{
			int v = e[i].v;
			if (e[i].flow && h[u] == h[v] + 1)
			{
				u = v;
				pre[v] = i;
				d = min(d, e[i].flow);
				if (u == t)
				{
					while (u != s)
					{//找到增广路，回溯增流
						int j = pre[u];
						e[j].flow -= d;
						e[j^1].flow += d;
						u = e[j ^ 1].v;
					}
					ret += d;
					d = INF;
				}
				break;
			}
		}
		if (i == -1)
		{//重新标记高度
			if (--cn[h[u]] == 0)
			{
				break;
			}
			int hmin = n - 1;
			for (int j = head[u]; ~j; j = e[j].next)
			{
				if (e[j].flow)
				{
					hmin = min(hmin, h[e[j].v]);
				}
			}
			h[u] = hmin + 1;
			++cn[h[u]];
			if (u != s)//不是源点要回溯
				u = e[pre[u] ^ 1].v;
		}
	}
	return ret;
}
int main()
{
	int n, f, d;
	cin >> n >> f >> d;
	memset(head, -1, sizeof head);
	for (int i = 1; i <= n; i++)
	{
		int fi, di;
		scanf("%d%d", &fi, &di);
		for (int j = 1; j <= fi; j++)
		{
			int v;
			scanf("%d", &v);
			addedge(v, i + f, 1);
			addedge(i + f, v, 0);//食物和牛之间建边
		}
		addedge(i + f, i + f + n, 1);
		addedge(i + f + n, i + f, 0);//一头牛的两个点之间建边
		for (int j = 1; j <= di; j++)
		{
			int u;
			scanf("%d", &u);
			addedge(i + f + n, u + f + n * 2, 1);
			addedge(u + f + n * 2, i + f + n, 0);//牛和饮品建边
		}
	}
	for (int i = 1; i <= f; i++)
	{
		int v = i;
		addedge(0, v, 1);
		addedge(v, 0, 0);//食物和源点建边
	}
	for (int i = 1; i <= d; i++)
	{
		int u = i;
		addedge(u + f + n * 2, n * 2 + f + d + 1, 1);
		addedge(n * 2 + f + d + 1, u + f + n * 2, 0);//饮品和汇点建边
	}	
	printf("%d", isap(0, 2 * n + f + d + 1, 2 * n + f + d + 2));
	return 0;
}