7/20 每日打卡记录 二分匹配算法（匈牙利算法）

这个算法的名字还挺高大上啊，其实也是蛮简单的，就是dfs的应用，而且模板还挺固定。

二分图的最大匹配数=二分图的最小顶点覆盖数

DAG图的最小路径覆盖=节点数-二分图的最大匹配数（用DAG图拆点构建二分图）

二分图的最大独立集=节点数-最大匹配数

例题

hdu 1083 二分图的最大匹配数

// Problem: Courses
// Contest: HDOJ
// URL: http://acm.hdu.edu.cn/showproblem.php?pid=1083
// Memory Limit: 65 MB
// Time Limit: 20000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;
int a[105][305];
int vis[305];
int linker[305];
int p, n;
bool dfs(int x)
{
    for (int i = 1; i <= n; i++)
    {
        if (a[x][i] && !vis[i])
        {
            vis[i] = 1;
            if (linker[i] == -1 || dfs(linker[i]))
            {
                linker[i] = x;
                return true;
            }
        }
    }
    return false;
}
int hungary()
{
    int count = 0;
    memset(linker, -1, sizeof(linker));
    for (int i = 1; i <= p; i++)
    {
        memset(vis, 0, sizeof(vis));
        if (dfs(i))
        {
            count++;
        }
    }
    return count;
}
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        memset(a, 0, sizeof(a));
        cin >> p >> n;
        for (int i = 1; i <= p; i++)
        {
            int cnt;
            cin >> cnt;
            while (cnt--)
            {
                int x;
                cin >> x;
                a[i][x] = 1;
            }
        }
        if (p == hungary())
            puts("YES");
        else
            puts("NO");
    }
}

hdu 1151 DAG图的最小路径覆盖数

// Problem: Air Raid
// Contest: HDOJ
// URL: http://acm.hdu.edu.cn/showproblem.php?pid=1151
// Memory Limit: 65 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;
const int N = 125;
int a[N][N];
int linker[N];
int vis[N];
int n;
int m;
bool dfs(int x)
{
    for (int i = 1; i <= n; i++)
    {
        if (a[x][i] && !vis[i])
        {
            vis[i] = 1;
            if (linker[i] == -1 || dfs(linker[i]))
            {
                linker[i] = x;
                return true;
            }
        }
    }
    return false;
}
int hungary()
{
    int cnt = 0;
    memset(linker, -1, sizeof(linker));
    for (int i = 1; i <= n; i++)
    {
        memset(vis, 0, sizeof(vis));
        if (dfs(i))
        {
            cnt++;
        }
    }
    return cnt;
}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        memset(a, 0, sizeof(a));
        scanf("%d", &n);
        scanf("%d", &m);
        for (int i = 1; i <= m; i++)
        {
            int x, y;
            scanf("%d %d", &x, &y);
            a[x][y] = 1;
        }
        printf("%d\n", n - hungary());
    }
}

hdu 1150 二分图的最小顶点覆盖数

// Problem: Machine Schedule
// Contest: HDOJ
// URL: http://acm.hdu.edu.cn/showproblem.php?pid=1150
// Memory Limit: 65 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;
const int Max = 105;
int g[Max][Max];
int linker[Max];
int used[Max];
int n, m;
int k;
bool dfs(int l)
{
    for (int i = 0; i < m; i++)
    {
        if (g[l][i] && !used[i])
        {
            used[i] = 1;
            if (linker[i] == -1 || dfs(linker[i]))
            {
                linker[i] = l;
                return true;
            }
        }
    }
    return false;
}
int hungary()
{
    int cnt = 0;
    memset(linker, -1, sizeof(linker));
    for (int i = 0; i < n; i++)
    {
        memset(used, 0, sizeof(used));
        if (dfs(i))
            cnt++; 
    }
    return cnt;
}
int main()
{
    while (cin >> n >> m, n)
    {
        memset(g, 0, sizeof(g));
        cin >> k;
        for (int i = 0; i < k; i++)
        {
            int temp;
            cin >> temp;
            int x, y;
            cin >> x >> y;
            if (x != 0 && y != 0)
            {
                g[x][y] = 1;
            }
        }
        printf("%d\n", hungary());
    }
}

hdu  2063 二分图的最大匹配数

// Problem: 过山车
// Contest: HDOJ
// URL: http://acm.hdu.edu.cn/showproblem.php?pid=2063
// Memory Limit: 32 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;
const int N = 505;
int a[N][N];
int k, m, n;
int vis[N];
int linker[N];

bool dfs(int x) //判断x能否配对
{
    for (int i = 1; i <= n; i++)
    {
        if (a[x][i] && !vis[i])
        {
            vis[i] = 1;
            if (linker[i] == -1 || dfs(linker[i]))
            {
                linker[i] = x;
                return true;
            }
        }
    }
    return false;
}
int hungary()
{
    int step = 0;
    memset(linker, -1, sizeof(linker));
    for (int i = 1; i <= m; i++)
    {
        memset(vis, 0, sizeof(vis));
        if (dfs(i))
        {
            step++;
        }
    }
    return step;
}
int main()
{
    while (cin >> k >> m >> n, k)
    {
        memset(a, 0, sizeof(a));
        for (int i = 1; i <= k; i++)
        {
            int x, y;
            cin >> x >> y;
            a[x][y] = 1;
        }

        printf("%d\n", hungary());
    }
}