【题目链接】
【思路要点】
- 矩阵可以看做一张二分图，其中行为左侧点，列为右侧点，矩阵中的元素为边。
- 直观地考虑，我们发现本题可以用有上下界的网络流来实现。
- 由源点向行\(i\)连边，下界为\(L_{i}\)，上界为\(+\infty\)。
- 由列\(i\)向汇点连边，下界为\(C_{i}\)，上界为\(+\infty\)。
- 若\((i,j)\)不是障碍，由行\(i\)向列\(j\)连边，下界为0，上界为1。
- 在得到的图上运行有源有汇最小流，若无可行流，则问题无解，否则最小流即为答案，时间复杂度\(O(Dinic(N+M,N*M))\)。
- 我们也可以进一步地分析问题。首先，无解是容易判断的。
- 若问题有解，那么一个方案中的每一个士兵可能只对行有贡献（其所在列已经不需要士兵），可能对只列有贡献（其所在行已经不需要士兵），我们称这样的士兵贡献为1。
- 也有的士兵对行和列都有贡献，我们称这样的士兵贡献为2。显然最优解不包含贡献为0的士兵。
- 那么我们希望贡献为2的士兵尽可能地多，同时由于保证了问题有解，我们一定可以在此基础上安排若干个贡献为1的士兵来解决问题。
- 因此，由源点向行\(i\)连边，容量为\(L_{i}\)；由列\(i\)向汇点连边，容量为\(C_{i}\)；若\((i,j)\)不是障碍，由行\(i\)向列\(j\)连边，容量为1。
- 在得到的图中运行最大流，求得贡献为2的士兵的个数，再计算士兵总数即可。
- 时间复杂度\(O(Dinic(N+M,N*M))\)，比前文的算法实际稍快一些。
【代码】
- 有源有汇最小流
/*Minimumflow with Lower Bounds Version*/ #include<bits/stdc++.h> using namespace std; const int MAXN = 105; const int MAXP = 505; const int 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; } 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, k, s, t, ts, tt, tot; int dist[MAXP]; unsigned curr[MAXP]; vector <edge> a[MAXP]; bool mark[MAXN][MAXN]; int limn[MAXN], limm[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), read(k); for (int i = 1; i <= n; i++) read(limn[i]); for (int i = 1; i <= m; i++) read(limm[i]); for (int i = 1; i <= k; i++) { int x, y; read(x), read(y); mark[x][y] = true; } s = 0, t = n + m + 3; ts = n + m + 1, tt = ts + 1; int goal = 0, tmp = 0, ans = 0; for (int i = 1; i <= n; i++) { addedge(ts, i, INF); addedge(s, i, limn[i]); addedge(ts, t, limn[i]); goal += limn[i]; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (!mark[i][j]) addedge(i, j + n, 1); for (int i = 1; i <= m; i++) { addedge(i + n, tt, INF); addedge(s, tt, limm[i]); addedge(i + n, t, limm[i]); goal += limm[i]; } while (bfs()) { memset(curr, 0, sizeof(curr)); tmp += dinic(s, INF); } addedge(tt, ts, INF); while (bfs()) { memset(curr, 0, sizeof(curr)); ans += dinic(s, INF); } if (ans + tmp == goal) printf("%d\n", ans); else printf("JIONG\n"); return 0; }- 最大流
/*Maximumflow Version*/ #include<bits/stdc++.h> using namespace std; const int MAXN = 105; const int MAXP = 505; const int 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; } 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, k, s, t, tot; int dist[MAXP]; unsigned curr[MAXP]; vector <edge> a[MAXP]; bool mark[MAXN][MAXN]; int limn[MAXN], limm[MAXN]; int lftn[MAXN], lftm[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), read(k); int ans = 0; for (int i = 1; i <= n; i++) read(limn[i]), ans += limn[i]; for (int i = 1; i <= m; i++) read(limm[i]), ans += limm[i]; for (int i = 1; i <= n; i++) lftn[i] = m; for (int i = 1; i <= m; i++) lftm[i] = n; for (int i = 1; i <= k; i++) { int x, y; read(x), read(y); mark[x][y] = true; lftn[x]--; lftm[y]--; } for (int i = 1; i <= n; i++) if (lftn[i] < limn[i]) { printf("JIONG\n"); return 0; } for (int i = 1; i <= m; i++) if (lftm[i] < limm[i]) { printf("JIONG\n"); return 0; } s = 0, t = n + m + 1; for (int i = 1; i <= n; i++) addedge(s, i, limn[i]); for (int i = 1; i <= m; i++) addedge(i + n, t, limm[i]); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (!mark[i][j]) addedge(i, j + n, 1); while (bfs()) { memset(curr, 0, sizeof(curr)); ans -= dinic(s, INF); } printf("%d\n", ans); return 0; }
1862
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
