hdu1083 Courses ( 二分图最大匹配)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1083

#include <stdio.h>      
#include <string.h>      
#define MAXN 302      

int map[MAXN][MAXN];      
int from[MAXN],used[MAXN];      
  
int match(int x,int n)//匈牙利算法    
{      
	int i;      
	for(i=1;i<=n;++i)     
	{      
		if(!used[i]&&map[x][i])      
		{      
			used[i]=1;      
			if(from[i]==-1||match(from[i],n))      
			{      
				from[i]=x;   
				return 1;      
			}      
		}      
	}      
	return 0;      
}      

int main()      
{      
	int m,n,p,sum,i,j,test;
	scanf("%d",&test);
	while(test--)      
	{      
		memset(map,0,sizeof(map));      
		memset(from,-1,sizeof(from));     
		scanf("%d %d",&p,&n);  
		for(i=1;i<=p;++i)  
		{  
			scanf("%d",&m);
			while(m--)
			{
				scanf("%d",&j);
				map[i][j]=1;
			}
		}  
		sum=0;
		for(i=1;i<=p;++i)     
		{      
			memset(used,0,sizeof(used));      
			if(match(i,n))      
				++sum;      
		}
		if(sum==p)
		    printf("YES\n");
		else
			printf("NO\n");
	}      
	return 0;      
}