【题目链接】
【思路要点】
- 题目中的一类增益可以归结为“若某些元素的选取状态为0/1,那么额外获得收益”,考虑最大权闭合子图问题。
- 对于一个同学,如果我们默认“选取”的意义是选择文科,“不取”的意义是选择理科,那么其“选取”得到的真正的权值为\(V_{文科}-V_{理科}\)。
- 考虑增益条件,一个增益条件可以拆分为两个形如“若某些元素选取,那么额外获得收益”和“若某些元素不取,那么额外获得收益”的条件。
- 换而言之,即“为了额外获得收益,某些元素必须选取”和“若选取了某些元素中的任意一个,那么将失去额外收益”。
- 将问题如此转化后,解最大权闭合子图问题即可。
- 时间复杂度\(O(Dinic(N*M,5*N*M))\)。
【代码】
#include<bits/stdc++.h> using namespace std; const int MAXN = 105; const int MAXP = 50005; const int INF = 2e9; template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = -f; for (; isdigit(c); c = getchar()) x = x * 10 + c - '0'; x *= f; } template <typename T> void write(T x) { if (x < 0) x = -x, putchar('-'); if (x > 9) write(x / 10); putchar(x % 10 + '0'); } template <typename T> void writeln(T x) { write(x); puts(""); } struct edge {int dest, flow; unsigned home; }; int n, m, s, t, tot; unsigned curr[MAXP]; vector <edge> a[MAXP]; int point[MAXN][MAXN], dist[MAXP]; int value[MAXN][MAXN], vblue[MAXN][MAXN]; int dinic(int pos, int limit) { if (pos == t) return limit; int used = 0, tmp; for (unsigned &i = curr[pos]; i < a[pos].size(); i++) { if (a[pos][i].flow && dist[pos] + 1 == dist[a[pos][i].dest] && (tmp = dinic(a[pos][i].dest, min(limit - used, a[pos][i].flow)))) { used += tmp; a[pos][i].flow -= tmp; a[a[pos][i].dest][a[pos][i].home].flow += tmp; } if (used == limit) return used; } return used; } bool bfs() { static int q[MAXP]; static int l = 0, r = -1; for (int i = 0; i <= r; i++) dist[q[i]] = 0; l = 0, r = -1; q[++r] = s; dist[s] = 1; while (l <= r) { int tmp = q[l++]; for (unsigned i = 0; i < a[tmp].size(); i++) if (a[tmp][i].flow && dist[a[tmp][i].dest] == 0) { dist[a[tmp][i].dest] = dist[tmp] + 1; q[++r] = a[tmp][i].dest; } } return dist[t] != 0; } void addedge(int s, int t, int flow) { a[s].push_back((edge) {t, flow, a[t].size()}); a[t].push_back((edge) {s, 0, a[s].size() - 1}); } int main() { read(n), read(m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) read(value[i][j]); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) read(vblue[i][j]); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) point[i][j] = ++tot; s = 0, t = MAXP - 1; int ans = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (value[i][j] > vblue[i][j]) ans += value[i][j], addedge(s, point[i][j], value[i][j] - vblue[i][j]); else ans += vblue[i][j], addedge(point[i][j], t, vblue[i][j] - value[i][j]); for (int i = 1; i <= n - 1; i++) for (int j = 1; j <= m; j++) { int x; read(x); ans += x; addedge(s, ++tot, x); addedge(tot, point[i][j], INF); addedge(tot, point[i + 1][j], INF); } for (int i = 1; i <= n - 1; i++) for (int j = 1; j <= m; j++) { int x; read(x); ans += x; addedge(++tot, t, x); addedge(point[i][j], tot, INF); addedge(point[i + 1][j], tot, INF); } for (int i = 1; i <= n; i++) for (int j = 1; j <= m - 1; j++) { int x; read(x); ans += x; addedge(s, ++tot, x); addedge(tot, point[i][j], INF); addedge(tot, point[i][j + 1], INF); } for (int i = 1; i <= n; i++) for (int j = 1; j <= m - 1; j++) { int x; read(x); ans += x; addedge(++tot, t, x); addedge(point[i][j], tot, INF); addedge(point[i][j + 1], tot, INF); } while (bfs()) { memset(curr, 0, sizeof(curr)); ans -= dinic(s, INF); } printf("%d\n", ans); return 0; }