HDU 3657 Game 最小割

题目：

http://acm.hdu.edu.cn/showproblem.php?pid=3657

题意：

给定一个n*m的方格，每个格子里有一个数，现在从里面去一些数字，使这些数字的和最大，其中若有两个格子相邻，则要减去2 * (v & u) ，另外规定有一些格子必须取

思路：

首先对格子二分建图，类似于最大权独立集，必须取的格子和源汇点连边时容量为无穷大，这样避免被最小割取到，两个相邻的格子之间建边，容量为2 * (v & u)，最后格子里数值和 - 最小割就是答案

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <cmath>
using namespace std;

typedef long long ll;
const int N = 2600, INF = 0x3f3f3f3f;
struct edge
{
    int to, cap, next;
} g[N*100];
bool vis[N];
int cnt, head[N];
int gap[N], que[N], level[N], pre[N], cur[N];
int ss, tt, nv;
void add_edge(int v, int u, int cap)
{
    g[cnt].to = u, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
    g[cnt].to = v, g[cnt].cap = 0, g[cnt].next = head[u], head[u] = cnt++;
}
void bfs(int t)
{
    memset(level, -1, sizeof level);
    memset(gap, 0, sizeof gap);
    int st = 0, en = 0;
    level[t] = 0;
    que[en++] = t;
    gap[level[t]]++;
    while(st < en)
    {
        int v = que[st++];
        for(int i = head[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(level[u] < 0)
            {
                level[u] = level[v] + 1;
                gap[level[u]]++;
                que[en++] = u;
            }
        }
    }
}
int sap(int s, int t)
{
    bfs(t);
    memcpy(cur, head, sizeof head);
    int v = pre[s] = s, flow = 0, aug = INF;
    while(level[s] < nv)
    {
        bool flag = false;
        for(int &i = cur[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(g[i].cap > 0 && level[v] == level[u] + 1)
            {
                flag = true;
                pre[u] = v;
                v = u;
                aug = min(aug, g[i].cap);
                if(v == t)
                {
                    flow += aug;
                    while(v != s)
                    {
                        v = pre[v];
                        g[cur[v]].cap -= aug;
                        g[cur[v]^1].cap += aug;
                    }
                    aug = INF;
                }
                break;
            }
        }
        if(flag) continue;
        int minlevel = nv;
        for(int i = head[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(g[i].cap > 0 && level[u] < minlevel)
                minlevel = level[u], cur[v] = i;
        }
        if(--gap[level[v]] == 0) break;
        level[v] = minlevel + 1;
        gap[level[v]]++;
        v = pre[v];
    }
    return flow;
}
int main()
{
    int n, m, k;
    while(~ scanf("%d%d%d", &n, &m, &k))
    {
        cnt = 0;
        memset(head, -1, sizeof head);
        ss = 0, tt = n * m + 1;
        int arr[60][60], sum = 0;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                scanf("%d", &arr[i][j]), sum += arr[i][j];
        memset(vis, 0, sizeof vis);
        for(int i = 1; i <= k; i++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            vis[(a-1)*m+b] = true;
        }
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
            {
                bool flag = vis[(i-1)*m+j];
                int cap;
                if((i + j) % 2 == 0)
                {
                    cap = flag ? INF : arr[i][j];
                    add_edge(ss, (i-1)*m + j, cap);
                    if(i != 1)
                        add_edge((i-1)*m + j, (i-2)*m + j, 2*(arr[i][j] & arr[i-1][j]));
                    if(i != n)
                        add_edge((i-1)*m + j, i*m + j, 2*(arr[i][j] & arr[i+1][j]));
                    if(j != 1)
                        add_edge((i-1)*m + j, (i-1)*m + j - 1, 2*(arr[i][j] & arr[i][j-1]));
                    if(j != m)
                        add_edge((i-1)*m + j, (i-1)*m + j + 1, 2*(arr[i][j] & arr[i][j+1]));
                }
                else
                {
                    cap = flag ? INF : arr[i][j];
                    add_edge((i-1)*m + j, tt, cap);
                }
            }
        nv = tt + 1;
        printf("%d\n", sum - sap(ss, tt));
    }
    return 0;
}