【模板】费用流

传送门

//by sdfzchy
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
const int inf=(1<<30),N=100010,mod=1e9+7;
int n,m,ecnt=1,s,t,head[N];
inline int in()
{
    char tmp=getchar();
    int res=0,f=1;
    while((tmp<'0'||tmp>'9')&&tmp!='-')tmp=getchar();
    if(tmp=='-') f=-1,tmp=getchar();
    while(tmp>='0'&&tmp<='9')   res=(res<<1)+(res<<3)+(tmp^48),tmp=getchar();
    return res*f;
}
struct E
{
    int to,nxt,c,w;
}e[N];
void add(int u,int v,int c,int w)
{
    ++ecnt; e[ecnt]=(E){v,head[u],c,w}; head[u]=ecnt;
    ++ecnt; e[ecnt]=(E){u,head[v],0,-w};head[v]=ecnt;
}
int dis[N];
bool vis[N];
bool bfs()
{
    for(int i=1;i<=n;i++) dis[i]=inf,vis[i]=0;
    deque<int> q; q.push_front(s);
    vis[s]=1,dis[s]=0;
    while(!q.empty())
    {
        int u=q.front(); q.pop_front(); vis[u]=0;
        for(int i=head[u];i;i=e[i].nxt)
        {
            int v=e[i].to;
            if(e[i].c>0&&dis[v]>dis[u]+e[i].w)
            {
                dis[v]=dis[u]+e[i].w;
                if(!vis[v])
                {
                    if(q.empty()) q.push_front(v);
                    else if(dis[v]<dis[q.front()]) q.push_front(v);
                    else q.push_back(v);
                    vis[v]=1;
                }
            }           
        } 
    }
    return dis[t]^inf;
}
int allc;
int dfs(int u,int F)
{
    if(vis[u]) return 0;
    if(u==t||!F) return allc+=dis[t]*F,F;
    vis[u]=1;
    int ret=0,tmp;
    for(int i=head[u];i;i=e[i].nxt)
    {
        int v=e[i].to;
        if(dis[v]==dis[u]+e[i].w&&e[i].c)
            if(tmp=dfs(v,min(F,e[i].c)))
            {
                e[i].c-=tmp,e[i^1].c+=tmp;
                ret+=tmp,F-=tmp;
            }
    }
    vis[u]=0;
    return ret;
}

int mcmf()
{
    int ret=0;
    while(bfs())
    ret+=dfs(s,inf);
    return ret;
}

int main()
{
    n=in(),m=in(),s=1,t=n;
    for(int i=1,u,v,c,w;i<=m;i++)
    {
        u=in(),v=in(),c=in(),w=in();
        add(u,v,c,w);
    }
    printf("%d ",mcmf());   
    printf("%d",allc);
    return 0;
}