【模板】最大流HLPP

存两份板子,一份复杂度带log,用优先队列,另一份不带,但是空间消耗大一些。

#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const

namespace IO{
	inline char get_char(){
		static cs int Rlen=1<<20|1;
		static char buf[Rlen],*p1,*p2;
		return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++; 
	}
	
	inline int getint(){
		re char c;
		while(!isdigit(c=gc()));re int num=c^48;
		while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
		return num;
	}
}
using namespace IO;

using std::cerr;
using std::cout;

inline bool ckmin(int &a,int b){return a<b?false:(a=b,true);}

cs int N=1203;
cs int INF=0x3f3f3f3f;
int n,m;

struct edge{
	int to,cap,rev;
	edge(cs int &_to,cs int &_cap,cs int &_rev):to(_to),cap(_cap),rev(_rev){}
};

std::vector<edge> G[N];
typedef std::vector<edge>::iterator iter;
inline void addedge(int u,int v,int val){
	G[u].push_back(edge(v,val,G[v].size()));
	G[v].push_back(edge(u,0,G[u].size()-1));
}

int rest[N],h[N],gap[N];
struct cmp{
bool operator()(cs int &a,cs int &b){return h[a]<h[b];}
};
bool inq[N];
int S,T;
inline void BFS(){
	memset(h+1,0x3f,sizeof(int)*n);
	std::queue<int> q;
	q.push(T);inq[T]=true;
	h[T]=0;
	while(!q.empty()){
		int u=q.front();q.pop();
		inq[u]=false;
		for(iter re e=G[u].begin();e!=G[u].end();++e){
			if(G[e->to][e->rev].cap&&ckmin(h[e->to],h[u]+1)&&!inq[e->to])
			inq[e->to]=true,q.push(e->to);
		}
	}
}

std::priority_queue<int,std::vector<int>,cmp> q;

inline void push_flow(int u){
	for(iter e=G[u].begin();e!=G[u].end();++e){
		int v=e->to;
		if(e->cap&&h[v]+1==h[u]){
			int delta=std::min(e->cap,rest[u]);
			e->cap-=delta;
			G[v][e->rev].cap+=delta;
			rest[u]-=delta;
			rest[v]+=delta;
			if(!inq[v]&&v!=S&&v!=T)
			inq[v]=true,q.push(v);
			if(!rest[u])break;
		}
	}
}

inline void relabel(int u){
	h[u]=INF;
	for(iter re e=G[u].begin();e!=G[u].end();++e)
	if(e->cap&&ckmin(h[u],h[e->to]+1));
}

inline int HLPP(){
	BFS();
	if(h[S]==INF)return 0;
	h[S]=n;
	memset(gap,0,sizeof(int)*(n+1));
	for(int re i=1;i<=n;++i)if(h[i]<INF)++gap[h[i]];
	for(iter re e=G[S].begin();e!=G[S].end();++e){
		int v=e->to;
		if(int delta=e->cap){
			e->cap-=delta;
			G[v][e->rev].cap+=delta;
			rest[S]-=delta;
			rest[v]+=delta;
			if(!inq[v]&&v!=S&&v!=T)inq[v]=true,q.push(v);
		}
	}
	while(!q.empty()){
		int u=q.top();q.pop();
		inq[u]=0;
		push_flow(u);
		if(rest[u]){
			--gap[h[u]];
			if(!gap[h[u]])for(int re v=1;v<=n;++v)
			if(v!=S&&v!=T&&h[v]>h[u]&&h[v]<n+1)h[v]=n+1;
			relabel(u);
			++gap[h[u]];
			q.push(u);
			inq[u]=true;
		}
	}
	return rest[T];
}

signed main(){
	n=getint(),m=getint();
	S=getint(),T=getint();
	for(int re i=1;i<=m;++i){
		int u=getint(),v=getint(),val=getint();
		addedge(u,v,val);
	}
	std::cout<<HLPP()<<"\n";
	return 0;
}
#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const

namespace IO{
	inline char get_char(){
		static cs int Rlen=1<<20|1;
		static char buf[Rlen],*p1,*p2;
		return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
	}
	
	inline int getint(){
		re char c;
		while(!isdigit(c=gc()));re int num=c^48;
		while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
		return num;
	}
}
using namespace IO;

using std::cerr;
using std::cout;

cs int N=1203;
cs int INF=0x3f3f3f3f;
int n,m;
struct edge{
	int to,cap,rev;
	edge(cs int &_to,cs int &_cap,cs int &_rev):to(_to),cap(_cap),rev(_rev){}
};

std::vector<edge> G[N];
inline void addedge(int u,int v,int val){
	G[u].push_back(edge(v,val,G[v].size()));
	G[v].push_back(edge(u,0,G[u].size()-1));
} 

std::vector<int> lst[N],gap[N];
int rest[N];
int ht,h[N],cnt[N],work;
int S,T;

inline void upd_h(int v,int nh){
	++work;
	if(h[v]!=INF)--cnt[h[v]];
	h[v]=nh;
	if(nh==INF)return ;
	++cnt[nh],ht=nh;
	gap[nh].push_back(v);
	if(rest[v])lst[nh].push_back(v);
}

inline void relabel(){
	work=0;
	memset(h,0x3f,sizeof h);
	memset(cnt,0,sizeof cnt);
	for(int re i=0;i<=ht;++i)lst[i].clear(),gap[i].clear();
	h[T]=0;
	std::queue<int> q;q.push(T);
	while(!q.empty()){
		int u=q.front();q.pop();
		for(edge &e:G[u])if(h[e.to]==INF&&G[e.to][e.rev].cap)
		q.push(e.to),upd_h(e.to,h[u]+1);
		ht=h[u];
	} 
}

inline void push(int u,edge &e){
	if(rest[e.to]==0)lst[h[e.to]].push_back(e.to);
	int delta=std::min(rest[u],e.cap);
	e.cap-=delta;
	G[e.to][e.rev].cap+=delta;
	rest[u]-=delta;
	rest[e.to]+=delta;
}

inline void push_flow(int u){
	int nh=INF;
	for(edge &e:G[u])if(e.cap){
		if(h[u]==h[e.to]+1){
			push(u,e);
			if(rest[u]<=0)return ;
		}
		else nh=std::min(nh,h[e.to]+1);
	}
	if(cnt[h[u]]>1)upd_h(u,nh);
	else for(int re i=h[u];i<N;++i){
		for(int j:gap[i])upd_h(j,INF);
		gap[i].clear();
	}
}

inline int HLPP(int lim=20000){
	memset(rest,0,sizeof rest);
	rest[S]=2147483647;
	relabel();
	for(edge &e:G[S])push(S,e);
	for(;~ht;--ht)
	while(!lst[ht].empty()){
		int u=lst[ht].back();
		lst[ht].pop_back();
		push_flow(u);
		if(work>lim)
		relabel();
	}
	return rest[T];
}

signed main(){
	n=getint(),m=getint();
	S=getint(),T=getint();
	for(int re i=1,u,v,val;i<=m;++i){
		u=getint(),v=getint(),val=getint();
		addedge(u,v,val);
	}
	cout<<HLPP()<<"\n";
	return 0;
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值