HDU 1498 50 years, 50 colors 最小点覆盖
来源:互联网 发布:美工简历 编辑:程序博客网 时间:2024/05/19 19:40
50 years, 50 colors
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1720 Accepted Submission(s): 949
Problem Description
On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it's so nice, isn't it? To celebrate this meaningful day, the ACM team of HDU hold some fuuny games. Especially, there will be a game named "crashing color balloons".
There will be a n*n matrix board on the ground, and each grid will have a color balloon in it.And the color of the ballon will be in the range of [1, 50].After the referee shouts "go!",you can begin to crash the balloons.Every time you can only choose one kind of balloon to crash, we define that the two balloons with the same color belong to the same kind.What's more, each time you can only choose a single row or column of balloon, and crash the balloons that with the color you had chosen. Of course, a lot of students are waiting to play this game, so we just give every student k times to crash the balloons.
Here comes the problem: which kind of balloon is impossible to be all crashed by a student in k times.
There will be a n*n matrix board on the ground, and each grid will have a color balloon in it.And the color of the ballon will be in the range of [1, 50].After the referee shouts "go!",you can begin to crash the balloons.Every time you can only choose one kind of balloon to crash, we define that the two balloons with the same color belong to the same kind.What's more, each time you can only choose a single row or column of balloon, and crash the balloons that with the color you had chosen. Of course, a lot of students are waiting to play this game, so we just give every student k times to crash the balloons.
Here comes the problem: which kind of balloon is impossible to be all crashed by a student in k times.
Input
There will be multiple input cases.Each test case begins with two integers n, k. n is the number of rows and columns of the balloons (1 <= n <= 100), and k is the times that ginving to each student(0 < k <= n).Follow a matrix A of n*n, where Aij denote the color of the ballon in the i row, j column.Input ends with n = k = 0.
Output
For each test case, print in ascending order all the colors of which are impossible to be crashed by a student in k times. If there is no choice, print "-1".
Sample Input
1 112 11 11 22 11 22 25 41 2 3 4 52 3 4 5 13 4 5 1 24 5 1 2 35 1 2 3 43 350 50 5050 50 5050 50 500 0
Sample Output
-1121 2 3 4 5-1
/*n*n的矩阵放置不同的颜色(不同的数字代表不同的颜色),你有k次选择,每一次只能选择某一行或某一列,可以消除该行(列)的所有颜色,问有哪几种颜色,无论怎样经过k次选择后依然无法完全抹去。将横纵坐标为x,y集合 每个颜色的坐标对应一条边,求最小点(横或纵,即为需要射击的次数)覆盖对应边的个数,每次可以消去该点的匹配的边 哪种颜色的气球不能在K次中被消灭( 每次只能消灭一行或者一列 )对于某种颜色的匹配,如果他的最大匹配大于k,则该颜色在k次里无论如何都无法抹去的。最小点覆盖=最大匹配*/#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;#define N 105int n,k;int map[N][N],vis[N],match[N],use[N],ans[N];bool cmp(int a,int b){ return a<b;}int dfs(int u,int color){int i;for(i=1;i<=n;i++) {if(map[u][i]==color&&!vis[i])//对应的某一列是否存在该color{vis[i]=1;if(match[i]==-1||dfs(match[i],color)){match[i]=u;return 1;}}}return 0;}int hungary(int color){int a=0,i;memset(match,-1,sizeof(match));for(i=1;i<=n;i++)//行 {memset(vis,0,sizeof(vis));if(dfs(i,color))a++;}return a;}int main(){int i,j,m,sum;//freopen("test.txt","r",stdin);while(scanf("%d%d",&n,&k)){if(n==0&&k==0) break;memset(map,0,sizeof(map));memset(use,0,sizeof(use));for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&map[i][j]);m=0;//for(i=1;i<=n;i++)for(j=1;j<=n;j++){sum=0;if(!use[map[i][j]])//该颜色没有出现过 寻找该颜色的需要多少次消除 {use[map[i][j]]=1;sum=hungary(map[i][j]);}if(sum>k) ans[m++]=map[i][j];// 统计大于K次的颜色 }if(m==0) printf("-1\n"); else { sort(ans,ans+m,cmp); for(i=0;i<m;i++) { if(i) printf(" "); printf("%d",ans[i]); } printf("\n"); }}return 0;}
0 0
- HDU 1498 50 years, 50 colors 最小点覆盖
- HDU-1498 50 years, 50 colors 最小点覆盖
- HDU 1498 50 years, 50 colors(最小点覆盖,坑题)
- HDU 1498 50 years, 50 colors 最小点覆盖
- hdoj 1498 50 years, 50 colors 【最小点覆盖】
- HDU 1498 50 years, 50 colors(多次进行最小点覆盖运算)
- HDU 1498 50 years, 50 colors(二分最大匹配之最小点覆盖)
- hdu 1498 50 years, 50 colors(二分图匹配--最小点覆盖)
- HDU 1498 50 years, 50 colors 二分图最小点覆盖(基础题)
- HDU 1498 50 years, 50 colors 二分图最小点覆盖
- hdu 1498 50 years, 50 colors(最小顶点覆盖)
- hdu 1498 50 years, 50 colors(最小顶点覆盖)
- hdu 1498 50 years, 50 colors(最小覆盖点数)
- HDU 1498 50 years, 50 colors(最小顶点覆盖)
- hdu 50 years, 50 colors(枚举点,最小点覆盖)
- hdu1498 50 years, 50 colors (最小点覆盖)
- hdu1498 50 years, 50 colors --- 最小点覆盖
- hdu1498—50 years, 50 colors(最小点覆盖)
- 【Java.Web】JSP —— HTML, Servlet,JSP比较, JSP基础
- Lightoj 1005 Rooks
- HDU 1281 棋盘游戏 二分图的最大匹配
- Django+sqlite使用时出现的一个错误的解决方法
- 对C#中Thread.IsBackground属性的理解
- HDU 1498 50 years, 50 colors 最小点覆盖
- AC自动机(good)codeforces86C
- 展望未来,总结过去10年的程序员生涯,给程序员小弟弟小妹妹们的一些总结性忠告
- 修改数据库存储路径
- Eclipse中Tomcat7 Maven插件详解
- combobox自动提示组件添加无选中项清空功能
- mplayer安装(CentOS7)
- iOS 中 JSON 数据交换格式
- 网络工程师备考经验总结