P2756 飞行员配对方案问题（最大流）

容易看出题目是求一个最大匹配数目，可以建一个超级源点S和一个超级汇点T跑dinic，最后判一下边的剩余流量即可。

我是跑的网络流，匈牙利算法求一个二分图最大匹配数目也是可以的。

菜鸡只会做板子题。。。

// #pragma GCC optimize(2)
// #include <random>
// #include <windows.h>
// #include <ctime>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <bitset>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define IO                       \
    ios::sync_with_stdio(false); \
    // cout.tie(0);
#define lson(x) (x << 1)
#define rson(x) (x << 1 | 1)
using namespace std;
// int dis[8][2] = {0, 1, 1, 0, 0, -1, -1, 0, 1, -1, 1, 1, -1, 1, -1, -1};
typedef unsigned long long ULL;
typedef long long LL;
typedef pair<int, int> P;
const int maxn = 1e3 + 10;
const int maxm = 1e7 + 10;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1);
int dis[4][2] = {1, 0, 0, -1, 0, 1, -1, 0};
// int m[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

struct Edge
{
    int next, to;
    int cap;
} e[maxn << 2];
int head[maxn], dep[maxn];
int n, m, k, s, t;
void add(int u, int v, int cap)
{
    e[k].next = head[u];
    e[k].to = v;
    e[k].cap = cap;
    head[u] = k++;

    e[k].next = head[v];
    e[k].to = u;
    e[k].cap = 0;
    head[v] = k++;
}
bool BFS()
{
    memset(dep, 0, sizeof dep);
    dep[s] = 1;
    queue<int> q;
    q.push(s);
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for (int i = head[u]; i != -1; i = e[i].next)
        {
            int v = e[i].to;
            if (e[i].cap && dep[v] == 0)
            {
                dep[v] = dep[u] + 1;
                q.push(v);
            }
        }
    }
    if (dep[t] == 0)
        return false;
    return true;
}

int DFS(int u, int flow)
{
    if (u == t)
        return flow;
    int sum = 0;
    for (int i = head[u]; i != -1; i = e[i].next)
    {
        int v = e[i].to;
        if (dep[v] == dep[u] + 1 && e[i].cap > 0)
        {
            int f = DFS(v, min(e[i].cap, flow - sum));
            e[i].cap -= f;
            e[i ^ 1].cap += f;
            sum += f;
            if (sum == flow)
                return sum;
        }
    }
    return sum;
}
int main()
{
#ifdef WXY
    freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
#endif
    IO;
    int x, y;
    cin >> m >> n;
    s = 0, t = n + 2;
    memset(head, -1, sizeof head);
    while (cin >> x >> y)
    {
        if (x == -1 && y == -1)
            break;
        add(x, y, 1);
    }
    for (int i = 1; i <= m; i++)
        add(s, i, 1);
    for (int i = m + 1; i <= n; i++)
        add(i, t, 1);

    int ans = 0;

    while (BFS())
        ans += DFS(s, inf);

    cout << ans << "\n";
    for (int i = 1; i <= m; i++)
    {
        for (int j = head[i]; j != -1; j = e[j].next)
        {
            int v = e[j].to;
            if (e[j].cap == 0 && v != 0)
                cout << i << " " << v << endl;
        }
    }
    return 0;
}