hdu1151 二分图匹配最短路径覆盖

二分图匹配的最短路径覆盖

intersections ：交叉点

paratroopers ：伞兵

#include <iostream>
#include <cstdio>
#include <string.h>

using namespace std;

const int MAXN = 120 + 10;
int n, m;

struct Edge
{
    int v, next;
}edge[MAXN * MAXN];

int head[MAXN], e, match[MAXN];
bool vis[MAXN];

void add(int u, int v)
{
    edge[e].v = v;
    edge[e].next = head[u];
    head[u] = e++;
}

void init()
{
    e = 0;
    memset(head, -1, sizeof(head));
    memset(match, -1, sizeof(match));
}

bool dfs(int u)
{
    for (int i = head[u]; i != -1; i = edge[i].next)
    {
        int v = edge[i].v;

        if (!vis[v])
        {
            vis[v] = true;

            if (match[v] == -1 || dfs(match[v]))
            {
                match[v] = u;
                return true;
            }
        }
    }

    return false;
}

void solve()
{
    int ans = 0;

    for (int i = 1; i <= n; i++)
    {
        memset(vis, false, sizeof(vis));

        if (dfs(i))
        {
            ans++;
        }
    }

    cout << n - ans << endl;
}

void input()
{
    int t, u, v;

    cin >> t;

    while (t--)
    {
        cin >> n >> m;

        init();

        for (int i = 0; i < m; i++)
        {
            scanf("%d %d", &u, &v);
            add(u, v);
        }

        solve();
    }
}

int main()
{
    input();
    return 0;
}