LOJ#115. 无源汇有上下界可行流

https://loj.ac/problem/115

原理：下界流满+所有点入流==出流

#include <bits/stdc++.h>
using namespace std;
const int maxn=250;
const int INF=0x3f3f3f3f;

struct Edge{
	int from,to,cap,flow;
};

struct Dinic{
	int n,m0,m,s,t;
	vector<Edge> edges;
	vector<int> G[maxn];
	bool vis[maxn];
	int d[maxn];
	int cur[maxn];
	int low[20000],sum;

	void init()
	{
		cin>>n>>m0;
		s=0;t=n+1;
		int u,v,b,c;
		int in[maxn]={0},out[maxn]={0};
		for(int i=0;i<m0;i++)
		{
			cin>>u>>v>>b>>c;
			low[i]=b;
			in[v]+=b;
			out[u]+=b;
			AddEdge(u,v,c-b);
		}
		for(int i=1;i<=n;i++)
		{
			if(in[i]>out[i])AddEdge(s,i,in[i]-out[i]),sum+=in[i]-out[i];
			else AddEdge(i,t,out[i]-in[i]);
		}
	}

	void AddEdge(int f,int t,int c)
	{
		edges.push_back((Edge){f,t,c,0});
		edges.push_back((Edge){t,f,0,0});
		m=edges.size();
		G[f].push_back(m-2);
		G[t].push_back(m-1);
	}

	bool bfs()
	{	
		memset(vis,0,sizeof(vis));
		queue<int> Q;
		Q.push(s);
		d[s]=0;
		vis[s]=1;
		while(!Q.empty())
		{
			int x=Q.front();Q.pop();
			for(int i=0;i<G[x].size();i++)
			{
				Edge& e=edges[G[x][i]];
				if(!vis[e.to] && e.cap>e.flow)
				{
					vis[e.to]=1;
					d[e.to]=d[x]+1;
					Q.push(e.to);
				}
			}
		}
		return vis[t];
	}

	int dfs(int x,int a)
	{
		if(x==t || a==0)return a;
		int flow=0,f;
		for(int& i=cur[x];i<G[x].size();i++)
		{
			Edge& e=edges[G[x][i]];
			if(d[x]+1==d[e.to] && (f=dfs(e.to,min(a,e.cap-e.flow)))>0)
			{
				e.flow+=f;
				edges[G[x][i]^1].flow-=f;
				flow+=f;
				a-=f;
				if(!a)break;
			}
		}
		return flow;
	}

	int MaxFlow()
	{
		int flow=0;
		while(bfs())
		{
			memset(cur,0,sizeof(cur));
			flow+=dfs(s,INF);
		}
		return flow;
	}

	void print(int ans)
	{	
		if(ans!=sum){cout<<"NO"<<endl;return;}
		cout<<"YES"<<"\n";
		for(int i=0;i<m0*2;i+=2)
		{
			cout<<low[i/2]+edges[i].flow<<"\n";
		}
	}
}ans;

int main()
{
	//freopen("input.in","r",stdin);
	ans.init();
	int flow=ans.MaxFlow();
	ans.print(flow);
	return 0;
}