【bzoj2561】最小生成树 最小割

L可能在最小生成树上
就是小于L的边不能让u和v联通

那就是最小割了

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<iostream>
#define maxn 20010
#define maxm 400010
#define inf 1000000000

using namespace std;

struct yts
{
	int x,y,z;
}e[maxm];

int head[maxn],to[maxm],c[maxm],next[maxm],q[maxn],d[maxn];
int n,m,num,s,t,u,v,L,ans;

void addedge(int x,int y,int z)
{
	num++;to[num]=y;c[num]=z;next[num]=head[x];head[x]=num;
	num++;to[num]=x;c[num]=z;next[num]=head[y];head[y]=num;
}

bool bfs()
{
	memset(d,-1,sizeof(d));
	int l=0,r=1;
	q[1]=s;d[s]=0;
	while (l<r)
	{
		int x=q[++l];
		for (int p=head[x];p;p=next[p])
		  if (c[p] && d[to[p]]==-1)
		  {
		  	d[to[p]]=d[x]+1;
		  	q[++r]=to[p];
		  }
	}
	if (d[t]==-1) return 0; else return 1;
}

int find(int x,int low)
{
	if (x==t || low==0) return low;
	int totflow=0;
	for (int p=head[x];p;p=next[p])
	  if (c[p] && d[to[p]]==d[x]+1)
	  {
	  	int a=find(to[p],min(c[p],low));
	  	c[p]-=a;c[p^1]+=a;
	  	low-=a;totflow+=a;
	  	if (low==0) return totflow;
	  }
	if (low) d[x]=-1;
	return totflow;
}

void Dinic()
{
	while (bfs()) ans+=find(s,inf);
}

void build(int f)
{
	num=1;
	memset(head,0,sizeof(head));
	s=u;t=v;
	for (int i=1;i<=m;i++)
	  if (!f)
	  {
	  	if (e[i].z>L) addedge(e[i].x,e[i].y,1);
	  }
	  else
	  {
	  	if (e[i].z<L) addedge(e[i].x,e[i].y,1);
	  }
}

int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=m;i++) scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].z);
	scanf("%d%d%d",&u,&v,&L);
	build(0);
	Dinic();
	build(1);
	Dinic();
	printf("%d\n",ans);
	return 0;
}