PowerOJ 2543: 赛场布置

题目链接

---

  对于每个点，它可以选择男或者女，如果要加上的贡献，那么相邻的一定得是异性才可以。所以，对相邻的，我们可以考虑成：

  然后，我们对于点坐标的的奇偶性分别讨论即可。

  当然，还需要考虑的贡献。

  然后就是全选减去最少割去的即可。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define pii pair<int, int>
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e2 + 7;
int N, M, a[maxN][maxN], b[maxN][maxN], c[maxN][maxN], d[maxN][maxN];
namespace Dinic
{
    inline int _ID(int x, int y) { return (x - 1) * M + y; }
    const int maxP = maxN * maxN, maxM = maxP * 20;
    struct Eddge
    {
        int nex, to, flow;
        Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), flow(c) {}
    } edge[maxM];
    int S, T, head[maxP], cnt;
    inline void addEddge(int u, int v, int f)
    {
        edge[cnt] = Eddge(head[u], v, f);
        head[u] = cnt++;
    }
    inline void _add(int u, int v, int f) { addEddge(u, v, f); addEddge(v, u, 0); }
    queue<int> Q;
    int deep[maxP], cur[maxP];
    bool bfs()
    {
        while(!Q.empty()) Q.pop();
        for(int i=0; i<=T; i++) deep[i] = 0;
        deep[S] = 1;
        Q.push(S);
        while(!Q.empty())
        {
            int u = Q.front(); Q.pop();
            for(int i=head[u], v; ~i; i=edge[i].nex)
            {
                v = edge[i].to;
                if(deep[v] || !edge[i].flow) continue;
                deep[v] = deep[u] + 1;
                Q.push(v);
            }
        }
        return deep[T];
    }
    int dfs(int u, int dist)
    {
        if(u == T || !dist) return dist;
        int sum_flow = 0;
        for(int &i=cur[u], v, tmp; ~i; i=edge[i].nex)
        {
            v = edge[i].to;
            if(deep[v] == deep[u] + 1 && edge[i].flow)
            {
                tmp = dfs(v, min(dist, edge[i].flow));
                dist -= tmp;
                sum_flow += tmp;
                edge[i].flow -= tmp;
                edge[i ^ 1].flow += tmp;
            }
        }
        return sum_flow;
    }
    int max_flow()
    {
        int sum = 0;
        while(bfs())
        {
            for(int i=0; i<=T; i++) cur[i] = head[i];
            sum += dfs(S, INF);
        }
        return sum;
    }
    inline void init()
    {
        cnt = 0;
        for(int i=0; i<=T; i++) head[i] = -1;
    }
}
using namespace Dinic;
inline bool In_Map(int x, int y) { return x >= 1 && y >= 1 && x <= N && y <= M; }
const int dir[4][2] =
{
    -1, 0,
    0, -1,
    0, 1,
    1, 0
};
int main()
{
    scanf("%d%d", &N, &M);
    int ans = 0;
    for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) { scanf("%d", &a[i][j]); ans += a[i][j]; }
    for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) { scanf("%d", &b[i][j]); ans += b[i][j]; }
    for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) scanf("%d", &c[i][j]);
    for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) scanf("%d", &d[i][j]);
    S = 0; T = N * M + 1;
    init();
    for(int i=1; i<=N; i++) for(int j=1; j<=M; j++)
    {
        if((i + j) & 1)
        {
            _add(S, _ID(i, j), a[i][j]);
            _add(_ID(i, j), T, b[i][j]);
        }
        else
        {
            _add(S, _ID(i, j), b[i][j]);
            _add(_ID(i, j), T, a[i][j]);
        }
    }
    for(int x=1, id, nex_id, val; x<=N; x++) for(int y=1; y<=M; y++)
    {
        id = _ID(x, y);
        for(int i=0, xx, yy; i<4; i++)
        {
            xx = x + dir[i][0]; yy = y + dir[i][1];
            if(!In_Map(xx, yy)) continue;
            ans += c[xx][yy];
            nex_id = _ID(xx, yy);
            val = c[x][y] + c[xx][yy] + d[x][y] + d[xx][yy];
            _add(id, nex_id, val);
        }
    }
    printf("%d\n", ans - max_flow());
    return 0;
}