洛谷P2774 方格取数问题(最小割)

题意

$n \times m$的矩阵，不能取相邻的元素，问最大能取多少

Sol

首先补集转化一下：最大权值 = sum - 使图不连通的最小权值

进行黑白染色

从S向黑点连权值为点权的边

从白点向T连权值为点券的边

黑点向白点连权值为INF的边

这样就转化成了最小割问题，跑Dinic即可

/*
首先补集转化一下：最大权值 = sum - 使图不连通的最小权值
进行黑白染色
从S向黑点连权值为点权的边
从白点向T连权值为点券的边
黑点向白点连权值为INF的边
跑Dinic
*/
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int MAXN = 1e5 + , INF = 1e9 + ;
inline int read() {
    char c = getchar();
    int x = , f = ;
    while(c < '' || c > '') {if(c == '-') f = ; c = getchar();}
    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();
    return x * f;
}
int N, M, a[][], black[][], S, T = ;
struct Edge {
    int u, v, f, nxt;
} E[MAXN];
int head[MAXN], cur[MAXN], num = ;
inline void add_edge(int x, int y, int z) {
    E[num] = (Edge) {x, y, z, head[x]};
    head[x] = num++;
}
inline void AddEdge(int x, int y, int z) {
    add_edge(x, y, z);
    add_edge(y, x, );
}
int trans(int x, int y) {
    return (x - ) * M + y;
}
int xx[] = {, -, +, , };
int yy[] = {, , , -, +};
int deep[MAXN];
inline int BFS() {
    queue<int> q; q.push(S);
    memset(deep, , sizeof(deep));
    deep[S] = ;
    while(!q.empty()) {
        int p = q.front(); q.pop();
        for(int i = head[p]; i != -; i = E[i].nxt) {
            int to = E[i].v;
            if(!deep[to] && E[i].f)
                deep[to] = deep[p] + , q.push(to);
        }
    }
    return deep[T];
}
int DFS(int x, int flow) {
    if(x == T) return flow;
    int ansflow = ;
    for(int &i = cur[x]; i != -; i = E[i].nxt) {
        int to = E[i].v;
        if(E[i].f && deep[to] == deep[x] + ) {
            int nowflow = DFS(to, min(flow, E[i].f));
            E[i].f -= nowflow; E[i ^ ].f += nowflow;
            flow -= nowflow; ansflow += nowflow;
            if(flow <= ) break;
        }
    }
    return ansflow;
}
int Dinic() {
    int ans = ;
    while(BFS()) {
        memcpy(cur, head, sizeof(head));
        ans += DFS(S, INF);
    }
    return ans;
}
int main() {
    memset(head, -, sizeof(head));
    N = read();
    M = read();
    int sum = ;
    for(int i = ; i <= N; i++)
        for(int j = ; j <= M; j++) {
            a[i][j] = read(); sum += a[i][j];
            if((i + j) %  == ) {
                AddEdge(S, trans(i, j), a[i][j]);
                for(int k = ; k <= ; k++) {
                    int wx = i + xx[k], wy = j + yy[k];
                    if(wx >=  && wx <= N && wy >=  && wy <= M)
                        AddEdge(trans(i, j), trans(wx, wy), INF);
                }
            }
            else AddEdge(trans(i, j), T, a[i][j]);
        }
    printf("%d", sum - Dinic());
    return ;
}
/*
3 3
1 000 00-
1 00- 0-+
2 0-- -++

*/