二分图解之,1000+ms,效率不是很高。匈牙利不够快?
/*
* HDU-1068 boys and girls
* mike-w
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define SIZE 1000
int f[SIZE][SIZE];
int match[SIZE];
int tag[SIZE];
int N;
int search(int node)
{
int i;
for(i=0;i<N;i++)
if(f[node][i] && !tag[i])
{
tag[i]=1;
if(match[i]==-1 || search(match[i]))
{
match[i]=node;
return 1;
}
}
return 0;
}
int main(void)
{
int i,j,num,count,id1,id2;
#ifndef ONLINE_JUDGE
freopen("t.in","r",stdin);
#endif
while(scanf("%d",&N)!=EOF)
{
memset(f,0,sizeof(f));
for(i=0;i<N;i++)
match[i]=-1;
for(i=0;i<N;i++)
{
scanf("%d: (%d)",&id1,&num);
for(j=0;j<num;j++)
scanf("%d",&id2),f[id1][id2]=f[id2][id1]=1;
}
for(count=0,i=0;i<N;i++)
{
memset(tag,0,sizeof(tag));
if(search(i))
count++;
}
printf("%d\n",N-count/2);
}
return 0;
}
更快的邻接表实现:340+ms
/*
* HDU-1068 boys and girls
* mike-w
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define SIZE 1000
int f[SIZE][SIZE];
int match[SIZE];
int tag[SIZE];
int N;
int search(int node)
{
int i,t;
for(i=1;i<=f[node][0];i++)
if(!tag[t=f[node][i]])
{
tag[t]=1;
if(match[t]==-1 || search(match[t]))
{
match[t]=node;
return 1;
}
}
return 0;
}
int main(void)
{
int i,j,num,count,id1,id2;
#ifndef ONLINE_JUDGE
freopen("t.in","r",stdin);
#endif
while(scanf("%d",&N)!=EOF)
{
memset(f,0,sizeof(f));
for(i=0;i<N;i++)
match[i]=-1;
for(i=0;i<N;i++)
{
scanf("%d: (%d)",&id1,&num);
for(j=0;j<num;j++)
{
scanf("%d",&id2);
f[id1][++f[id1][0]]=id2;
f[id2][++f[id2][0]]=id1;
}
}
for(count=0,i=0;i<N;i++)
{
memset(tag,0,sizeof(tag));
if(search(i))
count++;
}
printf("%d\n",N-count/2);
}
return 0;
}