网络流24题-3.最小路径覆盖问题

链接
建图方式：

对于每个点拆点拆到两侧，拆成二分图，s对所有左点连1的边，所有右点连到t为1的边，所有的边$（u，v）$连边成为$(u,v+n,1)$
比较有意思的是打印方案的方法，利用反向边$w[i]==1$去从右往左递归，剩下一些单点的扫一遍就有了。

#include <bits/stdc++.h>

#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 550;
const int maxm = maxn * 50;
int n, m;
int to[maxm], nxt[maxm], w[maxm];
int fst[maxn], cnt, cur[maxn], vis[maxn];
int s, t, d[maxn];

void init() {
    memset(fst, -1, sizeof(fst));
    cnt = 0;
}

void addedge(int u, int v, int val) {
    to[cnt] = v;
    w[cnt] = val;
    nxt[cnt] = fst[u];
    fst[u] = cnt++;

    to[cnt] = u;
    w[cnt] = 0;
    nxt[cnt] = fst[v];
    fst[v] = cnt++;
}

int bfs() {
    queue<int> Q;
    memset(d, 0, sizeof(d));
    d[s] = 1;
    Q.push(s);
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();
        for (int i = fst[u]; ~i; i = nxt[i]) {//因为初始是-1
            int v = to[i];
            if (w[i] > 0 && d[v] == 0) {
                d[v] = d[u] + 1;
                if (v == t) return 1;
                Q.push(v);
            }

        }
    }
    return d[t] != 0;
}

int dfs(int u, int flow) {
    if (u == t)
        return flow;
    int ans = 0, x = 0;
    for (int i = cur[u]; ~i; i = nxt[i]) {
        int v = to[i];
        if (w[i] > 0 && d[v] == d[u] + 1) {
            x = dfs(v, min(flow - ans, w[i]));
            w[i] -= x;
            w[i ^ 1] += x;
            if (w[i]) cur[u] = i;
            ans += x;
            if (ans == flow) return flow;
        }
    }
    if (ans == 0)d[u] = 0;
    return ans;
}

int dinic(int n) {
    int ans = 0;

    while (bfs()) {
        for (int i = 0; i < n; i++)
            cur[i] = fst[i];
        ans += dfs(s, INF);
    }
    return ans;
}

void go(int x, int &f) {
    int loc = x + n;
    vis[x] = 1;
    for (int i = fst[loc]; ~i; i = nxt[i])
        if (w[i] == 1 && to[i] != t)
            go(to[i], f);
    if (f == 1) f = 0;
    else cout << ' ';
    cout << x;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    init();
    s = 0;
    t = 2 * n + 1;
    for (int i = 1; i <= n; i++) {
        addedge(s, i, 1);
        addedge(i + n, t, 1);
    }
    int u, v;
    for (int i = 1; i <= m; i++) {
        cin >> u >> v;
        addedge(u, v + n, 1);
    }
    int ans = n - dinic(t);
    for (int i = fst[t]; ~i; i = nxt[i]) {
        if (w[i] == 1 && !vis[to[i] - n]) {
            int f = 1;
            go(to[i] - n, f);
            cout << endl;
        }
    }
    for (int i = 1; i <= n; i++)
        if (!vis[i])
            cout << i << endl;
    cout << ans << endl;

}