【题目链接】
【思路要点】
- 直接运行\(Dinic\)算法即可,注意内存限制。
- 本题使用\(std::vector\)离奇\(Runtime Error\),令笔者不解。
- 本题也可以将最大流问题对偶为最小割,使用最短路算法求解,复杂度为\(O(N*MLogN*M)\)。
【代码】
#include<bits/stdc++.h> using namespace std; #define MAXN 1000005 #define MAXE 6000005 #define MAXM 1005 #define INF 1e9 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; } struct edge {int dest, flow, nxt, home; }; int n, m, s, t, k; int tot, point[MAXM][MAXM], dist[MAXN], curr[MAXN]; int heada[MAXN], tota; edge a[MAXE]; bool bfs() { memset(dist, 0, sizeof(dist)); static int q[MAXN]; int l = 0, r = 0; dist[s] = 1, q[0] = s; while (l <= r) { int tmp = q[l++]; for (unsigned i = heada[tmp]; i; i = a[i].nxt) if (a[i].flow != 0 && dist[a[i].dest] == 0) { dist[a[i].dest] = dist[tmp] + 1; q[++r] = a[i].dest; } } return dist[t] != 0; } int dinic(int pos, int limit) { if (pos == t) return limit; int used = 0, tmp; for (int &i = curr[pos]; i; i = a[i].nxt) if (a[i].flow != 0 && dist[pos] + 1 == dist[a[i].dest] && (tmp = dinic(a[i].dest, min(limit - used, a[i].flow)))) { used += tmp; a[i].flow -= tmp; a[a[i].home].flow += tmp; if (used == limit) return limit; } return used; } void addedge(int s, int t, int flow) { a[++tota] = (edge) {t, flow, heada[s], tota + 1}; heada[s] = tota; a[++tota] = (edge) {s, flow, heada[t], tota - 1}; heada[t] = tota; } int main() { read(n), read(m); if (n * m == 1) { printf("0\n"); return 0; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) point[i][j] = ++tot; for (int i = 1; i <= n; i++) for (int j = 1; j < m; j++) { int x; read(x); addedge(point[i][j], point[i][j + 1], x); } for (int i = 1; i < n; i++) for (int j = 1; j <= m; j++) { int x; read(x); addedge(point[i][j], point[i + 1][j], x); } for (int i = 1; i < n; i++) for (int j = 1; j < m; j++) { int x; read(x); addedge(point[i][j], point[i + 1][j + 1], x); } int ans = 0; s = 1; t = tot; while (bfs()) { for (int i = 1; i <= tot; i++) curr[i] = heada[i]; ans += dinic(s, INF); } printf("%d\n", ans); return 0; }