Acwing 2326. 王者之剑

题目链接

题目思路

由题意可以分析出
1、只能在偶数秒时刻才能拿宝石
2、相邻位置的宝石不可以兼得
3、由2可以想到二分图的最大权独立集

故对于整张图分为两部分 由S连向一部分为坐标之和为奇数的点 另一部分为坐标之和为偶数的点连向T 同边各点必不会相邻 再将左边点连向相邻点权值为INF 跑一遍dinic 用所有点之和减去最小割得到答案

对于求二分图最大权独立集 可以用所有点权之和减去最小权点覆盖 二分图最小权点覆盖可以用dinic求最小割来求 选择哪个点则割去哪条与此点相连的边

代码

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int N = 10010, M = 600010, INF = 1e8;

int n, m, S, T;
int h[N], e[M], ne[M], f[M], idx;
int cur[N], q[N], d[N];

int dx[4] = {0, -1, 0, 1}, dy[4] = {1, 0, -1, 0};

int get(int i, int j)
{
    return (i - 1) * m + j;
}

void add(int a, int b, int c)
{
    e[idx] = b, ne[idx] = h[a], f[idx] = c, h[a] = idx ++ ;
    e[idx] = a, ne[idx] = h[b], f[idx] = 0, h[b] = idx ++ ;
}

bool bfs()
{
    memset(d, -1, sizeof d);
    int hh = 0, tt = 0;
    q[0] = S, d[S] = 0, cur[S] = h[S];
    while (hh <= tt)
    {
        int t = q[hh ++ ];
        for (int i = h[t]; ~i; i = ne[i])
        {
            int ver = e[i];
            if (d[ver] == -1 && f[i])
            {
                d[ver] = d[t] + 1;
                cur[ver] = h[ver];
                if (ver == T) return true;
                q[ ++ tt] = ver;
            }
        }
    }
    return false;
}

int find(int u, int limit)
{
    if (u == T) return limit;
    int flow = 0;
    for (int i = cur[u]; ~i && flow < limit; i = ne[i])
    {
        cur[u] = i;
        int ver = e[i];
        if (d[ver] == d[u] + 1 && f[i])
        {
            int t = find(ver, min(f[i], limit - flow));
            if (!t) d[ver] = -1;
            f[i] -= t, f[i ^ 1] += t, flow += t;
        }
    }
    return flow;
}

int dinic()
{
    int r = 0, flow;
    while (bfs()) while (flow = find(S, INF)) r += flow;
    return r;
}

int main()
{
    scanf("%d%d", &n, &m);
    S = 0, T = n * m + 1;
    
    memset(h, -1, sizeof h);
    
    int tot = 0;
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ )
        {
            int w;
            scanf("%d", &w);
            if (i + j & 1) 
            {
                add(S, get(i, j), w);
                for (int k = 0; k < 4; k ++ )
                {
                    int x = i + dx[k], y = j + dy[k];
                    if (x > n || x < 1 || y > m || y < 1) continue;
                    add(get(i, j), get(x, y), INF);
                }
            }
            else add(get(i, j), T, w);
            tot += w;
        }
    
    printf("%d\n", tot - dinic());
    
    return 0;
}