POJ3281-Dining

题目求牛与食物和牛与饮料的匹配，按照食物，牛，饮料并自定源点s和汇点t建图，用最大流求解。
图中牛的节点为2 * n个，这样能使每头牛最多一份食物一份饮料。

#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>

using namespace std;

const int maxn = 100 + 5;
const int maxf = 100 + 5;
const int maxd = 100 + 5;

const int maxv = 2 * maxn + maxf + maxd;
const int INF = 2;

bool likeF[maxn][maxf];
bool likeD[maxn][maxd];

struct edge {
    int to, cap, rev;
};

vector<edge> G[maxv];
int level[maxv];
int iter[maxv];

void add_edge(int from, int to, int cap) {
    G[from].push_back((edge){to, cap, G[to].size()});
    G[to].push_back((edge){from, 0, G[from].size() - 1});
}

void Bfs(int s) {
    memset(level, -1, sizeof(level));
    queue<int> q;
    level[s] = 0;
    q.push(s);
    while (!q.empty()) {
        int v = q.front();
        q.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;
                q.push(e.to);
            }
        }
    }
}

int Dfs(int v, int t, 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, t, min(e.cap, f));
            if (d > 0) {
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
        }
    }
    return 0;
}

int Dinic(int s, int t) {
    int flow = 0;
    for ( ; ; ) {
        Bfs(s);
        if (level[t] < 0) {
            return flow;
        }
        memset(iter, 0, sizeof(iter));
        int f;
        while ((f = Dfs(s, t, INF)) > 0) {
            flow += f;
        }
    }
}

int main() {
    int n, f, d;
    scanf("%d%d%d", &n, &f, &d);

    for (int i = 0; i < n; i++) {
        int a, b;
        scanf("%d%d", &a, &b);
        for (int j = 0; j < a; j++) {
            int tmp;
            scanf("%d", &tmp);
            likeF[i][--tmp] = true;
        }
        for (int j = 0; j < b; j++) {
            int tmp;
            scanf("%d", &tmp);
            likeD[i][--tmp] = true;
        }
    }

    int s = n * 2 + f + d, t = s + 1;
    for (int i = 0; i < f; i++) {
        add_edge(s, n * 2 + i, 1);
    }
    for (int i = 0; i < d; i++) {
        add_edge(n * 2 + f + i, t, 1);
    }
    for (int i = 0; i < n; i++) {
        add_edge(i, n + i, 1);
        for (int j = 0; j < f; j++) {
            if (likeF[i][j]) {
                add_edge(n * 2 + j, i, 1);
            }
        }
        for (int j = 0; j < d; j++) {
            if (likeD[i][j]) {
                add_edge(n + i, n * 2 + f + j, 1);
            }
        }
    }
    printf("%d\n", Dinic(s, t));

    return 0;
}