二分+最大流
二分答案寻找最短最长边,边长大于该值的删去,小于该值得重新建图,求最大流是否>=T
我用了2个邻接表,一个保存开始的边,一个用于建图,计算最大流,二分的时候需要将第一个邻接表按边长排序,二分表长,如果直接二分边长,会tle的
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF=1000000000;
const int N=500005;
struct Node
{
int u,v,cap,flow,next,len;
};
Node edges[N],edges2[N];
int n,m,k,s,t,head[500],head2[500],e,e2;
int num[500],h[500],curedge[500],pre[500];
bool cmp(Node a,Node b)
{
return a.len < b.len;
}
void add1(int u,int v,int cap,int len)
{
edges2[e2].u=u;
edges2[e2].v=v;
edges2[e2].cap=cap;
edges2[e2].flow=0;
edges2[e2].len = len;
edges2[e2].next=head2[u];
head2[u]=e2++;
}
void add2(int u,int v,int cap,int len)
{
edges[e].u=u;
edges[e].v=v;
edges[e].cap=cap;
edges[e].flow=0;
edges[e].len = len;
edges[e].next=head[u];
head[u]=e++;
}
void Add1(int u,int v,int cap,int len)
{
add1(u,v,cap,len);//正向边初始化为cap
}
void Add2(int u,int v,int cap,int len)
{
add2(u,v,cap,len);//正向边初始化为cap
add2(v,u,0,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;
}
bool makegraph(int p)
{
memset(head,-1,sizeof(head));
e=0;
for(int i = 0;i<=p;i++)
{
Add2(edges2[i].u,edges2[i].v,1,edges2[i].len);
Add2(edges2[i].v,edges2[i].u,1,edges2[i].len);
}
if(Maxflow(1,n,n)>=k)
return true;
return false;
}
int solve()
{
int st = 0,en = e2,mid,ans = 0;
while(st<=en)
{
mid = (st+en)>>1;
if(makegraph(mid))
{
ans = mid;
en = mid - 1;
}
else
{
st = mid + 1;
}
}
return ans;
}
int main()
{
int u,v,w;
while(scanf("%d %d %d",&n,&m,&k)!=EOF)
{
memset(head2,-1,sizeof(head));
e2 = 0;
for(int i = 0;i<m;i++)
{
scanf("%d %d %d",&u,&v,&w);
Add1(u,v,1,w);
}
sort(edges2,edges2+e2,cmp);
int ans = solve();
printf("%d\n",edges2[ans].len);
}
return 0;
}