poj 3281 Dining （最大流解决匹配问题）

题目大意：有F种食物,D种饮料，N头奶牛,只能吃某种食物和饮料(而且只能吃特定的一份)一种食物被一头牛吃了之后,其余牛就不能吃了
要求输出最多分配能够满足的牛的数量

题解：解题思路：建图,有2*n+f+d+2个顶点，0表示源点,2*n+f+d+1表示汇点，由源点指向食物,再由食物指向牛,牛再指向对应的饮料,饮料再指向汇点
当然要使每一头牛都对应每一份食物与饮料,所以应该牛i指向牛i再指向饮料,这样就可以避免一头牛只占用多份食物与饮料了。全部是有向的边,而且权值全部为1，我在这里是1到f为食物点，f+1到f+2*n为牛点，f+2*n+1到f+2*n+d为饮料点。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <queue>
#include <map>
#include <stack>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-3
#define maxn 200010
#define MOD 1000000007

int flow[420][420];
int vis[420],pre[420];
int N,F,D,n;

int max_flow()
{
    int ans = 0;
    while(1)
    {
        memset(vis,0,sizeof(vis));
        memset(pre,0,sizeof(pre));
        queue<int> Q;
        vis[0] = 1;
        Q.push(0);
        while(!Q.empty())
        {
            int cnt = Q.front();
            Q.pop();
            if(cnt == n)
                break;
            for(int i = 0; i <= n; i++)
                if(!vis[i] && flow[cnt][i] > 0)
            {
                vis[i] = 1;
                pre[i] = cnt;
                Q.push(i);
            }
        }
        if(!vis[n])
            break;
        int Max = INF;
        for(int i = n; i != 0; i = pre[i])
            Max = min(Max,flow[pre[i]][i]);
        for(int i = n; i != 0; i = pre[i])
        {
            flow[pre[i]][i] -= Max;
            flow[i][pre[i]] += Max;
        }
        ans += Max;
    }
    return ans;
}
int main()
{
    int t,C = 1;
    //scanf("%d",&t);
    while(scanf("%d%d%d",&N,&F,&D) != EOF)
    {
        n = F + 2 * N + D + 1;
        memset(flow,0,sizeof(flow));
        for(int i = 1; i <= F; i++)
            flow[0][i] = 1;
        for(int i = F+2*N+1; i <= F+2*N+D; i++)
            flow[i][n] = 1;
        for(int i = F+1; i <= F+N; i++)
            flow[i][i+N] = 1;
        for(int i = 1; i <= N; i++)
        {
            int f,d,x;
            scanf("%d%d",&f,&d);
            for(int j = 0; j < f; j++)
            {
                scanf("%d",&x);
                flow[x][i+F] = 1;
            }
            for(int j = 0; j < d; j++)
            {
                scanf("%d",&x);
                flow[i+F+N][x+F+2*N] = 1;
            }
        }
        printf("%d\n",max_flow());
    }
}