【POJ】3281Dining（网络流最大流，建图）

Description

Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.

Farmer John has cooked fabulous meals for his cows, but he forgot to check his menu against their preferences. Although he might not be able to stuff everybody, he wants to give a complete meal of both food and drink to as many cows as possible.

Farmer John has cooked F (1 ≤ F ≤ 100) types of foods and prepared D (1 ≤ D ≤ 100) types of drinks. Each of his N (1 ≤ N ≤ 100) cows has decided whether she is willing to eat a particular food or drink a particular drink. Farmer John must assign a food type and a drink type to each cow to maximize the number of cows who get both.

Each dish or drink can only be consumed by one cow (i.e., once food type 2 is assigned to a cow, no other cow can be assigned food type 2).

Input

Line 1: Three space-separated integers: N, F, and D 
Lines 2..N+1: Each line i starts with a two integers Fi and Di, the number of dishes that cow i likes and the number of drinks that cow i likes. The next Fi integers denote the dishes that cow i will eat, and the Di integers following that denote the drinks that cow i will drink.

Output

Line 1: A single integer that is the maximum number of cows that can be fed both food and drink that conform to their wishes

题目大意：现在你手上有F个吃的，D个喝的，然后你又N头牛，你想让尽可能多的牛吃好喝好（既能吃到东西，也能喝到东西），然后每头牛都有一些自己喜欢吃的，而且是每头牛只吃自己喜欢吃的，只喝自己喜欢喝的

思路：这个题目的话，还是建图比较新颖吧，一开始我想的是暴力建图，后来发现这样好像是很浪费的也是不对的，

后来想到了，如果某头牛没有吃到自己喜欢吃的，那样的话就没必要给他他想喝的了，因为他从吃不到自己喜欢吃的开始就不能给我们得分了，所以直接修改思路修改代码。。。

图是类似于这样的

代码：

#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<iostream>
#define INF 1e9
#define INFLL 1LL<<60
#define ll long long
using namespace std;
const int maxn=500+10;
struct Edge
{
    int from,to,cap,flow;
    Edge() {}
    Edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow) {}
};
struct Dinic
{
    int n,m,s,t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];

    void init(int n,int s,int t)
    {
        this->n=n,this->s=s,this->t=t;
        for(int i=1; i<=n; i++)
            G[i].clear();
        edges.clear();
    }

    void AddEdge(int from,int to,int cap)
    {
        edges.push_back( Edge(from,to,cap,0) );
        edges.push_back( Edge(to,from,0,0) );
        m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool BFS()
    {
        memset(vis,0,sizeof(vis));
        queue<int> Q;
        Q.push(s);
        d[s]=0;
        vis[s]=true;
        while(!Q.empty())
        {
            int x=Q.front();
            Q.pop();
            for(int i=0; i<G[x].size(); i++)
            {
                Edge& e=edges[G[x][i]];
                if(!vis[e.to] && e.cap>e.flow)
                {
                    vis[e.to]=true;
                    d[e.to] = d[x]+1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }

    int DFS(int x,int a)
    {
        if(x==t || a==0)
            return a;
        int flow=0,f;
        for(int& i=cur[x]; i<G[x].size(); i++)
        {
            Edge& e=edges[G[x][i]];
            if(d[x]+1==d[e.to] && (f=DFS( e.to,min(a,e.cap-e.flow) ) )>0 )
            {
                e.flow +=f;
                edges[G[x][i]^1].flow -=f;
                flow += f;
                a -= f;
                if(a==0)
                    break;
            }
        }
        return flow;
    }

    int Maxflow()
    {
        int flow=0;
        while(BFS())
        {
            memset(cur,0,sizeof(cur));
            flow += DFS(s,INF);
        }
        return flow;
    }
} dinic;
int a[maxn],b[maxn];
int maxm=100;
int main()
{
    int n,F,D;
    scanf("%d%d%d",&n,&F,&D);
    int S=0,T=maxm+maxm+2*maxm;
    dinic.init(maxm+maxm+2*maxm+maxm,S,T);
    for(int i=1; i<=F; i++)
        dinic.AddEdge(S,i,1);
    for(int i=1; i<=D; i++)
        dinic.AddEdge(maxm+2*maxm+i,T,1);
    for(int i=1; i<=n; i++)
    {
        int numd,numf;
        scanf("%d%d",&numf,&numd);
        for(int j=1; j<=numf; j++)
        {
            int x;
            scanf("%d",&x);
            dinic.AddEdge(x,maxm+i,1);
        }
        for(int j=1; j<=numd; j++)
        {
            int x;
            scanf("%d",&x);
            dinic.AddEdge(maxm+maxm+i,maxm+2*maxm+x,1);
        }
    }
    for(int i=1; i<=n; i++)
        dinic.AddEdge(maxm+i,maxm+maxm+i,1);
    printf("%d\n",dinic.Maxflow());
}