P3381 【模板】最小费用最大流（MCMF）

题目链接：https://www.luogu.org/problemnew/show/P3381

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e5 + 7;

bool vis[maxn];
int n,m,s,t,x,y,z,f,dis[maxn],pre[maxn],last[maxn],flow[maxn],maxflow,mincost;
//dis最小花费;pre每个点的前驱；last每个点的所连的前一条边；flow源点到此处的流量
struct node{int next,to,flow,dis;}edge[maxn];//flow流量 dis花费
int head[maxn],cnt;
queue <int> q;

void add(int u,int v,int flow,int dis)
{
    edge[cnt] = (node){head[u],v,flow,dis}; head[u] = cnt++;
    edge[cnt] = (node){head[v],u,0,-dis}; head[v] = cnt++;
     //反边的流量为0，花费是相反数
}

bool spfa(int s,int t)
{
    for(int i = 0; i < t + 10; i++)
        dis[i] = inf, flow[i] = inf, vis[i] = 0;
    q.push(s); vis[s] = 1; dis[s] = 0; pre[t] = -1;
    while (!q.empty())
    {
        int now = q.front();
        q.pop();
        vis[now] = 0;
        for (int i = head[now]; i != -1; i = edge[i].next)
        {
            if (edge[i].flow > 0 && dis[edge[i].to] > dis[now] + edge[i].dis)//正边
            {
                dis[edge[i].to] = dis[now] + edge[i].dis;
                pre[edge[i].to] = now;
                last[edge[i].to] = i;
                flow[edge[i].to] = min(flow[now],edge[i].flow);//
                if (!vis[edge[i].to])
                {
                    vis[edge[i].to] = 1;
                    q.push(edge[i].to);
                }
            }
        }
    }
    return pre[t] != -1;
}

void MCMF()
{
    maxflow = 0, mincost = 0;
    while(spfa(s,t))
    {
        int now = t;
        maxflow += flow[t];
        mincost += flow[t]*dis[t];
        while (now != s)
        {//从源点一直回溯到汇点
            edge[last[now]].flow -= flow[t];//flow和dis容易搞混
            edge[last[now]^1].flow += flow[t];
            now = pre[now];
        }
    }
}

int main()
{
    memset(head,-1,sizeof(head)); cnt = 0;//初始化
    scanf("%d%d%d%d",&n,&m,&s,&t);
    for(int i = 1; i <= m; i++)
    {
        scanf("%d%d%d%d",&x,&y,&z,&f);
        add(x,y,z,f);
    }
    MCMF();
    printf("%d %d",maxflow,mincost);
    return 0;
}