http://acm.hdu.edu.cn/showproblem.php?pid=1498
刚开始题目没理解汗~~
将横坐标作为x集合纵坐标为y集合 每个颜色的坐标对应一条边,求最小点(横或纵,即为需要射击的次数)覆盖对应边的个数,
代码:
/*************************************************************************
> File Name: main.cpp
> Author: huangshuai
> Mail: huangshuai1993@gmail.com
> Created Time: Sat 09 Mar 2013 02:00:24 PM CST
************************************************************************/
#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;
int map[55][105][105];
int vis[105];
int link1[105];
int n;
int dfs(int i,int j)
{
int l;
for(l=1;l<=n;l++)
{
if(!vis[l]&&map[i][j][l])
{
vis[l]=1;
if(link1[l]==-1||dfs(i,link1[l]))
{
link1[l]=j;
return 1;
}
}
}
return 0;
}
int main()
{
int k;
int i,j;
while(scanf("%d%d",&n,&k)!=EOF)
{
if(n==0&&k==0)
break;
memset(map,0,sizeof(map));
int temp[55],o=0;
memset(temp,0,sizeof(temp));
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
int t;
scanf("%d",&t);
map[t][i][j]=1;
temp[t]=1;
}
}
queue<int> q;
for(i=0;i<52;i++)
{
if(!temp[i])
continue;
memset(link1,-1,sizeof(link1));
int s=0;
for(j=1;j<=n;j++)
{
memset(vis,0,sizeof(vis));
if(dfs(i,j))
s++;
}
if(s>k)
q.push(i);
}
if(q.empty())
printf("-1\n");
else
{
printf("%d",q.front());
q.pop();
while(!q.empty())
{
printf(" %d",q.front());
q.pop();
}
printf("\n");
}
}
}