POJ 3281 Dining （网络流，最大流）

求最大流。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
const int N = 10000;
const int INF = 0x3f3f3f3f;
#define mem(x,v) memset(x,v,sizeof(x))
struct node{
    int v,next,w;
}f[N];
int cnt,head[N],cur[N],dep[N],s,t,n,m,k;
void Add_edge(int x, int y, int z){
    cnt++;
    f[cnt].v = y;
    f[cnt].w = z;
    f[cnt].next = head[x];
    head[x] = cnt;
}
void init(){
    scanf("%d%d%d",&n,&m,&k);
    int F,D,z;
    cnt = -1;
    mem(head,-1);
    s = 0; t = 2*n+m+k+1;
    for (int ii = 1; ii <= n; ii++) {
        scanf("%d%d", &F, &D);
        for (int i = 0; i < F; i++) {
            scanf("%d", &z);
            Add_edge(2 * n + z, ii, 1);
            Add_edge(ii, 2 * n + z, 0);
        }
        for (int i = 0; i < D; i++) {
            scanf("%d", &z);
            Add_edge(n + ii, 2 * n + m + z, 1);
            Add_edge(2 * n + m + z, n + ii, 0);
        }
    }
    for (int i = 1; i <= m; i++){
        Add_edge(s,2*n+i,1);
        Add_edge(2*n+i,s,0);
    }
    for (int i = 1; i <= k; i++){
        Add_edge(2*n+m+i,t,1);
        Add_edge(t,2*n+m+i,0);
    }
    for (int i = 1; i <= n; i++){
        Add_edge(i,i+n,1);
        Add_edge(i+n,i,0);
    }
    return;
}
bool bfs(){
    queue<int>q;
    while(!q.empty()) q.pop();
    mem(dep,0);
    dep[s] = 1;
    q.push(s);
    while(!q.empty()){
        int u = q.front(); q.pop();
        for (int i = head[u]; i != -1; i = f[i].next){
            int v = f[i].v;
            if (dep[v] == 0 && f[i].w > 0){
                dep[v] = dep[u] + 1;
                if (v == t) return 1;
                q.push(v);
            }
        }
    }
    if (dep[t] > 0) return 1;
    return 0;
}
int dfs(int u,int flow){
    if (u == t || flow == 0) return flow;
    for (int& i = cur[u]; i != -1; i = f[i].next){
        int v = f[i].v,w = f[i].w;
        if ((dep[v] == dep[u] + 1) && (w > 0)){
            int di = dfs(v,min(flow,w));
            if (di > 0){
                f[i].w -= di;
                f[i^1].w += di;
                return di;
            }
        }
    }
    return 0;
}
int Dinic(){
    int Ans = 0,d;
    while(bfs()){
        for (int i = 0; i <= t; i++)
            cur[i] = head[i];
        while(d = dfs(s,INF)){
            Ans += d;
        }
    }
    return Ans;
}
int main() {
    init();
    printf("%d\n",Dinic());
    return 0;
}