HDOJ 题目1498 50 years, 50 colors(最小点覆盖)
2015-03-20 20:47
260 查看
50 years, 50 colors
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1792 Accepted Submission(s): 981
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.
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 1 1 2 1 1 1 1 2 2 1 1 2 2 2 5 4 1 2 3 4 5 2 3 4 5 1 3 4 5 1 2 4 5 1 2 3 5 1 2 3 4 3 3 50 50 50 50 50 50 50 50 50 0 0
Sample Output
-1 1 2 1 2 3 4 5 -1
Author
8600
Source
“2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛
Recommend
LL | We have carefully selected several similar problems for you: 1507 1528 1533 1497 1493
ac代码
#include<stdio.h> #include<string.h> #include<set> #include<iostream> using namespace std; int ans[101],n,k; int map[1010][1010],g[1010][1010]; int link[1010],vis[1010]; int dfs(int u) { int i; for(i=1;i<=n;i++) { if(!vis[i]&&g[u][i]) { vis[i]=1; if(link[i]==-1||dfs(link[i])) { link[i]=u; return 1; } } } return 0; } int main() { //int n,k; while(scanf("%d%d",&n,&k)!=EOF,n||k) { int i,j; set<int>m; set<int>::iterator it; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { scanf("%d",&map[i][j]); m.insert(map[i][j]); } } int x=0; for(it=m.begin();it!=m.end();it++) { int num=*it; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(map[i][j]==num) g[i][j]=1; else g[i][j]=0; } } memset(link,-1,sizeof(link)); int cot=0; for(i=1;i<=n;i++) { memset(vis,0,sizeof(vis)); if(dfs(i)) cot++; } // printf("%d\n",cot); if(cot>k) { ans[x++]=num; } } if(x==0) printf("-1\n"); else { for(i=0;i<x;i++) { if(i) printf(" %d",ans[i]); else printf("%d",ans[i]); } printf("\n"); } } }
相关文章推荐
- HDOJ-----1498--50 years, 50 colors二分图(最小顶点覆盖)
- hdoj 1498 50 years, 50 colors (二分图--最小点覆盖)
- HDOJ 1498 - 50 years, 50 colors 水二分图..二分图最小点覆盖
- HDOJ 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(最小顶点覆盖)
- hdu1498 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(二分图匹配--最小点覆盖)
- hdu1498—50 years, 50 colors(最小点覆盖)
- 50 years, 50 colors HDU - 1498(最小点覆盖或者说最小顶点匹配)
- HDU 1498 50 years, 50 colors(最小顶点覆盖)