题目大意:
给定一个图和最大扩容量k(边),问:在扩容边流量和不超过下,从1到n能最大流多少流量
这题可以在原图基础上对每条边多增一条流量为k,费用为1的边,然后跑费用流就行。(当然也可以先跑一次网络流,再跑费用流)
这题是我第一次打zkw,感觉还挺好用,多路增广比较少被卡,感觉以后多用一下比较好。
贴代码
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define MAXN 100
#define MX 100000000
#define N 100
using namespace std;
int n,m,ans,ntt;
int a[N*N*4][4],g[N],dis[N]d[N];
bool bz[N];
void ins(int x,int y,int z,int z1){
static int sum=1;
a[++sum][0]=y,a[sum][1]=z,a[sum][2]=z1,a[sum][3]=g[x],g[x]=sum;
}
void init(){
static int x;
scanf("%d %d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++){
scanf("%d ",&x);
if (x)ins(i,j,x,0),ins(j,i,0,0),ins(i,j,m,1),ins(j,i,0,-1);
}
}
int dfs(int x,int flow){
int use=0;
static int l;
if (x==n){
if (!ntt)ans+=flow;
else{
ans+=(l=min(flow,m/ntt));
m-=l*ntt;
}
return flow;
}
bz[x]=1;
for (int i=g[x];i;i=a[i][3])
if (a[i][1]&&!a[i][2]&&!bz[a[i][0]]){
l=dfs(a[i][0],min(flow-use,a[i][1]));
a[i][1]-=l,a[i^1][1]+=l;
use+=l;
if (flow==use)return flow;
}
return use;
}
void ZKW(){
static int l,r,ma,u,v,yy,t;
while (1){
memset(dis,60,sizeof(dis)),memset(bz,0,sizeof(bz));
ma=dis[n],dis[n]=0,l=0,r=1,d[1]=n,bz[n]=1;
t=0;
while (l!=r){
u=d[l=l%n+1];
t++;
for (int i=g[u];i;i=a[i][3])
if (a[i^1][1]&&dis[u]+a[i^1][2]<dis[v=a[i][0]]){
dis[v]=dis[u]+a[i^1][2];
if (!bz[v])
bz[d[r=r%n+1]=v]=1;
}
bz[d[l]]=0;
if (t==100)break;
}
if (ma==dis[1])return;
for (int i=1;i<=n;i++)
for (int j=g[i];j;j=a[j][3])
a[j][2]+=dis[a[j][0]]-dis[i];
memset(bz,0,sizeof(bz));
ntt+=dis[1];
yy=ans;
dfs(1,1<<30);
if (yy==ans)return;
}
}
void work(){
static int x,y,z;
ZKW();;
}
void write(){
printf("%d",ans);
}
int main(){
freopen("362E.in","r",stdin);
freopen("362E.out","w",stdout);
init();
work();
write();
return 0;
}