hdu 1068 Girls and Boys

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;

#define N 1005

int link[N], vis[N];
vector<int> v[N];
int n;

int dfs( int u )
{
    for( int i = 0; i < v[u].size(); i++ )
    {
        int to = v[u][i];
        if( !vis[to] )
        {
            vis[to] = 1;
            if( link[to] == -1 || dfs( link[to] ) )
            {
                link[to] = u;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    while(~scanf("%d", &n))
    {
        for( int i = 0; i < n; i ++ )
            v[i].clear();
        int x;
        for(int i = 0; i < n; i ++)
        {
            scanf("%d: (%d)", &i, &x);
            while(x--)
            {
                int z;
                scanf("%d", &z);
                v[i].push_back(z);
            }
        }
        memset(link, -1, sizeof(link));
        int ans = 0;
        for( int i = 0; i < n; i++ )
        {
            memset(vis, 0, sizeof(vis));
            ans += dfs(i);
        }
        printf("%d\n", n - ans / 2);
    }
    return 0;
}