4167179_ac_125ms_964k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <string.h>

int map[201][201];
int lik[201], vis[201];

int g, b, m;

int find(int u)
{
    for (int i = 1; i <= b; i++)
    {
        if (!map[u][i] && !vis[i])
        {
            vis[i] = 1;
            if (!lik[i] || find(lik[i]))
            {
                lik[i] = u;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    int u, v, i;
    int ans, cas = 1;
    
    while (true)
    {
        scanf("%d%d%d", &g, &b, &m);
        if (!g)
        {
            break;
        }
        ans = g + b;
        memset(map, 0, sizeof map);
        while (m--)
        {
            scanf("%d%d", &u, &v);
            map[u][v] = 1;
        }
        memset(lik, 0, sizeof lik);
        for (i = 1; i <= g; i++)
        {
            memset(vis, 0, sizeof vis);
            ans -= find(i);
        }
        printf("Case %d: %d\n", cas++, ans);
    }
    return 0;
}