一道二分最大流的裸题
问你john要从1号去n号点T次(到了n号点直接瞬间移动回1号点,就是直接把他放回1号点,且之前走的边不能再走了),问在这T次中走的最长的一条边最小是多少(注意:不是从1号到n号的总距离的最大值 而是某条边的最大值)
二分距离 如果某条边的流量<=mid 则加入这条边 最后求最大流 如果最大流>=T 则距离还有减小的余地 否则增大
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<stack>
#include<queue>
#include<cmath>
#include<stack>
#include<list>
#include<set>
typedef long long ll;
using namespace std;
const int MAXN=20010;//jiedian de zui da zhi
const int MAXM=800010;//bian de zui da zhi
const int INF=0x3f3f3f3f;
struct Node
{
int from,to,next;
int cap;
}edge[MAXM];
int tol;
int head[MAXN];
int dep[MAXN];
int gap[MAXN];
int bian[40005][3];
int N,P,T;
void init() //remember write it in main function
{
tol=0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int w)
{
edge[tol].from=u;
edge[tol].to=v;
edge[tol].cap=w;
edge[tol].next=head[u];
head[u]=tol++;
edge[tol].from=v;
edge[tol].to=u;
edge[tol].cap=w;
edge[tol].next=head[v];
head[v]=tol++;
}
void BFS(int start,int end)
{
memset(dep,-1,sizeof(dep));
memset(gap,0,sizeof(gap));
gap[0]=1;
int que[MAXN];
int front,rear;
front=rear=0;
dep[end]=0;
que[rear++]=end;
while(front!=rear)
{
int u=que[front++];
if(front==MAXN)front=0;
for(int i=head[u];i!=-1;i=edge[i].next)
{
int v=edge[i].to;
if(dep[v]!=-1)continue;
que[rear++]=v;
if(rear==MAXN)rear=0;
dep[v]=dep[u]+1;
++gap[dep[v]];
}
}
}
int SAP(int start,int end,int n) //n shi jiedian de zui da ge shu ,including source and sink
{
int res=0;
BFS(start,end);
int cur[MAXN];
int S[MAXN];
int top=0;
memcpy(cur,head,sizeof(head));
int u=start;
int i;
while(dep[start]<n)
{
if(u==end)
{
int temp=INF;
int inser;
for(i=0;i<top;i++)
if(temp>edge[S[i]].cap)
{
temp=edge[S[i]].cap;
inser=i;
}
for(i=0;i<top;i++)
{
edge[S[i]].cap-=temp;
edge[S[i]^1].cap+=temp;
}
res+=temp;
top=inser;
u=edge[S[top]].from;
}
if(u!=end&&gap[dep[u]-1]==0)//≥ˆœ÷∂œ≤„£¨Œfi‘ˆπ„¬∑
break;
for(i=cur[u];i!=-1;i=edge[i].next)
if(edge[i].cap!=0&&dep[u]==dep[edge[i].to]+1)
break;
if(i!=-1)
{
cur[u]=i;
S[top++]=i;
u=edge[i].to;
}
else
{
int min=n;
for(i=head[u];i!=-1;i=edge[i].next)
{
if(edge[i].cap==0)continue;
if(min>dep[edge[i].to])
{
min=dep[edge[i].to];
cur[u]=i;
}
}
--gap[dep[u]];
dep[u]=min+1;
++gap[dep[u]];
if(u!=start)u=edge[S[--top]].from;
}
}
return res;
}
void getmap(int mid)
{
init();
int i,j;
for(i=0;i<P;i++)
{
if(bian[i][2]<=mid)
{
addedge(bian[i][0], bian[i][1], 1);
}
}
}
int main()
{
int i,j,k,m,n;
while(scanf("%d%d%d",&N,&P,&T)==3)
{
for(i=0;i<P;i++)
{
scanf("%d%d%d",&bian[i][0],&bian[i][1],&bian[i][2]);
}
int l=0,r=1000001;
int mid;
while(l<=r)
{
mid=(l+r)/2;
getmap(mid);
if(SAP(1,N,N)>=T)
{
r=mid-1;
}
else
{
l=mid+1;
}
}
printf("%d\n",l);
}
return 0;
}