先求一次最大流,再从源点和汇点进行DFS,得到2个点集,遍历所有正向边,(判边的时候一定i+=2,否则会wa),若该边的容量为0,起点在点集1,终点在点集2,则该边为可扩建的。
从汇点DFS需注意判断edges[i^1].cap>0,即正向满流的情况下,不在继续向后DFS
注意该组测试数据
/*
4 6
0 1 4
0 2 2
1 2 2
1 3 1
2 3 7
2 0 1
3
*/
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int INF=1000000000;
const int N=100005;
struct Node
{
int u,v,cap,flow,next;
};
Node edges[N];
int n,m,s,t,head[N],e;
int num[N],h[N],curedge[N],pre[N];
bool vis1[1000];
bool vis2[1000];
int cnt1 = 1;
int cnt2 = 1;
void add(int u,int v,int cap)
{
edges[e].u=u;
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 DFS(int source)
{
vis1[source] = true;
for(int i = head[source];i!=-1;i=edges[i].next)
{
int to = edges[i].v;
if(!vis1[to]&&edges[i].cap>0)
{
DFS(to);
}
}
}
void DFS2(int source)
{
vis2[source] = true;
for(int i = head[source];i!=-1;i=edges[i].next)
{
int to = edges[i].v;
if(!vis2[to]&&edges[i].cap>0&&edges[i^1].cap>0)
{
DFS2(to);
}
}
}
int main()
{
int u,v,w;
scanf("%d %d",&n,&m);
e = 0;
memset(head,-1,sizeof(head));
for(int i = 0;i<m;i++)
{
scanf("%d %d %d",&u,&v,&w);
Add(u,v,w);
}
Maxflow(0,n-1,n);
DFS(0);
DFS2(n-1);
int ans = 0;
for(int i = 0;i<e;i++)
{
if(edges[i].cap==0&&vis1[edges[i].u]&&vis2[edges[i].v])
ans++;
}
printf("%d\n",ans);
return 0;
}