【题解】网络流24题之飞行员配对方案问题

传送门

思路剖析

明显的二分图匹配嘛。。。这看不出来就先去了解了解二分图吧。
说了是网络流24题了，那我们就要用网络流AC此题。

图论建模

给你一个二分图，就是一个无源无汇的图。我们建立一个原点s和一个汇点t，我们对于原图G中的任意一条边 <u,v> < u , v > <script type="math/tex" id="MathJax-Element-1"> </script>，其中u在X部中，v在Y部中（X部和Y部是二分图的两个点集，每条边的一个点在X中，另一边在Y中）， 我们就可以添加一条 <s,u> < s , u > <script type="math/tex" id="MathJax-Element-2"> </script>的边，容量设为1，再添加一条 <u,v> < u , v > <script type="math/tex" id="MathJax-Element-3"> </script>的边，容量设为1，再添加一条 <v,t> < v , t > <script type="math/tex" id="MathJax-Element-4"> </script>的边，容量也设为1，再从源点 $s$跑一遍网络最大流就可以了，最大流就是二分图的最大匹配数。正确性是显然的，画个图就明白了。

$code$

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
struct Graph {
    static const int infty = 0x7f7f7f7f;
    struct edgetype {
        int to, next, flow, cap;
    };
    int n, m, s, t;
    std::vector< edgetype > edge;
    std::vector< bool > visit;
    std::vector< int > head, d, cur;
    std::queue< int > Q;
    Graph() {
        n = m = 0;
        head.clear(); d.clear(); edge.clear(); visit.clear(); cur.clear();
    }
    Graph(int n, int m) {
        this->n = n; this->m = m;
        head.resize(n + 1); d.resize(n + 1); visit.resize(n + 1); cur.resize(n + 1);
        head.assign(n + 1, -1);
    }
    void AddEdge(int from, int to, int cap) {
        edge.push_back((edgetype){to, head[from], 0, cap});
        head[from] = edge.size() - 1;
        edge.push_back((edgetype){from, head[to], 0, 0});
        head[to] = edge.size() - 1;
    }
    bool BFS() {
        visit.assign(n + 1, false);
        d.assign(n + 1, 0);
        while (!Q.empty()) Q.pop();
        Q.push(s); visit[s] = true;
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            for (int i = head[u]; i != -1; i = edge[i].next) {
                int v = edge[i].to;
                if (!visit[v] && edge[i].flow < edge[i].cap) {
                    visit[v] = true;
                    d[v] = d[u] + 1;
                    Q.push(v);
                }
            }
        }
        return visit[t];
    }
    long long DFS(int u, int alpha) {
        if (u == t || alpha == 0) return alpha;
        long long flow = 0, f;
        for (int& i = cur[u]; i != -1; i = edge[i].next) {
            int v = edge[i].to;
            if (d[u] + 1 == d[v] && (f = DFS(v, min(alpha, edge[i].cap - edge[i].flow))) > 0) {
                edge[i].flow += f; edge[i ^ 1].flow -= f; flow += f; alpha -= f;
                if (alpha == 0) break;
            }
        }
        return flow;
    }
    long long Maxflow(int s, int t) {
        this->s = s; this->t = t;
        long long maxflow = 0;
        while (BFS()) {
            cur.assign(head.begin(), head.end());
            maxflow += DFS(s, infty);
        }
        return maxflow;
    }
    void PrintSolution() {
        for (int i = head[0]; i != -1; i = edge[i].next) {
            int u = edge[i].to;
            if (edge[i].flow == edge[i].cap) {
                printf("%d ", u);
                for (int j = head[u]; j != -1; j = edge[j].next) {
                    int v = edge[j].to;
                    if (edge[j].flow == edge[j].cap) {
                        printf("%d\n", v);
                        break;
                    }
                }
            }
        }
    }
};
Graph G;
int main() {
    int m, n, u, v;
    scanf("%d%d", &m, &n);
    G = Graph(n + 1, 0);
    for (int i = m; i >= 1; i--) G.AddEdge(0, i, 1);
    for (int i = m + 1; i <= n; i++) G.AddEdge(i, n + 1, 1);
    while (scanf("%d%d", &u, &v) != EOF && u != -1 && v != -1) 
        G.AddEdge(u, v, 1);
    printf("%lld\n", G.Maxflow(0, n + 1));
    G.PrintSolution();
    return 0;
}