hdu1068 Girls and Boys 基础匈牙利

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;

#define MAXN 500
int map[MAXN][MAXN];
int mark[MAXN];
int pipei[MAXN];
int n;

int search(int a)
{
    for (int i = 0; i < n; i++)
    {
        if (map[a][i] && !mark[i])
        {
            mark[i] = 1;
            if (pipei[i] == -1 || search(pipei[i]))
            {
                pipei[i] = a;
                return 1;
            }
        }
    }

    return 0;
}

int main()
{
    while (~scanf("%d",&n))
    {
        memset(map, 0, sizeof(map));
        int m;
        for (int i = 0; i <n; i++)
        {
            int y;
            scanf("%d: (%d)", &m, &y);
            for (int i = 0; i < y; i++)
            {
                int a;
                scanf("%d", &a);
                map[m][a] = 1;
            }
        }

        memset(pipei, -1, sizeof(pipei));
        int ans1 = 0;
        for (int i = 0; i < n; i++)
        {
            memset(mark, 0, sizeof(mark));
            if (search(i))
                ans1++;
        }
        printf("%d
", n - ans1/2);
    }
    //system("pause");
    return 0;
}