POJ 3281 Dining ( 最大流 && 建图 )

#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 500 + 10;
const int  INF = 100000000;
int Food, Drink, Cows;
int F[maxn][maxn], D[maxn][maxn], idx1[maxn], idx2[maxn];

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;     //边表 edges[e]和edges[e^1]互为反向弧
    vector<int> G[maxn];    //邻接表,G[i][j]表示结点i的第j条边在e数组中的序号
    bool vis[maxn];         //BFS使用,标记一个节点是否被遍历过
    int d[maxn];            //d[i]表从起点s到i点的距离(层次)
    int cur[maxn];          //cur[i]表当前正访问i节点的第cur[i]条弧

    void init(int n,int s,int t)
    {
        this->n=n,this->s=s,this->t=t;
        for(int i=0;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];
    }

    //a表示从s到x目前为止所有弧的最小残量
    //flow表示从x到t的最小残量
    int DFS(int x,int a)
    {
        //printf("%d %d\n", x, a);
        if(x==t || a==0)return a;
        int flow=0,f;//flow用来记录从x到t的最小残量
        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;
    }
}DC;

int main(void)
{
    while(~scanf("%d %d %d", &Cows, &Food, &Drink)){
        memset(idx1, 0, sizeof(idx1));
        memset(idx2, 0, sizeof(idx2));
        memset(F, 0, sizeof(F));
        memset(D, 0, sizeof(D));

        int N = Food + Drink + Cows*2 + 1;

        for(int i=1; i<=Cows; i++){
            scanf("%d %d", &idx1[i], &idx2[i]);
            for(int j=1; j<=idx1[i]; j++) scanf("%d", &F[i][j]);
            for(int j=1; j<=idx2[i]; j++) scanf("%d", &D[i][j]);
        }

        DC.init(N+1, 0, N);
        for(int i=1; i<=Food; i++)
            DC.AddEdge(0, i, 1);///源点连食物
        for(int i=1; i<=Drink; i++)
            DC.AddEdge(Food+Cows*2+i, N, 1);///（牛2）连饮料
        for(int i=1; i<=Cows; i++)
            DC.AddEdge(Food+i, Food+Cows+i, 1);///（牛1）连（牛2）

        for(int i=1; i<=Cows; i++){
            for(int j=1; j<=idx1[i]; j++)
                DC.AddEdge(F[i][j], Food+i, 1);///食物连（牛1）
            for(int j=1; j<=idx2[i]; j++)
                DC.AddEdge(Food+Cows+i ,Food+Cows*2+D[i][j], 1);///（牛2）连饮料
        }

        printf("%d\n", DC.Maxflow());
    }
    return 0;
}