PO3281 Dining（最大流）

如果只有食物或者饮料那就是个二分图最大匹配。

三个真想不出来。。然后看题解。。从源点到食物到牛到饮料到汇点，这样建图。

所以思维不能太局限了，不懂得把食物和饮料放到牛两边，以为牛吃食物饮料、食物饮料被牛吃是符合逻辑的=。=

#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
#define INF (1<<30)
#define MAXN 444 
#define MAXM 444*444*2 

struct Edge{
    int v,cap,flow,next;
}edge[MAXM];
int vs,vt,NE,NV;
int head[MAXN];

void addEdge(int u,int v,int cap){
    edge[NE].v=v; edge[NE].cap=cap; edge[NE].flow=0;
    edge[NE].next=head[u]; head[u]=NE++;
    edge[NE].v=u; edge[NE].cap=0; edge[NE].flow=0;
    edge[NE].next=head[v]; head[v]=NE++;
}

int level[MAXN];
int gap[MAXN];
void bfs(){
    memset(level,-1,sizeof(level));
    memset(gap,0,sizeof(gap));
    level[vt]=0;
    gap[level[vt]]++;
    queue<int> que;
    que.push(vt);
    while(!que.empty()){
        int u=que.front(); que.pop();
        for(int i=head[u]; i!=-1; i=edge[i].next){
            int v=edge[i].v;
            if(level[v]!=-1) continue;
            level[v]=level[u]+1;
            gap[level[v]]++;
            que.push(v);
        }
    }
}

int pre[MAXN];
int cur[MAXN];
int ISAP(){
    bfs();
    memset(pre,-1,sizeof(pre));
    memcpy(cur,head,sizeof(head));
    int u=pre[vs]=vs,flow=0,aug=INF;
    gap[0]=NV;
    while(level[vs]<NV){
        bool flag=false;
        for(int &i=cur[u]; i!=-1; i=edge[i].next){
            int v=edge[i].v;
            if(edge[i].cap!=edge[i].flow && level[u]==level[v]+1){
                flag=true;
                pre[v]=u;
                u=v;
                //aug=(aug==-1?edge[i].cap:min(aug,edge[i].cap));
                aug=min(aug,edge[i].cap-edge[i].flow);
                if(v==vt){
                    flow+=aug;
                    for(u=pre[v]; v!=vs; v=u,u=pre[u]){
                        edge[cur[u]].flow+=aug;
                        edge[cur[u]^1].flow-=aug;
                    }
                    //aug=-1;
                    aug=INF;
                }
                break;
            }
        }
        if(flag) continue;
        int minlevel=NV;
        for(int i=head[u]; i!=-1; i=edge[i].next){
            int v=edge[i].v;
            if(edge[i].cap!=edge[i].flow && level[v]<minlevel){
                minlevel=level[v];
                cur[u]=i;
            }
        }
        if(--gap[level[u]]==0) break;
        level[u]=minlevel+1;
        gap[level[u]]++;
        u=pre[u];
    }
    return flow;
}
int main(){
    int n,f,d,a,b,c;
    scanf("%d%d%d",&n,&f,&d);

    vs=0; vt=n+n+f+d+1; NV=vt+1; NE=0;
    memset(head,-1,sizeof(head));
    for(int i=1; i<=f; ++i) addEdge(vs,i,1);
    for(int i=1; i<=d; ++i) addEdge(i+f+n+n,vt,1);
    for(int i=1; i<=n; ++i){
        addEdge(i+f,i+f+n,1);
        scanf("%d%d",&a,&b);
        while(a--){
            scanf("%d",&c);
            addEdge(c,i+f,1);
        }
        while(b--){
            scanf("%d",&c);
            addEdge(i+f+n,c+f+n+n,1);
        }
    }
    printf("%d",ISAP());
    return 0;
}