HDU 1054 Strategic Game-二分匹配&最小顶点覆盖

#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int maxn = 1500;

int match[maxn],book[maxn];
vector<int> e[maxn];
int m,n;

int dfs(int u)
{
int i;
for(i=0;i<e[u].size();i++)
{
int t = e[u][i];
if(book[t]==0)
{
book[t] = 1;
if(match[t]==0 || dfs(match[t]))
{
match[t] = u;
return 1;
}
}
}

return 0;
}

int main()
{
int i,j,t1,t2,sum,k,t;
while(scanf("%d",&n)==1)
{
for(i=0;i<=n;i++)
e[i].clear();
sum = 0;
for(i=0;i<n;i++)
{
scanf("%d:(%d)",&t,&k);
while(k--)
{
scanf("%d",&j);
e[j].push_back(t);
e[t].push_back(j);
}
}
memset(match,0,sizeof(match));
for(i=0;i<n;i++)
{
memset(book,0,sizeof(book));
if(dfs(i))
sum++;
}

printf("%d\n",sum/2);
}
}