二分答案+最大流
先求出牛各个点之间的最短路径,二分答案限制边,判断最大流是否等于奶牛头数
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
int g[500][500];
int maxcost,maxcnt;
const int INF=10000000;
const int N=100005;
struct Node
{
int v,cap,flow,next;
};
Node edges[N];
int n,m,s,t,k,head[N],e;
int num[N],h[N],curedge[N],pre[N];
int Dis[500][500];
void add(int u,int v,int cap)
{
edges[e].v=v;
edges[e].cap=cap;
edges[e].flow=0;
edges[e].next=head[u];
head[u]=e++;
}
void Add(int u,int v,int cap)
{
add(u,v,cap);//正向边初始化为cap
add(v,u,0);//反向边初始化为0
}
int Maxflow(int s,int t,int n)
{
int ans=0,i,k,x,d,u;
memset(num,0,sizeof(num));
memset(h,0,sizeof(h));
for(i=0;i<=n;i++) curedge[i]=head[i];
num[n]=n;u=s;
while(h[u]<n)//每一个节点到汇点的距离小于等于n-1
{
if(u==t)
{
d=INF+1;
//获得最短路径上的最小流和流出最小流的节点
for(i=s;i!=t;i=edges[curedge[i]].v) if(d>edges[curedge[i]].cap)
k=i,d=edges[curedge[i]].cap;
//更新图
for(i=s;i!=t;i=edges[curedge[i]].v)
{
x=curedge[i];
edges[x].cap-=d;
edges[x].flow+=d;
edges[x^1].cap+=d;
edges[x^1].flow-=d;
}
ans+=d;u=k;
}
//找到一条允许的边,即最短路径上的边,并将该节点的当前边记录下来。
for(i=curedge[u];i!=-1;i=edges[i].next) if(edges[i].cap>0&&h[u]==h[edges[i].v]+1)
break;
if(i!=-1)
{
curedge[u]=i;
pre[edges[i].v]=u;
u=edges[i].v;
}
else //更新u节点到汇点的最短路
{
//某一种路径出现断流
if(--num[h[u]]==0) break;
//更新u节点的当前边和最短路
curedge[u]=head[u];
for(x=n,i=head[u];i!=-1;i=edges[i].next) if(edges[i].cap>0&&h[edges[i].v]<x)
x=h[edges[i].v];
h[u]=x+1;num[h[u]]++;
if(u!=s) u=pre[u];
}
}
return ans;
}
void Floyd()
{
for(int p = 1;p<=k+n;p++)
for(int i = 1;i<=k+n;i++)
for(int j = 1;j<=k+n;j++)
{
if(g[i][p]<INF&&g[p][j]&&g[i][p]+g[p][j]<g[i][j])
{
g[i][j] = g[i][p]+g[p][j];
}
}
}
bool makegraph(int len)
{
memset(head,-1,sizeof(head));
e = 0;
s = 0;
t = k+n+1;
for(int i = 1;i<=k;i++)
for(int j = k+1;j<=k+n;j++)
{
if(g[i][j]<=len)
{
Add(i,j,1);
}
}
for(int i = 1;i<=k;i++)
Add(0,i,m);
for(int i = k+1;i<=k+n;i++)
Add(i,t,1);
if(Maxflow(s,t,k+n+2)==n)
return true;
return false;
}
int solve()
{
int st=0,en=20000,mid,ans=0;
while(st<=en)
{
mid = (st+en)/2;
if(makegraph(mid))
{
en = mid-1;
ans = mid;
}
else
{
st = mid+1;
}
}
return ans;
}
int main()
{
while(scanf("%d %d %d",&k,&n,&m)!=EOF)
{
maxcost = 0;
maxcnt = 0;
memset(g,0,sizeof(g));
for(int i = 1;i<=k+n;i++)
{
for(int j = 1;j<=k+n;j++)
{
scanf("%d",&g[i][j]);
if(!g[i][j]&&i!=j)
g[i][j] = INF;
}
}
Floyd();
int ans = solve();
printf("%d\n",ans);
}
return 0;
}