题意
传送门 POJ 2112
题解
求最大距离的最小值,二分答案即可。对于牛和取奶点的最小距离, Floyd-Warshall 求解。二分的判断,用 Dinic 求最大流;对小于等于当前二分值的路径对牛和取奶点连容量为 1 1 1 的边,源点对牛连容量为 1 1 1 的边,取奶点对汇点连容量为 M M M 的边;最大流为 C C C 即可收缩上界。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#define min(a,b) (((a) < (b)) ? (a) : (b))
#define max(a,b) (((a) > (b)) ? (a) : (b))
#define abs(x) ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-10
#define PI 3.14159265358979323846
using namespace std;
#define MAX_V 235
struct edge{
int to, cap, rev;
edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev){}
};
vector<edge> G[MAX_V];
int level[MAX_V], iter[MAX_V];
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> que;
level[s] = 0;
que.push(s);
while(!que.empty()){
int v = que.front(); que.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;
que.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 max_flow(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;
}
}
}
#define MAX_D 200
#define MAX_K 30
#define MAX_C 200
int K, C, M, N, V;
int dist[MAX_K + MAX_C][MAX_K + MAX_C];
void floyd_warshall(){
for(int k = 0; k < N; k++){
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
}
// 建图
int judge(int x){
int s = K + C, t = s + 1;
V = t + 1;
for(int v = 0; v < V; v++) G[v].clear();
for(int i = K; i < N;i++) add_edge(s, i, 1);
for(int i = 0; i < K; i++) add_edge(i, t, M);
for(int i = 0; i < K; i++){
for(int j = K; j < N; j++){
if(dist[i][j] <= x) add_edge(j, i, 1);
}
}
// 判断是否满足全部分配
return max_flow(s, t) == C;
}
void solve(){
floyd_warshall();
int lb = 0, ub = MAX_V * MAX_D;
while(ub - lb > 1){
int mid = (lb + ub) >> 1;
if(judge(mid)) ub = mid;
else lb = mid;
}
printf("%d\n", ub);
}
int main(){
while(~scanf("%d%d%d", &K, &C, &M)){
N = K + C;
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j ++){
scanf("%d", &dist[i][j]);
if(dist[i][j] == 0) dist[i][j] = (i != j ? INF : 0);
}
}
solve();
}
return 0;
}