【POJ】3281 Dining

传送门：http://poj.org/problem?id=3281

经典网络流
用容量表示每种东西只能取一次的限制
即可得一个 源-食-牛-饮-汇 的建图方法
中间三项都需要限流

#include<stdio.h>
#include<algorithm>
#include<cstring>
#define cint const int &
#define inf 2333
#define N 405
using namespace std;

int tot=1,s[N],cur[N],tm[N],ts,lev[N],Q[N],ED,n,f,d,ans;

struct edge{int v,c,n;}e[N*N];
inline void push(cint u,cint v,cint c)
{
    e[++tot]=(edge){v,c,s[u]};s[u]=tot;
    e[++tot]=(edge){u,0,s[v]};s[v]=tot;
}

inline bool bfs()
{
    memcpy(cur,s,sizeof(cur));
    tm[Q[1]=1]=++ts;
    for (int l=1,r=1;l<=r;l++) for (int i=s[Q[l]];i;i=e[i].n) if (e[i].c && tm[e[i].v]<ts)
        tm[Q[++r]=e[i].v]=ts,lev[Q[r]]=lev[Q[l]]+1;
    return tm[ED]==ts;
}

int dfs(cint u,int c)
{
    if (u==ED) return c;
    int g=0,tmp;
    for (int i=cur[u];i && c;cur[u]=i,i=e[i].n) if (tm[e[i].v]==ts && lev[e[i].v]==lev[u]+1 && e[i].c && (tmp=dfs(e[i].v,min(c,e[i].c))))
        g+=tmp,c-=tmp,e[i].c-=tmp,e[i^1].c+=tmp;
    return g;
}

int main()
{
    scanf("%d%d%d",&n,&f,&d);ED=f+2*n+d+2;
    for (int i=1;i<=f;i++) push(1,i+1,1);
    for (int i=1;i<=d;i++) push(f+2*n+1+i,ED,1);
    for (int i=1;i<=n;i++) push(f+2*i,f+2*i+1,1);
    for (int i=1,lf,ld,w;i<=n;i++)
    {
        scanf("%d%d",&lf,&ld);
        while (lf--) scanf("%d",&w),push(w+1,f+i*2,inf);
        while (ld--) scanf("%d",&w),push(f+i*2+1,f+2*n+1+w,inf);
    }
    while (bfs()) for (int rt=dfs(1,inf);rt;rt=dfs(1,inf)) ans+=rt;
    printf("%d",ans);
}