题意:
有K个机器..有C头牛.每头牛必须去一个机器吃饭..但是一个机器最多让M个牛使用..现在给出每两点的直接距离...满足每头牛能正常进食..并且要走最远的牛走得最短..PS..每头牛不一定要直接走..可以绕其他的点去进食...
题解
那么先floyd求出每两点的最短距离..然后二分枚举走得最远距离..用最大流判可行性...
Program:
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#define MAXN 2005
#define MAXM 20000005
#define oo 1000000007
#define ll long long
using namespace std;
struct Dinic
{
struct node
{
int x,y,c,next;
}line[MAXM];
int Lnum,_next[MAXN],dis[MAXN],dp[MAXN];
bool inqueue[MAXN];
void initial(int n)
{
for (int i=0;i<=n;i++) _next[i]=-1;
Lnum=-1;
}
void addline(int x,int y,int c)
{
line[++Lnum].next=_next[x],_next[x]=Lnum;
line[Lnum].x=x,line[Lnum].y=y,line[Lnum].c=c;
line[++Lnum].next=_next[y],_next[y]=Lnum;
line[Lnum].x=y,line[Lnum].y=x,line[Lnum].c=0;
}
bool BFS(int s,int e)
{
queue<int> Q;
while (!Q.empty()) Q.pop();
memset(dis,0,sizeof(dis));
dis[s]=1,Q.push(s);
while (!Q.empty())
{
int h,k;
h=Q.front(),Q.pop();
if (h==e) return dis[e];
for (k=_next[h];k!=-1;k=line[k].next)
if (line[k].c && !dis[line[k].y])
dis[line[k].y]=dis[h]+1,Q.push(line[k].y);
}
return false;
}
int dfs(int x,int flow,int e)
{
if (x==e) return flow;
int temp,cost=0;
for (int k=_next[x];k!=-1;k=line[k].next)
if (line[k].c && dis[line[k].y]==dis[x]+1)
{
temp=dfs(line[k].y,min(flow-cost,line[k].c),e);
if (temp)
{
line[k].c-=temp,line[k^1].c+=temp;
cost+=temp;
if (flow==cost) return cost;
}else dis[line[k].y]=-1;
}
return cost;
}
int MaxFlow(int s,int e)
{
int MaxFlow=0;
while (BFS(s,e)) MaxFlow+=dfs(s,oo,e);
return MaxFlow;
}
}T;
int A[505][505];
bool judge(int R,int M,int K,int C)
{
int i,j,s,e;
s=K+C+5,e=s+1,T.initial(e);
for (i=1;i<=C;i++) T.addline(s,i+K,1);
for (i=1;i<=K;i++) T.addline(i,e,M);
for (i=1;i<=C;i++)
for (j=1;j<=K;j++)
if (A[i+K][j] && A[i+K][j]<=R)
T.addline(i+K,j,1);
return T.MaxFlow(s,e)==C;
}
void Floyd(int n)
{
int k,i,j;
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (A[i][k] && A[k][j] && (!A[i][j] || A[i][j]>A[i][k]+A[k][j]))
A[i][j]=A[i][k]+A[k][j];
}
int main()
{
int K,C,M,k,i,j;
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
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]);
Floyd(K+C);
int l=0,r=oo,mid;
while (r-l>1)
{
mid=l+r>>1;
if (judge(mid,M,K,C)) r=mid;
else l=mid;
}
printf("%d\n",r);
return 0;
}