【网络流24题】运输问题

Description

click me

Solution

费用流模板题（我也只会模板了）：从原点向所有商店连一条流量为商品数量、费用为0的边，从所有仓库向汇点连流量为需求量、费用为0的边，商店和仓库间连流量为无限大、费用为输入的运输费用的边。
题目要求求最大费用，那么把所有费用取相反数，再把答案取反即可。

Code

/**************************
 * Au: Hany01
 * Date: Jan 14th, 2018
 * Prob: luogu4015
 * 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 fir first
#define sec second
#define pb(a) push_back(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 Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)

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("luogu4015.in", "r", stdin);
    freopen("luogu4015.out", "w", stdout);
#endif
}

const int maxn = 205, maxm = 30000;

int n, m, s, t, Sum, dis[maxn], vis[maxn], beg[maxn], nex[maxm], f[maxm], v[maxm], e, w[maxm], A[maxn], B[maxn], W[maxn][maxn];
LL Cost;

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

inline void Init1()
{
    n = read(), m = read(), s = 0, t = n + m + 1, Sum = t + 1, e = 1;
    For(i, 1, n) add(0, i, A[i] = read(), 0);
    For(i, 1, m) add(i + n, t, B[i] = read(), 0);
    For(i, 1, n) For(j, n + 1, n + m) add(i, j, INF, W[i][j - n] = read());
}

inline void Init2()
{
    s = 0, t = n + m + 1, Sum = t + 1, e = 1; Set(beg, 0);
    For(i, 1, n) add(0, i, A[i], 0);
    For(i, 1, m) add(i + n, t, B[i], 0);
    For(i, 1, n) For(j, n + 1, n + m) add(i, j, INF, -W[i][j - n]);
}

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

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

inline void MCMF(int type)
{
    Cost = 0;
    while (bfs())
        do Set(vis, 0), dfs(s, INF); while (vis[t]);
    printf("%lld\n", Cost * type);
}

int main()
{
    File();
    Init1();
    MCMF(1);
    Init2();
    MCMF(-1);
    return 0;
}
//雨里鸡鸣一两家，竹溪村路板桥斜。
//    -- 王建《雨过山村》