https://www.luogu.com.cn/problem/P3254
https://www.acwing.com/problem/content/2181/
网络流建模,同时求出最大流的一个可行流
建模如下
求可行流的方法:遍历左边的所有节点,在残留网络上跑满了流的边即为一组解
#include <bits/stdc++.h>
using namespace std;
const int N = 430, M = (N + 150 * 270) * 2, INF = 1e8;
int n, m, S, T;
int h[N], e[M], f[M], ne[M], idx;
//q是队列,d是分层路,cur是当前弧优化
int q[N], d[N], cur[N];
void add(int a, int b, int c) {
e[idx] = b, f[idx] = c, ne[idx] = h[a], h[a] = idx++;
e[idx] = a, f[idx] = 0, ne[idx] = h[b], h[b] = idx++;
}
bool bfs() {
int hh = 0, tt = 0;
memset(d, -1, sizeof d);
q[0] = S, d[S] = 0, cur[S] = h[S];
while (hh <= tt) {
int t = q[hh++];
for (int i = h[t]; ~i; i = ne[i]) {
int ver = e[i];
//如果这个点没有搜过并且流量大于0
if (d[ver] == -1 && f[i]) {
d[ver] = d[t] + 1;
cur[ver] = h[ver];
if (ver == T) return true;
q[++tt] = ver;
}
}
}
return false;
}
int find(int u, int limit) {
if (u == T) return limit;
int flow = 0;
//从当前没有满的路径开始搜
for (int i = cur[u]; ~i && flow < limit; i = ne[i]) {
cur[u] = i; //当前弧优化
int ver = e[i];
if (d[ver] == d[u] + 1 && f[i]) {
int t = find(ver, min(f[i], limit - flow));
//从这个点出发是搜不到路径的,就删除这个点
if (!t) d[ver] = -1;
f[i] -= t, f[i ^ 1] += t, flow += t;
}
}
return flow;
}
int dinic() {
int r = 0, flow;
while (bfs()) {
while (flow = find(S, INF)) r += flow;
}
return r;
}
int main() {
scanf("%d%d", &m, &n);
memset(h, -1, sizeof h);
S = 0, T = m + n + 1;
int sum = 0;
for (int i = 1; i <= m; i++) {
int f;
scanf("%d", &f);
sum += f;
add(0, i, f);
}
for (int i = 1; i <= n; i++) {
int f;
scanf("%d", &f);
add(m + i, T, f);
}
for (int i = 1; i <= m; i++) {
for (int j = m + 1; j <= m + n; j++) add(i, j, 1);
}
//printf("%d\n", dinic());
int maxFlow = dinic();
if (maxFlow != sum) puts("0");
else {
puts("1");
for (int i = 1; i <= m; i++) {
for (int j = h[i]; ~j; j = ne[j]) {
if (!f[j]) printf("%d ", e[j] - m);
}
puts("");
}
}
return 0;
}