test 8-11 MLE

#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
typedef long long ll;
const int N=5e3+10,M=5e4+10;
int n,m,s,t,tot=1;
int head[N],now[N],dis[N],vis[N];;
ll flow,cost;
struct note{
	int to,nxt,w,c;
}edge[M<<1];
void add(int u,int v,int w,int c){
	edge[++tot].to=v;
	edge[tot].w=w;
	edge[tot].c=c;
	edge[tot].nxt=head[u];
	head[u]=tot;
}
bool SPFA(){
	fill(dis+1,dis+n+1,INF);
	fill(vis+1,vis+n+1,0);
	queue<int> q;
	now[s]=head[s];
	dis[s]=0;
	vis[s]=1;
	q.push(s);
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(int i=head[u];i;i=edge[i].nxt){
			int v=edge[i].to;
			int w=edge[i].w;
			int c=edge[i].c;
			if(w>0 && dis[v]>dis[u]+c){
				dis[v]=dis[u]+c;
				if(!vis[v]){
					vis[v]=1;
					q.push(v);
				}
			}
		}
	}
	return dis[t]<INF;
}
int dfs(int u,int sum){
	if(u==t) return sum;
	int k,res=0;
	for(int &i=now[u];i&&sum;i=edge[i].nxt){
		now[u]=i;
		int v=edge[i].to;
		int w=edge[i].w;
		int c=edge[i].c;
		if(w>0 && dis[v]==dis[u]+c){
			k=dfs(v,min(sum,w));
			if(k==0) dis[v]=INF;
			edge[i].w-=k;
			edge[i^1].w+=k;
			res+=k;
			sum-=k;
			cost+=k*edge[i].c;
		}
	}
	return res;
}
void dinic(){
	while(SPFA()){
		for(int i=1;i<=n;++i)
			now[i]=head[i];
		int res;
		while((res=dfs(s,INF))>0)
			flow+=res;
	}
}
int main(){
	cin>>n>>m>>s>>t;
	for(int i=1;i<=m;++i){
		int u,v,w,c;
		cin>>u>>v>>w>>c;
		add(u,v,w,c);
		add(v,u,0,-c);
	}
	dinic();
	cout<<flow<<" "<<cost;
	return 0;
}