洛谷 P2756 飞行员配对方案问题（二分图最大匹配）网络流24题（4）

洛谷 P2756 飞行员配对方案问题（二分图最大匹配）网络流24题（4）

链接
题意：给一个二分图，输出最大匹配的方案
思路：求个最大流记录一下路径然后遍历左边的祖先

#include<bits/stdc++.h>
using namespace std;
const int N = 1e3+10, INF = 0x3f3f3f3f;
int head[N], idx = 1;
struct Edge{int to, nxt, d;}e[1000010];
void add(int u, int v, int d)
{
    e[++idx].to = v, e[idx].nxt = head[u], e[idx].d = d, head[u] = idx;
    e[++idx].to = u, e[idx].nxt = head[v], e[idx].d = 0, head[v] = idx;
}
int dep[N], gap[N], pre[N], n, m, maxflow, s, t, cur[N];
void bfs()
{
    memset(dep, -1, sizeof (dep));
    dep[t] = 0;
    queue<int> Q;
    Q.push(t);
    gap[0] = 1;
    while (!Q.empty()) {
        int u = Q.front(); Q.pop();
        for (int i = head[u]; i; i = e[i].nxt) {
            int v = e[i].to;
            if (dep[v] != -1) continue;
            dep[v] = dep[u] + 1;
            gap[dep[v]]++;
            Q.push(v);
        }
    }
}

int dfs(int u, int flow)
{
    if (u == t) {
        maxflow += flow;
        return flow;
    }
    int used = 0;
    for (int &i = cur[u]; i; i = e[i].nxt) {
        int v = e[i].to, d = e[i].d;
        if (d && dep[v] + 1 == dep[u]) {
            int mi = dfs(v, min(flow - used, d));
            if (mi) {
                e[i].d -= mi;
                e[i ^ 1].d += mi;
                pre[v] = u;
                used += mi;
            }if (used == flow) return flow;
        }
    }
    gap[dep[u]]--;
    if (gap[dep[u]] == 0) dep[s] = N + 1;
    dep[u]++;
    gap[dep[u]]++;
    return used;
}

int ISAP()
{
    maxflow = 0;
    bfs();
    while (dep[s] < N) {memcpy(cur, head, sizeof(head)); dfs(s, INF);}
    return maxflow;
}

int main()
{
    cin >> m >> n;
    int u, v;
    t = n + 10;
    for (int i = 1; i <= m; i++) add(s, i, 1);
    for (int i = m + 1; i <= n; i++) add(i, t, 1);
    while (cin >> u >> v) {
        if (u == -1) break;
        if (u > v) swap(u, v);
        add(u, v, 1);
    }
    cout << ISAP() << endl;
    int cnt = 0;
    for (int i = m + 1; i <= n; i++) {
        if (pre[i]) {cout << pre[i] << ' ' << i << endl;cnt++;}
    }
    return 0;
}