POJ1274 The Perfect Stall(二分图)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int map[300][300], used[300],girl[300];
int n, m;

bool find(int x)
{
int i;
for (i = 1; i <= m; i++)
{
if (map[x][i] && !used[i])
{
used[i] = 1;
if (girl[i] == -1 || find(girl[i]))//女孩还没人追或者追的人可以挪动
{
girl[i] = x;
return true;
}
}
}
return false;
}

int main()
{
int i, num,temp;
while (scanf("%d%d", &n, &m) != EOF)
{
memset(map, 0, sizeof(map));
memset(girl, -1, sizeof(girl));
for (i = 1; i <= n; i++)
{
scanf("%d", &num);
while (num--)
{
scanf("%d", &temp);
map[i][temp] = 1;
}
}
int num = 0;
for (i = 1; i <= n; i++)
{
memset(used, 0, sizeof(used));//每次都要重新赋值为0
if (find(i))
num++;
}
printf("%d\n", num);
}
return 0;
}