poj 3281 Dining isap + 拆点

题意：n每头牛，F份不同的食物， D种不同的水，每头牛都有自己的喜欢，问能最大情况下能被满足的牛数量。

果果的网络流，关键是建图，这里将每头牛拆成两个点（算是技巧，学习下），然后设超源超汇，如下建图

                                      st

边权1：                 | | | | | | | | | | | 

食物 i ：1~F：     1，2,.........  F

边权inf：               | | | | | | | | | | | | |

牛 i：1+F ~ F+n    1，2............n

边权1：                 | | | | | | | | | | |

牛‘ i：1+F+n ~ 1+F+2n 1，2.....n

边权inf：               | | | | | | | | | | | | |

水 i：1+2n+F ~ D+F+2n  1，2.....D

边权1：                 | | | | | | | | | | |

                                     ed

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int N = 1010, M = 101;
const int st = 0, ed = N-10;

struct node{
    int v, w, nxt;
}e[N*N];

int head[N];
int cnt;
int n, F, D;
int f[N], d[N];

int dep[N];
int gap[N];
int cur[N];
int pre[N];
int s[N], top;
queue <int> q;

void add( int u, int v, int w )
{
    e[cnt].w = w;
    e[cnt].v = v;
    e[cnt].nxt = head[u];
    head[u] = cnt++;

    e[cnt].w = 0;
    e[cnt].v = u;
    e[cnt].nxt = head[v];
    head[v] = cnt++;
}

void init()
{
    cnt = 0;
    memset( head, -1, sizeof( head ) );
}

void rev_bfs()
{
    while( !q.empty() ) q.pop();
    memset( gap, 0, sizeof( gap ) );
    memset( dep, -1, sizeof( dep ) );
    q.push( ed );
    dep[ed] = 0;
    gap[0] = 1;
    while( !q.empty() ) {
        int u = q.front();
        q.pop();
        for( int i = head[u]; ~i; i = e[i].nxt ) {
            int v = e[i].v;
            if( ~dep[v] )
                continue;
            q.push(v);
            dep[v] = dep[u] + 1;
            gap[dep[v]]++;
        }
    }
}

int isap()
{
    int flow = 0, u = st, i;
    memcpy( cur, head, sizeof head );
    rev_bfs();
    top = 0;
    int nv = ed + 1;
    while( dep[st] < nv ) {
        if( u == ed ) {
            int tmp, minn = inf;
            for( i = 0; i < top; ++i ) {
                if( minn > e[s[i]].w ) {
                    minn = e[s[i]].w;
                    tmp = i;
                }
            }
            for( i = 0; i < top; ++i ) {
                e[s[i]].w -= minn;
                e[s[i]^1].w += minn;
            }
            flow += minn;
            top = tmp;
            u = e[s[top]^1].v;
        }
        for( i = cur[u]; ~i; i = e[i].nxt ) {
            if( e[i].w > 0 && dep[u] == dep[e[i].v] + 1 ) {
                cur[u] = i;
                break;
            }
        }
        if( ~i ) {
            s[top++] = cur[u];
            u = e[i].v;
        }
        else {
            if( 0 == gap[dep[u]] )
                break;
            int minn = nv;
            for( i = head[u]; ~i; i = e[i].nxt ) {
                int v = e[i].v;
                if( e[i].w > 0 && minn > dep[v] ) {
                    minn = dep[v];
                    cur[u] = i;
                }
            }
            dep[u] = minn + 1;
            gap[dep[u]]++;
            if( u != st ) {
                u = e[ s[--top]^1 ].v;
            }
        }
    }
    return flow;
}

int main()
{
    while( ~scanf("%d%d%d", &n, &F, &D) ) {
        init();
        for( int i = 1; i <= D; ++i )
            add( F+2*n+i, ed, 1 );
        for( int i = 1; i <= F; ++i )
            add( st, i, 1 );
        for( int i = 1; i <= n; ++i )
            add( F+i, F+i+n, 1 );
        for( int i = 1; i <= n; ++i ) {
            scanf("%d%d", &f[i], &d[i]);
            int tmp;
            for( int j = 1; j <= f[i]; ++j ) {
                scanf("%d", &tmp);
                add( tmp, F+i, inf );
            }
            for( int j = 1; j <= d[i]; ++j ) {
                scanf("%d", &tmp);
                add( F+n+i, 2*n+F+tmp, inf );
            }
        }
        int ans = isap();
        printf("%d\n", ans);
    }
    return 0;
}