题目
解题思路
首先,考虑如果求的是最小的收益。 那么是一个非常明显的最小割模型。我们将源点连向每个点
(
i
,
j
)
(i,j)
(i,j),流量是
a
[
i
]
[
j
]
a[i][j]
a[i][j]。每个点
(
i
,
j
)
(i,j)
(i,j)向汇点连边,流量是
b
[
i
]
[
j
]
b[i][j]
b[i][j]。将每个点向相邻点连容量容量为
c
c
c的边。如果相邻点建立的不同,则必定割之间相连的边。如此能够用最小割解决。
考虑最大的收益。 我们将所有的权值加起来,如果能建立最小割模型,用总权值减去最小割即可。但是难点在于构建相同建筑时,需要切割代价。
可以发现图是二分图。 每个点只向相连点连边,显然是个二分图。我们将图黑白染色,黑点的源汇边交换,即可保证如果相邻点选择相同建筑时会割掉一个权值。
跑最大流模型即可解决。 有定理证明,图的最小割等于最大流。
代码
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
void read(int &x) {
x = 0; char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
}
typedef long long ll;
const int N = 1e6 + 10;
const int M = 1010;
const ll INF = 1e16;
struct edge {
int to, rev;
ll cap;
edge() {}
edge(int to, ll cap, int rev) :to(to), cap(cap), rev(rev) {}
};
vector<edge> G[N];
int iter[N], level[N];
void addedge(int from, int to, ll 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));
level[s] = 0;
queue<int> Q;
Q.push(s);
while (!Q.empty()) {
int u = Q.front(); Q.pop();
for (edge e : G[u]) {
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[u] + 1;
Q.push(e.to);
}
}
}
}
ll dfs(int u, int t, ll f) {
if (u == t) return f;
for (int &i = iter[u]; i < G[u].size(); i++) {
edge &e = G[u][i];
if (e.cap > 0 && level[e.to] > level[u]) {
ll d = dfs(e.to, t, min(e.cap, f));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
ll max_flow(int s, int t) {
ll ans = 0, f;
while (true) {
bfs(s);
if (level[t] < 0) return ans;
memset(iter, 0, sizeof(iter));
while ((f = dfs(s, t, INF)) > 0)
ans += f;
}
}
int n, m, tot;
int aa[M][M], bb[M][M], cc[M][M], idx[M][M];
int main() {
//freopen("0.txt", "r", stdin);
read(n); read(m);
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) read(aa[i][j]), idx[i][j] = ++tot;
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) read(bb[i][j]);
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) read(cc[i][j]);
ll S = ++tot, T = ++tot, res = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
res += aa[i][j] + bb[i][j];
if ((i + j) % 2) {
addedge(S, idx[i][j], aa[i][j]);
addedge(idx[i][j], T, bb[i][j]);
}
else {
addedge(S, idx[i][j], bb[i][j]);
addedge(idx[i][j], T, aa[i][j]);
}
if (i - 1 >= 1) {
addedge(idx[i][j], idx[i - 1][j], cc[i][j]);
addedge(idx[i - 1][j], idx[i][j], cc[i][j]);
res += cc[i][j];
}
if (i + 1 <= n) {
addedge(idx[i][j], idx[i + 1][j], cc[i][j]);
addedge(idx[i + 1][j], idx[i][j], cc[i][j]);
res += cc[i][j];
}
if (j - 1 >= 1) {
addedge(idx[i][j], idx[i][j - 1], cc[i][j]);
addedge(idx[i][j - 1], idx[i][j], cc[i][j]);
res += cc[i][j];
}
if (j + 1 <= m) {
addedge(idx[i][j], idx[i][j + 1], cc[i][j]);
addedge(idx[i][j + 1], idx[i][j], cc[i][j]);
res += cc[i][j];
}
}
}
printf("%lld\n", res - max_flow(S, T));
return 0;
}