POJ2112-Optimal Milking

二分最大流答案，注意上界是INF而不是200.

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

using namespace std;

const int maxk = 30 + 5;
const int maxc = 200 + 5;

const int maxv = maxk + maxc;
const int INF = 200 * maxv;

int d[maxv][maxv];

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

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

int k, c, m;
int s, t;

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(f, e.cap));
            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;
        }
    }
}

void build(int x) {
    for (int i = 0; i < t + 1; i++) {
        G[i].clear();
    }
    for (int i = 0; i < k; i++) {
        add_edge(i, t, m);
    }
    for (int i = k; i < k + c; i++) {
        add_edge(s, i, 1);
    }
    for (int i = k; i < k + c; i++) {
        for (int j = 0; j < k; j++) {
            if (d[i][j] <= x) {
                add_edge(i, j, 1);
            }
        }
    }
}

int main() {
    scanf("%d%d%d", &k, &c, &m);
    s = k + c, t = s + 1;
    for (int i = 0; i < k + c; i++) {
        for (int j = 0; j < k + c; j++) {
            scanf("%d", &d[i][j]);
            if (i != j && d[i][j] == 0) {
                d[i][j] = INF;
            }
        }
    }

    for (int v = 0; v < k + c; v++) {
        for (int i = 0; i < k + c; i++) {
            for (int j = 0; j < k + c; j++) {
                d[i][j] = min(d[i][j], d[i][v] + d[v][j]);
            }
        }
    }

    int lb = 0, ub = INF;
    while (lb < ub) {
        int mid = (lb + ub) / 2;
        build(mid);
        if (Dinic(s, t) == c) {
            ub = mid;
        } else {
            lb = mid + 1;
        }
    }
    printf("%d\n", ub);

    return 0;
}