预流推进 HLPP模板

P4722 【模板】最大流 加强版 / 预流推进

网络流，最大流算法的最好标算法，时间复杂度上界一般为$O(n^2\sqrt{m})$

本模板除了相应的算法，还加入了上界优化，在随机数据下会更优

#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
//#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-18
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
//#define ls(p) e[p].l
//#define rs(p) e[p].r
//#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int >
#define mk make_pair
#define fi first
#define se second
#define x0 xx
#define y0 yy
using namespace std;
const int mod=998244353;
const int M=1e8+5;
const int N=5e6+1;//?????????? 4e8.
int n,m,s,t;
namespace HLPP
{
	struct node
	{
		int ver,edge,next;
	}e[N];
	int tot=1,head[N];
	int gap[N],ee[N],h[N],inq[N];
	struct cmp
	{
		bool operator()(int a,int b)  const
		{
			return h[a]<h[b];
		}
	};
	priority_queue < int , vector < int > , cmp > pq;
	void add(int x,int y,int z)
	{
		e[++tot].ver=y;
		e[tot].edge=z;
		e[tot].next=head[x];
		head[x]=tot;
	}
	void addedge(int x,int y,int z)
	{
		add(x,y,z);add(y,x,0);
	}
	bool bfs()
	{
		queue < int > q;
		for(re i=0;i<=n;i++)  h[i]=1e9;
		h[t]=0,q.push(t);
		while(q.size())
		{
			int x=q.front();q.pop();
			for(re i=head[x];i;i=e[i].next)
			{
				int y=e[i].ver;
				if(e[i^1].edge&&h[y]>h[x]+1)  h[y]=h[x]+1,q.push(y);
			}
		}
		return h[s]!=1e9;
	}
	void push(int x)
	{
		int d;
		for(re i=head[x];i;i=e[i].next)
		{
			int y=e[i].ver;
			int z=e[i].edge;
			if(z&&h[y]+1==h[x])
			{
				d=min(ee[x],z);
				e[i].edge-=d;e[i^1].edge+=d;
				ee[x]-=d;ee[y]+=d;
				if(y!=s&&y!=t&&!inq[y])  pq.push(y),inq[y]=1;
				if(!ee[x])  break;
			}
		}
	}
	void relabel(int x)
	{
		h[x]=1e9;
		for(re i=head[x];i;i=e[i].next)
		{
			int y=e[i].ver;
			int z=e[i].edge;
			if(z&&h[y]+1<h[x])  h[x]=h[y]+1;
		}
	}
	int hlpp()
	{
		if(!bfs())  return 0;
		h[s]=n;
		for(re i=0;i<=n*2;i++)  gap[i]=0;
		for(re i=1;i<=n;i++)  if(h[i]<1e9)  ++gap[h[i]];
		for(re i=head[s];i;i=e[i].next)
		{
			int y=e[i].ver;
			int z=e[i].edge;
			int d=z;
			e[i].edge-=d;
			e[i^1].edge+=d;
			ee[s]-=d,ee[y]+=d;
			if(y!=s&&y!=t&&!inq[y])   pq.push(y),inq[y]=1;
		}
		while(pq.size())
		{
			int x=pq.top();pq.pop();push(x);inq[x]=0;
			if(ee[x])
			{
				if(!--gap[h[x]])  for(re i=1;i<=n;i++)  if(i!=s&&i!=t&&h[i]>h[x]&&h[i]<n+1)  h[i]=n+1;
				relabel(x);++gap[h[x]];
				pq.push(x);inq[x]=1;
			}
		}
		return ee[t];
	}
}
void solve()
{
	cin>>n>>m>>s>>t;
	for(re i=1;i<=m;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		HLPP::addedge(x,y,z);
	}
	cout<<HLPP::hlpp()<<endl;
}
signed main()
{
//	freopen("P1505_1.txt", "r", stdin);
//	freopen("Aout.txt", "w", stdout);
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
//        printf("Case #%lld: ",index);
        solve();
//        puts("");
    }
    return 0;
}
/*

10 5
hbtngdflmj
1 10 1
2 9 0
3 8 1
4 7 0
5 6 1


*/