NBOJ 1182 Counter-Strike 二分图最大匹配

#include <iostream>
#include <string.h>
#include <cstdio>
#include <vector>
using namespace std;

const int N = 510;
#define CLR(arr,val) memset(arr,val,sizeof(arr))
vector<int> vv
;
int visted
,flag
;
bool dfs(int x){
	for(int i = 0;i < vv[x].size();++i){
		if(!visted[vv[x][i]]){
		  visted[vv[x][i]] = 1;
		  if(!flag[vv[x][i]] || dfs(flag[vv[x][i]])){
		    flag[vv[x][i]] = x;
			return true;
		  }
		}
	}
	return false;
}
int main(){
	//freopen("1.txt","r",stdin);
	int n,m;
	while(scanf("%d%d",&n,&m) != EOF){
	  memset(vv,0,sizeof(vv));
	  int num,x;
	  for(int i = 1;i <= n;++i){
	    scanf("%d",&num);
		while(num--){
		  scanf("%d",&x);
		  vv[i].push_back(x);
		}
	  }
	  int cnt = 0;
	  CLR(flag,0);
	  for(int i = 1;i <= n;++i){
	    CLR(visted,0);
		if(dfs(i))
			cnt++;
	  }
	  printf("%d\n",cnt);
	}
	return 0;
}