费用流负环处理模板

P7173 【模板】有负圈的费用流

有负的费用的处理

#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
using namespace std;
const int mod=998244353;
const int M=1e8+5;
const int N=2e6+5;//?????????? 4e8.
int n,m,s,t;
int st,ed;
int maxflow,ans;
int total[N];
namespace EK
{
	struct node
	{
		int ver,edge,cost,next;
	}e[N];
	int tot=1,head[N];
	int incf[N],pre[N],v[N],d[N];
	void add(int x,int y,int z,int w)
	{
		e[++tot].ver=y;
		e[tot].edge=z;
		e[tot].cost=w;
		e[tot].next=head[x];
		head[x]=tot;
	}
	void addedge(int x,int y,int z,int w)
	{
		add(x,y,z,w);add(y,x,0,-w);
	}
	bool spfa(int s,int t)
	{
		for(re i=0;i<=n+5;i++)  v[i]=0,d[i]=1e9;
		queue < int > q;
		q.push(s);d[s]=0;v[s]=1;incf[s]=1e9;
		while(q.size())
		{
			int x=q.front();q.pop();v[x]=0;
//			cout<<x<<endl;
			for(re i=head[x];i;i=e[i].next)
			{	
				int y=e[i].ver;
				int z=e[i].edge;
				int w=e[i].cost;
				if(!z)  continue;
				if(d[y]>d[x]+w)
				{
					incf[y]=min(z,incf[x]);
					pre[y]=i;
					d[y]=d[x]+w;
					if(!v[y])  v[y]=1,q.push(y);
				}
			}
		}
		if(d[t]>=1e9)  return 0;
		return 1;
	}
	void update(int s,int t)
	{
		int x=t;
		while(s!=x)
		{
			int i=pre[x];
			e[i].edge-=incf[t];
			e[i^1].edge+=incf[t];
			x=e[i^1].ver;
		}
		ans+=d[t]*incf[t];
		maxflow+=incf[t];
	}
	void ek()
	{
		while(spfa(st,ed))  update(st,ed);
		maxflow=0;
		while(spfa(s,t))  update(s,t);
	}
}
void solve()
{
	cin>>n>>m>>s>>t;
	for(re i=1;i<=m;i++)
	{
		int x,y,z,w;
		scanf("%d%d%d%d",&x,&y,&z,&w);
		if(w>=0)  EK::addedge(x,y,z,w);
		else
		{
			EK::addedge(y,x,z,-w);//反向建图 
			total[x]-=z,total[y]+=z;
			ans+=z*w;
		}
	}
	st=n+1,ed=n+2;
	for(re i=1;i<=n;i++)
	{
		if(!total[i])  continue;
		if(total[i]>0)  EK::addedge(st,i,total[i],0);
		else  EK::addedge(i,ed,-total[i],0);
	}
	EK::addedge(t,s,1e9,0);
	EK::ek();
	cout<<maxflow<<" "<<ans<<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


*/