poj3281最大流（模板）

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int maxn=400+5;
const int inf=9999999;
struct edge{int to,cap,rev;};
vector<edge>g[maxn];
int level[maxn]={},iter[maxn]={};
int x,y,z,t;
void bfs(int s){
    memset(level,-1,sizeof(level));
    queue<int>que;
    level[s]=0;
    que.push(s);
    while(!que.empty()){
        int v=que.front();que.pop();
        for(int i=0;i<g[v].size();i++){
            edge& e=g[v][i];
            if(e.cap>0 && level[e.to]<0){
                level[e.to]=level[v]+1;
                que.push(e.to);
            }
        }
    }
}
int dfs(int v,int f){
    if(v==t) return f;
    for(int& i=iter[v];i<g[v].size();i++){
        edge& e=g[v][i];
        if(e.cap>0 && level[v]<level[e.to]){
            int d=dfs(e.to,min(f,e.cap));
            if(d>0){
                e.cap-=d;
                g[e.to][e.rev].cap+=d;
                return d;
            }
        }
    }
    return 0;
}
int makeflow(int s){
    int flow=0;
    for(;;){
        bfs(s);
        if(level[t]<0) return flow;
        memset(iter,0,sizeof(iter));
        int f;
        while((f=dfs(s,inf))>0) flow+=f;
    }
}
int main()
{
    while(scanf("%d%d%d",&x,&y,&z)==3){
        for(int i=0;i<=2*x+y+z+1;i++) g[i].clear();
        for(int i=1;i<=x;i++){
            int x1,y1;
            scanf("%d%d",&x1,&y1);
            t=2*x+y+z+1;
            while(x1--){
                int u;
                scanf("%d",&u);
                g[u].push_back(edge{i+y,1,g[i+y].size()});
                g[i+y].push_back(edge{u,0,g[u].size()-1});
            }
            while(y1--){
                int u,v;
                scanf("%d",&v);
                v=v+2*x+y;u=x+y+i;
                g[u].push_back(edge{v,1,g[v].size()});
                g[v].push_back(edge{u,0,g[u].size()-1});
            }
        }
        for(int i=1;i<=y;i++){
            g[0].push_back(edge{i,1,g[i].size()});
            g[i].push_back(edge{0,0,g[0].size()-1});
        }
        for(int i=1;i<=z;i++){
            int v=i+2*x+y;
            g[v].push_back(edge{t,1,g[t].size()});
            g[t].push_back(edge{v,0,g[v].size()-1});
        }
        for(int i=1;i<=x;i++){
            int u=i+y,v=i+x+y;
            g[u].push_back(edge{v,1,g[v].size()});
            g[v].push_back(edge{u,0,g[u].size()-1});
        }
        printf("%d\n",makeflow(0));
    }
    return 0;
}