题意比较清晰,K个机器 C个牛 要挤奶,每个机器最多handle M个牛,求走的路径最长的牛的最短距离
先用Floyd 把每个点之间的最短距离计算出来.
用这些距离中的最长距离当做二分的上界
下界是0 mid = (upper+lower)/2
构图方式: 源点到每个机器有一条边,容量为M;如果某台机器到某个牛的距离<=mid ,那么存在一条容量为1的边,否则没有边.每个牛到汇点有一条容量为1的边
注意!!! 不连通的边INF 最好不要设成-1 在Floyd计算的时候条件比较麻烦
if(f[i][j] == INF)
{
if(f[i][k]!=INF &&f[k][j]!=INF && i!=j)
{
f[i][j] = f[i][k]+f[k][j];
}
}
else
{
if(f[i][j]>f[i][k]+f[k][j] && f[i][k]!=INF &&f[k][j]!=INF)
{
f[i][j] = f[i][k] + f[k][j];
}
}
hao蠢!
一定不能设置成INT_MAX 会溢出;
最好设成一个比较大的整数 比如一亿.或者比INT_MAX/2小一点 注意 ::在遍历搜索所有边的最大值时,要判断是一下是不是INF 因为这种情况下INF真的最大
/*
* Dinic algo for max flow
*
* This implementation assumes that #nodes, #edges, and capacity on each edge <= INT_MAX,
* which means INT_MAX is the best approximation of INF on edge capacity.
* The total amount of max flow computed can be up to LLONG_MAX (not defined in this file),
* but each 'dfs' call in 'dinic' can return <= INT_MAX flow value.
*/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <assert.h>
#include <queue>
#include <vector>
#include <algorithm>
#include<iostream>
#define INF 100000000
#define N (5000)
#define M (20000)
typedef long long LL;
using namespace std;
struct edge {
int v, cap, next;
};
edge e[M];
int head[N], level[N], cur[N];
int num_of_edges;
/*
* When there are multiple test sets, you need to re-initialize before each
*/
void dinic_init(void) {
num_of_edges = 0;
memset(head, -1, sizeof(head));
return;
}
int add_edge(int u, int v, int c1, int c2) {
int& i=num_of_edges;
assert(c1>=0 && c2>=0 && c1+c2>=0); // check for possibility of overflow
e[i].v = v;
e[i].cap = c1;
e[i].next = head[u];
head[u] = i++;
e[i].v = u;
e[i].cap = c2;
e[i].next = head[v];
head[v] = i++;
return i;
}
void print_graph(int n) {
for (int u=0; u<n; u++) {
printf("%d: ", u);
for (int i=head[u]; i>=0; i=e[i].next) {
printf("%d(%d)", e[i].v, e[i].cap);
}
printf("\n");
}
return;
}
/*
* Find all augmentation paths in the current level graph
* This is the recursive version
*/
int dfs(int u, int t, int bn) {
if (u == t) return bn;
int left = bn;
for (int i=cur[u]; i>=0; i=e[i].next) {
int v = e[i].v;
int c = e[i].cap;
if (c > 0 && level[u]+1 == level[v]) {
int flow = dfs(v, t, min(left, c));
if (flow > 0) {
e[i].cap -= flow;
e[i^1].cap += flow;
cur[u] = i;
left -= flow;
if (!left) break;
}
}
}
if (left > 0) level[u] = 0;
return bn - left;
}
bool bfs(int s, int t) {
memset(level, 0, sizeof(level));
level[s] = 1;
queue<int> q;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
if (u == t) return true;
for (int i=head[u]; i>=0; i=e[i].next) {
int v = e[i].v;
if (!level[v] && e[i].cap > 0) {
level[v] = level[u]+1;
q.push(v);
}
}
}
return false;
}
LL dinic(int s, int t) {
LL max_flow = 0;
while (bfs(s, t)) {
memcpy(cur, head, sizeof(head));
max_flow += dfs(s, t, INT_MAX);
}
return max_flow;
}
int upstream(int s, int n) {
int cnt = 0;
vector<bool> visited(n);
queue<int> q;
visited[s] = true;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i=head[u]; i>=0; i=e[i].next) {
int v = e[i].v;
if (e[i].cap > 0 && !visited[v]) {
visited[v] = true;
q.push(v);
cnt++;
}
}
}
return cnt; // excluding s
}
int knum,cnum,mnum;
int KCsum;
int f[1000][1000];
void create_graph(int limit)
{
for(int i=1;i<=knum;i++)
{
add_edge(0,i,mnum,0);
}
for(int j=knum+1;j<=KCsum;j++)
{
add_edge(j,KCsum+1,1,0);
}
for(int i=1;i<=knum;i++)
{
for(int j=knum+1;j<=KCsum;j++)
{
if(f[i][j]<= limit)
add_edge(i,j,1,0);
}
}
}
int main()
{
while(cin>>knum>>cnum>>mnum)
{
KCsum = knum+cnum;
for(int i=1;i<=KCsum;i++)
{
for(int j=1;j<=KCsum;j++)
{
cin>>f[i][j];
if(f[i][j] == 0)
{
f[i][j] = INF;
}
}
}
for(int k=1;k<=KCsum;k++)
{
for(int i=1;i<=KCsum;i++)
{
for(int j=1;j<=KCsum;j++)
{
if(f[i][j]>f[i][k]+f[k][j])
{
f[i][j] = f[i][k] + f[k][j];
}
}
}
}
int maxdis = -1;
for(int i=1;i<=KCsum;i++)
{
for(int j=1;j<=KCsum;j++)
{
if(f[i][j]>maxdis && f[i][j]!=INF)
{
maxdis = f[i][j];
}
}
}
int l,r,mid;
l = 0;
r = maxdis;
int ans;
while(l<=r)
{
mid = (l+r)/2;
dinic_init();
create_graph(mid);
int flow = dinic(0,KCsum+1);
if(flow >= cnum)
{
ans = mid;
r = mid-1;
}
else
{
l = mid+1;
}
}
cout<<ans<<endl;
}
}