【 bzoj 2127 】happiness - 最小割

　　A了这题的我是这样的：

暴力建模似乎没啥好说的。。做了2132之后感觉会好些。。。

#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = a , _ = b ; i <= _ ; i ++)
#define per(i,a,b) for (int i = a , _ = b ; i >= _ ; i --)
#define fore(i,u)  for (int i = head[u] ; i ; i = nxt[i])
#define forM(n,m)  rep (i , 1 , n) rep (j , 1 , m)

inline int rd() {
    char c = getchar();
    while (!isdigit(c)) c = getchar() ; int x = c - '0';
    while (isdigit(c = getchar())) x = x * 10 + c - '0';
    return x;
}

const int inf = 0x7fffffff;
const int maxn = 10007;
const int maxm = 420007;

typedef int arr[maxn];
typedef int adj[maxm];
typedef int mat[107][107];

arr head , dis , cur;
adj to , nxt , cap , flow;
mat a , b , id;

int n , m , ett ,  S , T , ans;

std::queue<int> Q;

void input() {
    n = rd() , m = rd() , ett = 1;
    forM (n , m) a[i][j] = rd() , ans += a[i][j] , a[i][j] <<= 1;
    forM (n , m) b[i][j] = rd() , ans += b[i][j] , b[i][j] <<= 1;
}

inline void init_id() {
    rep (i , 1 , n) rep (j , 1 , m) id[i][j] = (i - 1) * m + j;
    S = n * m + 1 , T = S + 1;
}

inline void ins(int u , int v , int c) {
    to[++ ett] = v , nxt[ett] = head[u] , cap[ett] = c , head[u] = ett;
    to[++ ett] = u , nxt[ett] = head[v] , cap[ett] = 0 , head[v] = ett;
}

inline void ins2(int u , int v , int w) { ins(u , v , w) , ins(v , u , w); }

inline bool bfs() {
    rep (i , 1 , T) dis[i] = 0;
    dis[S] = 1 , Q.push(S);
    while (!Q.empty()) {
        int u = Q.front() ; Q.pop();
        fore (i , u) if (cap[i] > flow[i]) {
            int v = to[i];
            if (!dis[v]) {
                dis[v] = dis[u] + 1;
                Q.push(v);
            }
        }
    }
    return dis[T] > 0;
}

int dfs(int u , int a) {
    if (u == T || !a) return a;
    int ret = 0 , f;
    for (int&i = cur[u] ; i ; i = nxt[i]) {
        int v = to[i];
        if (dis[v] == dis[u] + 1 && (f = dfs(v , std::min(a , cap[i] - flow[i])))) {
            flow[i] += f , flow[i ^ 1] -= f , a -= f , ret += f;
            if (!a) break;
        }
    }
    return ret;
}

int max_flow() {
    int ret = 0;
    while (bfs()) {
        rep (i , 1 , T) cur[i] = head[i];
        ret += dfs(S , inf);
    }
    return ret;
}

#define AE(p,q) ins2(id[i][j] , id[p][q] , x)

void solve() {
    init_id();
    forM (n - 1 , m) {
        int x = rd() ; ans += x;
        a[i][j] += x , a[i + 1][j] += x;
        AE(i + 1 , j);
    }
    forM (n - 1 , m) {
        int x = rd() ; ans += x;
        b[i][j] += x , b[i + 1][j] += x;
        AE(i + 1 , j);
    }
    forM (n , m - 1) {
        int x = rd() ; ans += x;
        a[i][j] += x , a[i][j + 1] += x;
        AE(i , j + 1);
    }
    forM (n , m - 1) {
        int x = rd() ; ans += x;
        b[i][j] += x , b[i][j + 1] += x;
        AE(i , j + 1);
    }
    forM (n , m) ins(S , id[i][j] , a[i][j]) , ins(id[i][j] , T , b[i][j]);
    ans -= max_flow() >> 1;
    printf("%d\n" , ans);
}

int main() {
    #ifndef ONLINE_JUDGE
        freopen("data.txt" , "r" , stdin);
    #endif
    input();
    solve();
    return 0;
}