【BZOJ5403】marshland（费用流）

Description

https://www.luogu.org/problemnew/show/P4142

---

Solution

建四列点,把奇数列的偶数格放在第一列,每个奇数格拆成两个点分别放在第二列和第三列,偶数列的偶数格放在第四列。第一列到第二列是如果点是相邻的则连容量为 1 费用为 0 的边,第三列到第四列同理,第二列到第三列的相同点则连容量为 1 费用为负的危险度的边,然后源点向第一列,第四列向汇点连容量为 1 费用为 0 的边，跑费用流即可。注意及时chkmax，因为费用流的结果是先保证流量最大的，而本题保证的是费用最大。

---

Code

/************************************************
 * Au: Hany01
 * Prob: marshland
 * Email: hany01@foxmail.com
 * Institute: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#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 x first
#define y 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 debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

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 _ * __;
}

const int maxw = 55, maxn = 55 * 55 * 100, maxm = maxn * 8;

int n, m, k, beg[maxn], fb[maxw][maxw], v[maxm], f[maxm], w[maxm], e = 1, dis[maxn], tot, S, T, a[maxw][maxw], id[maxw][maxw], nex[maxm], Sum, S1;
int dt[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};
LL Cost, Ans;
bitset<maxn> vis;

#define idx(a, b) (((a) - 1) * n + (b))

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

inline bool BFS()
{
    static queue<int> q;
    For(i, 1, tot) dis[i] = INF;
    vis.reset(), dis[S1] = 0, q.push(S1);
    while (!q.empty()) {
        register int u = q.front(); q.pop(); vis.reset(u);
        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.set(v[i]), q.push(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]) {
            tmp = DFS(v[i], min(res, f[i])), f[i] -= tmp, f[i ^ 1] += tmp, Cost += w[i] * (LL)tmp;
            if (!(res -= tmp)) return flow;
        }
    return flow - res;
}

int main()
{
#ifndef ONLINE_JUDGE
    File("marshland");
#endif

    static int xx, yy;

    n = read(), m = read(), k = read();
    For(i, 1, n) For(j, 1, n) Sum += (a[i][j] = read());
    For(i, 1, k) xx = read(), yy = read(), fb[xx][yy] = 1;
    tot = n * n, S = ++ tot, S1 = ++ tot, T = ++ tot, add(S1, S, m, 0);
    For(i, 1, n) For(j, 1, n) if (!fb[i][j] && ((i + j) & 1)) id[i][j] = ++ tot;
    For(i, 1, n) For(j, 1, n) if (!fb[i][j]) {
        if ((i + j) & 1) add(idx(i, j), id[i][j], 1, a[i][j]);
        else if (i & 1) {
            add(S, idx(i, j), 1, 0);
            rep(k, 4) {
                register int x = i + dt[k][0], y = j + dt[k][1];
                if (x >= 1 && x <= n && y >= 1 && y <= n && !fb[x][y]) add(idx(i, j), idx(x, y), 1, 0);
            }
        } else {
            add(idx(i, j), T, 1, 0);
            rep(k, 4) {
                register int x = i + dt[k][0], y = j + dt[k][1];
                if (x >= 1 && x <= n && y >= 1 && y <= n && !fb[x][y]) add(id[x][y], idx(i, j), 1, 0);
            }
        }
    }

    //int fl = 0;
    while (BFS()) {
        do {
            vis.reset(), DFS(S1, INF);
            chkmax(Ans, -Cost);
            //if (!chkmax(Ans, -Cost)) { fl = 1; break; }
        } while (vis[T]);
        //if (fl) break;
    }
    printf("%lld\n", Sum - Ans);

    return 0;
}
//唯有门前镜湖水，春风不改旧时波。
//    -- 贺知章《回乡偶书二首》