费用流板子求调

#include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
	char ch=getchar();int f=1,x=0;
	while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return x*f;
}
const int N=1e5+10,inf=1e17+7;
struct edge{int from,to,next,w,c;}e[N<<1];
int head[N],ecnt=-1,n,m,s,t,dis[N],flow[N],in[N],pre[N];
void add_edge(int u,int v,int w,int c){
	e[++ecnt].to=v;e[ecnt].from=u;
	e[ecnt].w=w;e[ecnt].c=c;
	e[ecnt].next=head[u];head[u]=ecnt;
}
queue<int> q;
int spfa(){
	memset(pre,-1,sizeof(pre));
	memset(dis,0x3f,sizeof(dis));
	memset(in,0,sizeof(in));
	q.push(s);in[s]=1;dis[s]=0;flow[s]=inf;
	while(!q.empty()){
		int u=q.front();q.pop();in[u]=0;
		for(int j=head[u];~j;j=e[j].next){
			int v=e[j].to,c=e[j].c,w=e[j].w;
			if(w>0 && dis[v]>dis[u]+c){
				dis[v]=dis[u]+c;pre[v]=j;
				flow[v]=min(flow[u],w);
				if(!in[v]) q.push(v),in[v]=1;
			}
		}
	}
	return pre[t]!=-1;
}
int solve(){
	int f=0,c=0;
	while(spfa()){
		int p=t;
		while(pre[p]!=-1){
			int j=pre[p];
			e[j].w-=flow[t];
			e[j^1].w+=flow[t];
			p=e[j].from;
		}
		f+=flow[t],c+=dis[t]*flow[t];
	}
	printf("%lld %lld",f,c);
}
signed main(){
	memset(head,-1,sizeof(head));
	n=read(),m=read(),s=read(),t=read();
	for(int i=1;i<=m;i++){
		int u=read(),v=read(),w=read(),c=read();
		add_edge(u,v,w,c);add_edge(v,u,0,-c);
	}
	solve();
	return 0;
}