P2774 方格取数问题 ·网络流最小割

题解

网络流24题

清晰易懂 ·太清晰了 直接去大佬博客里看吧

然后发现自己对最小割的理解还不够，又搜到了下面这篇好博客

图割-最大流最小切割的最直白解读

割，当一个图被割分成两个部分时，不再存在S到T的通路，所以割的代价必定大于等于图的最大流
所以，最大流 = 最小割

割 - 删边表示不取该点

---

---

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define between(x, a, b) (a<=x && x<=b)
const int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
const int N = 2e5 + 10;
const int INF = 1e9;
int a[200][200];
int n, m, k;

int sum = 0;

namespace Network_flows { //网络流板子
    //设定起点和终点
    int st;//起点-源点
    int ed;//终点-汇点

    struct egde {
        int to, next;
        int flow;//剩余流量
    } e[N * 2];

    int head[N], tot = 1;

    void add(int u, int v, int w) {//一次建双边
        e[++tot] = {v, head[u], w};
        head[u] = tot;
        e[++tot] = {u, head[v], 0};
        head[v] = tot;//网络流反相边流量为0
    }

    int dep[N];//dep[]=-1时为炸点
    queue<int> q;

    bool bfs() {
        memset(dep, 0, sizeof(dep));//顺便起到vis的功能
        q.push(st);
        dep[st] = 1;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int i = head[u]; i; i = e[i].next) {
                int v = e[i].to;
                if (!dep[v] && e[i].flow) {
                    dep[v] = dep[u] + 1;
                    q.push(v);
                }
            }
        }
        return dep[ed];
    }

    int dfs(int u, int Flow) {
        if (u == ed) return Flow;
        int now_flow = 0;//跑残流
        for (int i = head[u]; i; i = e[i].next) {
            int v = e[i].to;
            if (dep[v] == dep[u] + 1 && e[i].flow) {
                int f = dfs(v, min(Flow - now_flow, e[i].flow));
                e[i].flow -= f;
                e[i ^ 1].flow += f;
                now_flow += f;
                if (now_flow == Flow) return Flow;
            }
        }
        if (now_flow == 0)dep[u] = -1;
        return now_flow;
    }

    int dinic() {//最大流最小割
        int res = 0;
        while (bfs()) {
            res += dfs(st, INF);
        }
        return res;
    }

    void init() {
        tot = 1;
        memset(head, 0, sizeof(head));
        while (!q.empty()) q.pop();
    }
}
using namespace Network_flows;

int id(int x, int y) {return x * m + y;}

int main() {
    ios::sync_with_stdio(0);
    cin >> n >> m;
    st = 0, ed = (n + 1) * (m + 1);

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> a[i][j];
            sum += a[i][j];//先假设全部取完 一会儿删
            if ((i + j) % 2 == 0) {//集合A 源点连向自己,自己连向集合B
                add(st, id(i, j), a[i][j]);//流量为边权

                for (int k = 0; k < 4; ++k) {
                    int dx = i + dir[k][0], dy = j + dir[k][1];
                    if (between(dx, 1, n) && between(dy, 1, m)) {
                        add(id(i, j), id(dx, dy), INF);//冲突边 连向集合B的
                    }
                }
            } else {//集合B 连向汇点
                add(id(i, j), ed, a[i][j]);
            }
        }
    }
    int cut = dinic();//最小割
    cout << sum - cut << endl;

    return 0;
}