费用流 SPFA

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define ll long long
#define inf 50000000
#define re register
using namespace std;
struct po
{
    int from,to,dis,nxt,w;
}edge[250001];
int head[250001],cur[1000001],dep[60001],n,m,s,t,u,num=-1,x,y,l,tot,sum,k,fa[10001];
int dis[5001],b[5001],xb[5001],flow[5001];
inline int read()
{
    int x=0,c=1;
    char ch=' ';
    while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
    while(ch=='-')c*=-1,ch=getchar();
    while(ch<='9'&&ch>='0')x=x*10+ch-'0',ch=getchar();
    return x*c;
}
inline void add_edge(int from,int to,int w,int dis)
{
    edge[++num].nxt=head[from];
    edge[num].from=from;
    edge[num].to=to;
    edge[num].w=w;
    edge[num].dis=dis;
    head[from]=num;
}
inline void add(int from,int to,int w,int dis)
{
    add_edge(from,to,w,dis);
    add_edge(to,from,0,-dis);
}
inline bool bfs()
{
    memset(dis,100,sizeof(dis));
    memset(b,0,sizeof(b));
    queue<int> q;
    while(!q.empty())
        q.pop();
    for(re int i=1;i<=n;i++)
    {
        fa[i]=-1;
    }
    b[s]=1;dis[s]=0;fa[s]=0;
    flow[s]=inf;q.push(s);
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        b[u]=0;
        for(re int i=head[u];i!=-1;i=edge[i].nxt)
        {
            int v=edge[i].to;
            if(edge[i].w>0&&dis[v]>dis[u]+edge[i].dis)
            {
                dis[v]=dis[u]+edge[i].dis;
                fa[v]=u;
                xb[v]=i;
                flow[v]=min(flow[u],edge[i].w);
                if(!b[v]){b[v]=1,q.push(v);}
            }
        }
    }
    return dis[t]<inf;
}
inline void max_flow()
{
    while(bfs())
    {
        int k=t;
        while(k!=s)
        {
            edge[xb[k]].w-=flow[t];
            edge[xb[k]^1].w+=flow[t];
            k=fa[k];
        }
        tot+=flow[t];
        sum+=flow[t]*dis[t];
    }
}
int main()
{
    memset(head,-1,sizeof(head));
    n=read();m=read();s=read();t=read();
    for(re int i=1;i<=m;i++)
    {
        x=read();y=read();l=read();
        int d=read();
        add(x,y,l,d);
    }
    max_flow();
    cout<<tot<<" "<<sum;
}