最小费用最大流

最小费用最大流板子

#include<bits/stdc++.h>
#define inf 1e9
#define int long long
using namespace std;
inline int read(){
	int w=1,data=0;char ch;
	ch=getchar();
	while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
	if(ch=='-') w=-1,ch=getchar();
	while(ch>='0'&&ch<='9') data=data*10+ch-'0',ch=getchar();
	return data*w;
}
const int N=5000+20;
const int M=50000+20;
int cnt=0,dis[N],pre[N],vis[N],fir[N],s,t,mincost=0,maxflow=0;;
struct edge{
	int v,nxt,cap,flow,cost;
}e[M<<1];
inline void add(int u,int v,int c,int cost){
	e[cnt]=(edge){v,fir[u],c,0,cost};fir[u]=cnt++;
	e[cnt]=(edge){u,fir[v],0,0,-cost};fir[v]=cnt++;
}
bool spfa(int s,int t,int n){
   queue<int>q;
   memset(vis,0,sizeof(vis));
   memset(pre,-1,sizeof(pre));
   for(int i=1;i<=n;i++) dis[i]=inf;
   vis[s]=1;dis[s]=0;q.push(s);
   while(!q.empty()){
     	int u=q.front();q.pop();
     	vis[u]=0;
     	for(int i=fir[u];i!=-1;i=e[i].nxt){
     		int v=e[i].v;
     		if(e[i].cap>e[i].flow&&dis[u]+e[i].cost<dis[v]){
     			    dis[v]=dis[u]+e[i].cost;
     			    pre[v]=i;
     			    if(!vis[v]){
     			 	q.push(v);vis[v]=1;
				    }
			   }
		   }
    }
   if(dis[t]==inf)return 0;
   return 1;
}
int mcmf(int s,int t,int n){
	int d;
     mincost=0,maxflow=0;
	while(spfa(s,t,n)){
		d=inf;
		for(int i=pre[t];i!=-1;i=pre[e[i^1].v])
		    d=min(d,e[i].cap-e[i].flow);
		    maxflow+=d;
		    for(int i=pre[t];i!=-1;i=pre[e[i^1].v]){
		  	e[i].flow+=d;e[i^1].flow-=d;
		  }
		  mincost+=dis[t]*d;
	}
	return mincost;
}
signed main(){
    int n,m,x; 
      n=read();m=read();s=read();t=read();
        memset(fir,-1,sizeof(fir));
        for(int i=0; i<m; i++){
        	int a=read(),b=read(),c=read(),d=read();
        	add(a,b,c,d);
        }
    mcmf(s,t,n);   
	printf("%lld %lld",maxflow,mincost);
	return 0;
}