Problem Description
有C头奶牛,K个挤奶站,每个挤奶器最多服务M头奶牛,奶牛和奶牛、奶牛和挤奶站、挤奶站和挤奶站之间都存在一定的距离。现在问满足所有的奶牛都能够被挤奶器服务到的情况下,行走距离的最远的奶牛的至少要走多远。
思路:
求满足情况行走距离最远的那牛,所走的最短距离的问题
网络流 + 二分。题目给了奶牛和奶牛,奶牛和挤奶站,挤奶站和挤奶站之间的距离,我们得求两两之间的最短距离,用Floyd
建图:0代表超级源点,c+k+1超级汇点,1-k代表挤奶站,(k+1) - (k+c)代表奶牛。我们二分至少要走多远,奶牛到挤奶站的最短距离小于至少要走的距离,我们才建边。如果最大流==c 就缩小距离
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
#define K 40
#define C 250
#define inf 0x3f3f3f3f
struct node
{
int to, cap, next;
};
node Map[2*K*C];
int a[K+C][K+C];
int k, c, m, cnt;
int head[K+C], vis[K+C], cur[K+C];
bool bfs(int s, int e)
{
memset(vis, -1, sizeof(vis));
queue<int> q;
q.push(s);
vis[s] = 0;
while(!q.empty())
{
s = q.front(), q.pop();
for(int i = head[s]; ~i; i = Map[i].next)
{
int to = Map[i].to, cap = Map[i].cap;
if(cap && vis[to] == -1)
{
vis[to] = vis[s] + 1;
q.push(to);
}
}
}
if(vis[e] == -1) return 0;
else return 1;
}
int dfs(int s, int e, int f)
{
if(s == e) return f;
int ans = 0;
for(int &i = cur[s]; ~i; i = Map[i].next)
{
int to = Map[i].to, &cap = Map[i].cap;
if(vis[to] > vis[s] && cap)
{
int d = dfs(to, e, min(f, cap));
if(d)
{
cap -= d;
Map[i^1].cap += d;
f -= d;
ans += d;
if(!f) break;
}
}
}
if(ans) return ans;
vis[s] = -1;
return 0;
}
int dinic(int s, int e)
{
int ans = 0;
while(bfs(s, e))
{
memcpy(cur, head, sizeof(head));
ans += dfs(s, e, inf);
}
return ans;
}
void add(int u, int v, int cap)
{
Map[cnt].to = v;
Map[cnt].cap = cap;
Map[cnt].next = head[u];
head[u] = cnt++;
Map[cnt].to = u;
Map[cnt].cap = 0;
Map[cnt].next = head[v];
head[v] = cnt++;
}
void build(int mid)
{
int i, j;
memset(head, -1, sizeof(head));
cnt = 0;
for(i = 1; i <= c; i++)
add(0, i+k, 1);
for(i = 1; i <= k; i++)
add(i, k+c+1, m);
for(i = k+1; i <= k+c; i++)
{
for(j = 1; j <= k; j++)
{
if(a[i][j] > mid) continue;
add(i, j, inf);
}
}
}
int main()
{
int i, j, kk;
while(~scanf("%d %d %d", &k, &c, &m))
{
for(i = 1; i <= k+c; i++)
{
for(j = 1; j <= k+c; j++)
{
scanf("%d", &a[i][j]);
if(!a[i][j]) a[i][j] = inf;
}
}
for(kk = 1; kk <= k+c; kk++)//求两两之间的最短路
{
for(i = 1; i <= k+c; i++)
{
for(j = 1; j <= k+c; j++)
{
a[i][j] = min(a[i][j], a[i][kk] + a[kk][j]);
}
}
}
int l = 0, r = inf;
while(l <= r)
{
int mid = (l + r) / 2;//二分至少要走的距离
build(mid);//建边
if(dinic(0, c+k+1) == c) r = mid - 1;//满足,缩小范围
else l = mid + 1;
}
printf("%d\n", r + 1);
}
return 0;
}