poj3281

最大流

View Code

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;

#define maxn 105
#define N maxn * 4
#define E N * N * 2
#define inf 0x3f3f3f3f

struct edge
{
    int x, y, nxt;
    int c;
} bf[E];

int ne, head[N], cur[N], ps[N], dep[N];
int n, f, d;

void addedge(int x, int y, int c)
{
    bf[ne].x = x;
    bf[ne].y = y;
    bf[ne].c = c;
    bf[ne].nxt = head[x];
    head[x] = ne++;
    bf[ne].x = y;
    bf[ne].y = x;
    bf[ne].c = 0;
    bf[ne].nxt = head[y];
    head[y] = ne++;
}

int flow(int n, int s, int t)
{
    int tr, res = 0;
    int i, j, k, f, r, top;
    while (1)
    {
        memset(dep, -1, n * sizeof(int));
        for (f = dep[ps[0] = s] = 0, r = 1; f != r;)
            for (i = ps[f++], j = head[i]; j; j = bf[j].nxt)
            {
                if (bf[j].c && -1 == dep[k = bf[j].y])
                {
                    dep[k] = dep[i] + 1;
                    ps[r++] = k;
                    if (k == t)
                    {
                        f = r;
                        break;
                    }
                }
            }
        if (-1 == dep[t])
            break;

        memcpy(cur, head, n * sizeof(int));
        for (i = s, top = 0;;)
        {
            if (i == t)
            {
                for (k = 0, tr = inf; k < top; ++k)
                    if (bf[ps[k]].c < tr)
                        tr = bf[ps[f = k]].c;
                for (k = 0; k < top; ++k)
                    bf[ps[k]].c -= tr, bf[ps[k] ^ 1].c += tr;
                res += tr;
                i = bf[ps[top = f]].x;
            }
            for (j = cur[i]; cur[i]; j = cur[i] = bf[cur[i]].nxt)
                if (bf[j].c && dep[i] + 1 == dep[bf[j].y])
                    break;
            if (cur[i])
            {
                ps[top++] = cur[i];
                i = bf[cur[i]].y;
            }
            else
            {
                if (0 == top)
                    break;
                dep[i] = -1;
                i = bf[ps[--top]].x;
            }
        }
    }
    return res;
}

int food(int a)
{
    return a + 1;
}

int drink(int a)
{
    return a + 1 + n * 2 + f;
}

int cowf(int a)
{
    return a + 2 + f;
}

int cowd(int a)
{
    return a + 2 + f + n;
}

int main()
{
    //freopen("t.txt", "r", stdin);
    scanf("%d%d%d", &n, &f, &d);
    int s = 0;
    int t = 1;
    ne = 2;
    memset(head, 0, sizeof(head));
    for (int i = 0; i < n; i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        for (int j = 0; j < a; j++)
        {
            int x;
            scanf("%d", &x);
            addedge(food(x), cowf(i), 1);
        }
        for (int j = 0; j < b; j++)
        {
            int x;
            scanf("%d", &x);
            addedge(cowd(i), drink(x), 1);
        }
        addedge(cowf(i), cowd(i), 1);
    }
    for (int i = 1; i <= f; i++)
        addedge(s, food(i), 1);
    for (int i = 1; i <= d; i++)
        addedge(drink(i), t, 1);
    printf("%d\n", flow(n * 2 + f + d + 2, s, t));
    return 0;
}