hdu1068 Girls and Boys 二分匹配

#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
using namespace std;
#define maxn  500
int g[maxn][maxn];
int vis_x[maxn];
int vis_y[maxn];
int cx[maxn];
int cy[maxn];
int n;
int ans;
int path(int u)
{

vis_x[u]=1;
for(int v=0;v<n;v++)
{
if(vis_y[v]==0 && g[u][v]!=0)
{
vis_y[v]=1;

if(cy[v]==-1 || path(cy[v]))
{
cx[u]=v;
cy[v]=u;
return 1;
}
}
}
return 0;
}
void MaxMatch()
{
memset(cx,-1,sizeof(cx));
memset(cy,-1,sizeof(cy));

for(int i=0;i<n;i++)
{
if(cx[i]==-1)
{

memset(vis_x,0,sizeof(vis_x));
memset(vis_y,0,sizeof(vis_y));
ans+=path(i);
}
}
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
int id;
int num;
char c;
ans=0;
memset(g,0,sizeof(g));
for(int i=0;i<n;i++)
{
scanf("%d: (%d)", &id,&num);
for(int j=0;j<num;j++)
{
int b;
scanf("%d",&b);
g[id][b]=1;
}
}
MaxMatch();
cout<<n-ans/2<<endl;

}
return 0;
}