Dining POJ - 3281 （建图+最大流模板+Dinic）

传送门

题意：n(<=100)头牛，F(<=100)种食物，D(<=100)种饮料。每头牛有想吃的食物和想喝的饮料，但是每头牛最多只能吃一种，喝也最多能喝一种，而且每种吃、喝的只能被一头牛吃、喝。求最多有多少头牛能够既有吃的又有喝的。

题解：难点还是在建图，除此之外Dinic全搞定。

自己想了一会，想了个假图。

以下图来源：POJ3281 Dining——最大流（Dinic+建图⭐）

源点->吃的->牛->牛->喝的->汇点。（我的小脑袋，还是不能够理解。。。后来看看）。

代码:

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define read(x) scanf("%d", &x)
#define print(a, c) printf("%d%c", a, c)
#define pb push_back
#define dbg(x) cout << #x << "===" << x << endl
using namespace std;
const int N = 5e2 + 10;  //估计点F+D+D+n=400
const int M = 3e4 + 10;  //估计边F+F*D+D+D*n+n=2e4+3e2
//实际上，实际做题时可直接无脑大空间
const int INF = 1e9 + 10;

int n, F, D, fd[2], f[N], d[N];
int s, t;  //源点与汇点
int head[N], now[N], cnt;
struct Edge {
    int to, w, next;
    Edge(int to = 0, int w = 0, int next = 0) : to(to), w(w), next(next) {}
} e[M << 1];
void add(int u, int v, int w) {
    e[cnt] = Edge(v, w, head[u]), head[u] = cnt++;
    e[cnt] = Edge(u, 0, head[v]), head[v] = cnt++;
}
int dep[N];
bool bfs() {
    for (int i = s; i <= t; i++) dep[i] = INF;  //还是INF好用
    queue<int> q;
    q.push(s), dep[s] = 0;
    now[s] = head[s];
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        for (int i = now[x]; ~i; i = e[i].next) {
            int v = e[i].to;
            now[v] = head[v];
            if (dep[v] == INF && e[i].w) {
                dep[v] = dep[x] + 1;
                if (v == t) return true;
                q.push(v);
            }
        }
    }
    return false;
}
int dfs(int x, int flow) {
    if (x == t) return flow;
    int ans = 0;
    for (int i = now[x]; ~i && flow; i = e[i].next) {
        int v = e[i].to;
        now[x] = i;
        if (e[i].w && dep[v] == dep[x] + 1) {
            int tmp = dfs(v, min(flow, e[i].w));
            if (tmp == 0) dep[v] = INF;  //剪枝，结束的就不搞了
            e[i].w -= tmp;
            e[i ^ 1].w += tmp;
            ans += tmp;
            flow -= tmp;
        }
    }
    return ans;
}
int Dinic() {
    int res = 0;
    while (bfs()) res += dfs(s, INF);
    return res;
}
void build(int x) {
    //我们不必考虑那个食物，饮料被哪一个牛给喝了。不，要考虑的
    for (int i = 1; i <= fd[0]; i++) {
        for (int j = 1; j <= fd[1]; j++) {
            add(f[i], F + x, 1);
            add(F + n + x, F + n + n + d[j], 1);
        }
    }
}
void init() {
    memset(head, -1, sizeof(head));
    read(n), read(F), read(D);
    s = 0, t = F + n + n + D + 1;
    for (int i = 1; i <= F; i++) add(s, i, 1);
    for (int i = 1; i <= n; i++) add(F + i, F + n + i, 1);
    for (int i = 1; i <= D; i++) add(F + n + n + i, t, 1);
    for (int i = 1; i <= n; i++) {
        read(fd[0]), read(fd[1]);
        for (int j = 1; j <= fd[0]; j++) read(f[j]);
        for (int j = 1; j <= fd[1]; j++) read(d[j]);
        build(i);
    }
}
signed main() {
    init();
    int maxflow = Dinic();
    print(maxflow, '\n');
    return 0;
}
/*
4 3 3
2 2 1 2 3 1
2 2 2 3 1 2
2 2 1 3 1 2
2 1 1 3 3
*/