POJ 3281 Dining 最大流

题意：农夫有N头牛，F种食物，D种饮料，每头牛有特定的食物和饮料需求，且每种食物与饮料只能分配给一头牛，求可以满足的牛的最大数目
思路：每头牛拆成两个点，边的容量为1，在前面连上食物，后面连上饮料，容量也为1，保证每头牛只能分配到一种食物和一种饮料，在源点与每种食物之间加上容量为1的边，每种饮料与汇点之间加上容量为1的边，若能从源点到达汇点，则表示满足了某头牛的食物与饮料需求，求出到达汇点的最大流即可得出满足的牛最大数目

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn = 1005;
const int inf = 0x3f3f3f3f;
int N, F, D, vis[maxn], level[maxn], iter[maxn];
struct edge {
	int to, cap, rev;
	edge(int to = 0, int cap = 0, int rev = 0) : to(to), cap(cap), rev(rev) {}
};
vector<edge> g[maxn];
void addedge(int from, int to, int cap) 
{
	g[from].push_back(edge(to, cap, g[to].size()));
	g[to].push_back(edge(from, 0, g[from].size()-1));
}
void bfs(int s)
{
	memset(level, -1, sizeof(level));
	queue<int> q;
	level[s] = 0;
	q.push(s);
	while (!q.empty()) {
		int t = q.front(); q.pop();
		for (int i = 0; i < g[t].size(); i++) {
			edge &e = g[t][i];
			if (e.cap > 0 && level[e.to] < 0) {
				level[e.to] = level[t] + 1;
				q.push(e.to);
			}
		}
	}
}
int dfs(int v, int t, int f)
{
	if (v == t) return f;
	vis[v] = 1;
	for (int &i = iter[v]; i < g[v].size(); i++) {
		edge &e = g[v][i];
		if (level[v] < level[e.to] && e.cap > 0) {
			int d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				g[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
int solve(int s, int t)
{
	int flow = 0;
	for (;;) {
		bfs(s);
		if (level[t] < 0) return flow;
		memset(iter, 0, sizeof(iter));
		int f;
		while ((f = dfs(s, t, inf)) > 0)
			flow += f;
	}
}
int main()
{
	while (cin >> N >> F >> D) {
		for (int i = 0; i < maxn; i++)
			g[i].clear();
		for (int i = 1; i <= N; i++) {
			int nf, nd;
			cin >> nf >> nd;
			for (int j = 0; j < nf; j++) {
				int f;
				cin >> f;
				addedge(f, F+2*i-1, 1);
			}
			for (int j = 0; j < nd; j++) {
				int d;
				cin >> d;
				addedge(F+2*i, F+2*N+d, 1);
			}
			addedge(F+2*i-1, F+2*i, 1);
		}
		int end = F+D+2*N+1;
		for (int i = 1; i <= F; i++)
			addedge(0, i, 1);
		for (int i = F+2*N+1; i <= F+2*N+D; i++)
			addedge(i, end, 1);
		cout << solve(0, end) << endl;
	}
	return 0;
}