棋盘游戏

http://acm.hdu.edu.cn/showproblem.php?pid=1281

#include

#include
#include
using namespace std;
int n,m,k,x[1010],y[1010],map[1010][1010],vis[1010],link[1010];
int find(int a)
{
for(int i=1;i<=m;i++)
{
if(!vis[i] && map[a][i])
{
vis[i]=1;
if(link[i]==-1 || find(link[i]))
{
link[i]=a;
return 1;
}
}
}
return 0;
}
int main()
{
int ca=1;
while(cin>>n>>m>>k)
{
memset(map,0,sizeof(map));
for(int i=0;i {
scanf("%d%d",&x[i],&y[i]);
map[x[i]][y[i]]=1;
}
int hi=0,res=0,sum=0;
memset(link,-1,sizeof(link));
for(int i=1;i<=n;i++)
{
memset(vis,0,sizeof(vis));
res+=find(i);
}
for(int i=0;i {
map[x[i]][y[i]]=0;
memset(link,-1,sizeof(link));
sum=0;
for(int j=1;j<=n;j++)
{
memset(vis,0,sizeof(vis));
sum+=find(j);
}
if(sum hi++;
map[x[i]][y[i]]=1;
}
printf("Board %d have %d important blanks for %d chessmen.\n",ca++,hi,res);
}
return 0;
}