费用流模板

EK费用流

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#define For(i,j,k) for(register int i=j;i<=k;++i)
using namespace std;

int v[100010],nex[100010],beg[5010],w[100010],e,ans,n,m,vis[5010],dis[5010],pre[5010],pj,f[100010],s,t,fs,xx,uu;
queue<int> q;
char cc;

inline int read()
{
    xx=0;
    cc=getchar();
    while(!isdigit(cc))
        cc=getchar();
    while(isdigit(cc))
    {
        xx=(xx<<1)+(xx<<3)+cc-48;
        cc=getchar();
    }
    return xx;
}

inline void add(int uu,int vv,int ww,int ff)
{
    v[++e]=vv;
    w[e]=ww;
    nex[e]=beg[uu];
    beg[uu]=e;
    f[e]=ff;
    v[++e]=uu;
    w[e]=-ww;
    nex[e]=beg[vv];
    beg[vv]=e;
    f[e]=0;
}

inline int _max(int a,int b)
{
    return a>b?a:b;
}

inline int _min(int a,int b)
{
    return a<b?a:b;
}

inline bool BFS()
{
    while(!q.empty())
    {
        uu=q.front();
        q.pop();
        vis[uu]=0;
        for(int i=beg[uu];i;i=nex[i])
        {
            if (w[i]+dis[uu]<dis[v[i]]&&(f[i]>0))
            {
                pre[v[i]]=i;
                dis[v[i]]=w[i]+dis[uu];
                if (!vis[v[i]])
                {
                    q.push(v[i]);
                    vis[v[i]]=1;
                }
            }
        }
    }
    if (dis[t]==1e9)
        return 0;
    return 1;
}

inline void max_flow()
{
    ans=0;
    while (1)
    {
        For(i,1,n)
            vis[i]=0;
        q.push(s);
        For(i,1,n)
            dis[i]=1e9;
        dis[s]=0;
        vis[s]=1;
        if (!BFS())
            return ;
        pj=1e9;
        int x=t;
        while (x!=s)
        {
            pj=_min(pj,f[pre[x]]);
            x=v[pre[x]^1];
        }
        x=t;
        while(x!=s)
        {
            f[pre[x]]-=pj;
            f[pre[x]^1]+=pj;
            x=v[pre[x]^1];
        }
        ans+=dis[t]*pj;
        fs+=pj;
    }
}

int main()
{
    int uu,vv,ww,ff;
    scanf("%d%d%d%d",&n,&m,&s,&t);
    e=1;
    For(i,1,m)
    {
        scanf("%d%d%d%d",&uu,&vv,&ff,&ww);
        add(uu,vv,ww,ff);
    }
    max_flow();
    printf("%d %d\n",fs,ans);
    return 0;
}
//海阔山遥，未知何处是潇湘。
//    -- 柳永《玉蝴蝶·望处雨收云断》

zkw费用流

/**************************
Au: Hany01
Date: Jan 9th, 2018
Prob: zkwMCMF
Email: hany01@foxmail.com
**************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define ffr ffrst
#define sec second
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Ha (1000000007)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("zkwMCMF.in", "r", stdin);
    freopen("zkwMCMF.out", "w", stdout);
#endif
}

const int maxn = 5005, maxm = 100005;

int n, m, s, t, e, dis[maxn], vis[maxn], f[maxm], v[maxm], w[maxm], beg[maxn], nex[maxm], Cost, Flow;

inline void add(int uu, int vv, int ww, int ff) { v[++ e] = vv; w[e] = ww; f[e] = ff; nex[e] = beg[uu]; beg[uu] = e; }

inline void Init()
{
    register int uu, vv, ww, ff;
    n = read(); m = read(); s = read(); t = read(); e = 1;
    while (m --) uu = read(), vv = read(), ff = read(), ww = read(), add(uu, vv, ww, ff), add(vv, uu, -ww, 0);
}

inline bool BFS()
{
    static deque<int> q;
    For(i, 1, n) dis[i] = INF; Set(vis, 0);
    dis[s] = 0; vis[s] = 1; q.pb(s);
    while (!q.empty()) {
        register int u = q.front(); q.pop_front(); vis[u] = 0;
        for (register int i = beg[u]; i; i = nex[i])
            if (f[i] && chkmin(dis[v[i]], dis[u] + w[i]))
                if (!vis[v[i]]) {
                    vis[v[i]] = 1;
                    if (!q.empty() && dis[q.front()] > dis[v[i]]) q.pf(v[i]); else q.pb(v[i]);
                }
    }
    return dis[t] != INF;
}

int DFS(int u, int flow)
{
    if (u == t) return flow;
    vis[u] = 1;
    register int res = flow, tmp;
    for (register int i = beg[u]; i; i = nex[i]) {
        if (vis[v[i]] || !f[i] || dis[v[i]] != dis[u] + w[i]) continue;
        tmp = DFS(v[i], min(f[i], res));
        f[i] -= tmp; f[i ^ 1] += tmp; Cost += tmp * w[i];
        if (!(res -= tmp)) return flow;
    }
    return flow - res;
}

inline void MCMF()
{
    while (BFS()) {
        vis[t] = 1;
        while (vis[t]) {
            Set(vis, 0);
            Flow += DFS(s, INF);
        }
    }
}

int main()
{
    File();
    Init();
    MCMF();
    printf("%d %d\n", Flow, Cost);
    return 0;
}
//四月十七，正是去年今日，别君时。
//    -- 韦庄《女冠子·四月十七》