二分图_HDU_1054

/*
hdu1054_最小点覆盖 = 最大匹配
*/
#include<iostream>
#include<cstdio>
#include<cstring>
const int maxn = 1505;
using namespace std;
struct node
{
    int u, v, next;
};
node e[maxn*1000];
int head[maxn],tot;
int link[maxn],vis[maxn];
void init()
{
    memset(link, -1, sizeof(link));
    memset(head, -1, sizeof(head));
    tot = 0;
}
void add(int u, int v)
{
    e[tot].u = u;
    e[tot].v = v;
    e[tot].next = head[u];
    head[u] = tot++;
}
int can(int u)
{
    for(int i = head[u]; i != -1; i = e[i].next)
    {
        int v = e[i].v;
        if(!vis[v])
        {
            vis[v] = 1;
            if(link[v] == -1 || can(link[v]))
            {
                link[v] = u;
                link[u] = v;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    //freopen("input.txt","r",stdin);
    int n,u,v,x;
    while(scanf("%d",&n) != EOF)
    {
        init();
        for(int i = 0; i < n; i++)
        {
            scanf("%d:(%d)",&u,&x);
            while(x--)
            {
                scanf("%d",&v);
                add(u,v);
                add(v,u);
            }
        }
        int ret = 0;
        for(int i = 0; i < n; i++)
        {
            memset(vis, 0, sizeof(vis));
            if(link[i]==-1&&can(i))
                ret++;
        }
        printf("%d\n",ret);
    }
    return 0;
}