题目:
http://acm.hit.edu.cn/hoj/problem/view?id=2713
题意:
给出n*m的矩阵方格,每个方格都有一个价值c, 选取互不不相邻的一些点,求得到的最大的总价值。
思路:
最大点权独立集问题。转化成最小点权覆盖集。
将网格黑白涂黑,将s与每一个黑点相连,白点与t相连。黑点与其四周的白点相连,容量为INF,答案为Csum - 最小割。
因为黑点与白点的边都为INF,所以割中的边只可能与s相连或者与t相连,减去相连的点的最小流量,则得到不相连的点的最大流量。
AC.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, m;
int c[55][55], col[55][55];
int dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0};
struct edge {
int to, cap, rev;
edge(int tt, int cc, int rr) {
to = tt; cap = cc; rev = rr;
}
};
vector<edge> g[10000];
int level[10000];
int iter[10000];
void addedge(int from, int to, int cap)
{
g[from].push_back(edge(to, cap, g[to].size()));
g[to].push_back(edge(from, 0, g[from].size()-1));
}
void bfs(int s)
{
memset(level, -1, sizeof(level));
queue<int> que;
level[s] = 0;
que.push(s);
while(!que.empty()) {
int v = que.front(); que.pop();
for(int i = 0; i < g[v].size(); ++i) {
edge &e = g[v][i];
if(e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int dfs(int v, int t, int f)
{
if(v == t) return f;
for(int &i = iter[v]; i < g[v].size(); ++i) {
edge &e = g[v][i];
if(e.cap > 0 && level[v] < level[e.to]) {
int d = dfs(e.to, t, min(f, e.cap));
if(d > 0) {
e.cap -= d;
g[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t)
{
int flow = 0;
while(1) {
bfs(s);
if(level[t] < 0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while( (f = dfs(s, t, INF)) > 0) {
flow += f;
}
}
}
void build(int s, int t)
{
for(int i = s; i <= t; ++i) g[i].clear();
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(col[i][j] == 1) addedge(s, i*(n+m)+j, c[i][j]);
else addedge(i*(n+m)+j, t, c[i][j]);
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(col[i][j] == 1) {
for(int d = 0; d < 4; ++d) {
int x = i+dx[d], y = j+dy[d];
if(x < 1 || y < 1 || x > n || y > m) continue;
if(col[x][y] != 0) continue;
addedge(i*(n+m)+j, x*(m+n)+y, INF);
}
}
}
}
}
int main()
{
//freopen("in", "r", stdin);
int T;
scanf("%d", &T);
while(T--) {
int sum = 0;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
scanf("%d", &c[i][j]);
sum += c[i][j];
}
}
int r;
for(int i = 1; i <= n; ++i) {
r = i%2;
for(int j = 1; j <= m; ++j) {
col[i][j] = r;
r = 1 - r;
}
}
int s = 0, t = n*(n+m)+m+1;
build(s, t);
//printf("%d\n", sum);
int ans = sum - max_flow(s, t);
printf("%d\n", ans);
}
return 0;
}