hdu1498——最小点覆盖
来源:互联网 发布:玩穿越火线网络卡 编辑:程序博客网 时间:2024/05/16 10:09
hdu1498 50 years, 50 colors:http://acm.hdu.edu.cn/showproblem.php?pid=1498
50 years, 50 colors
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2005 Accepted Submission(s): 1104
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
思路:完全没思路啊,跟以前的最小点覆盖有点不一样(菜鸟渣渣),于是看了看诸位大神写的。。。。。好好想想还是可以想通的:分别对每种颜色的气球进行匹配,若匹配出来的结果大于k次,那么说明这种气球不能在k次内完成。。。。就这样对每种颜色的气球都进行匹配。。其实这就相当于行对列进行匹配(列对行)。。。瞬间觉得叼叼的,也真的是涨姿势了!(Too young……
Ac代码:
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<cstdlib>#include<string>#include<stack>#include <map>#include <set>using namespace std;const int maxn=500 + 10;int n,m;int g[maxn][maxn];set<int>Set;int vis[maxn],link[maxn];bool path(int u,int x){ for(int i = 0; i < n; i++) if(g[u][i] == x && !vis[i]) // 跟以前的最小点覆盖的写法不一样的地方,将等于1换成等于当前颜色的气球。 { vis[i] = 1; if(link[i] == -1 || path(link[i],x)) { link[i] = u; return true; } } return false;}int dfs(int x){ memset(link,-1,sizeof(link)); int ans = 0; for(int i = 0; i < n; i++) { memset(vis,0,sizeof(vis)); if(path(i,x))ans++; } return ans;}int main(){// freopen("in.txt","r",stdin); int t; while(~scanf("%d%d",&n,&m) && (n || m)) { Set.clear(); memset(g,0,sizeof(g)); for(int i = 0; i < n; i ++) for(int j = 0; j < n; j++) { scanf("%d",&g[i][j]); Set.insert(g[i][j]); } set<int>::iterator it; int falg = 1,findl = 1; for(it = Set.begin(); it != Set.end(); it++) { if(dfs(*it) > m) { findl = 0; if(falg)printf("%d",*it),falg = 0; else printf(" %d",*it); } } if(findl)printf("-1"); printf("\n"); } return 0;}
0 0
- hdu1498——最小点覆盖
- hdu1498最小点覆盖
- hdu1498—50 years, 50 colors(最小点覆盖)
- hdu1498匈牙利算法/最小点覆盖
- hdu1498题解-再次白话最小点覆盖
- hdu1498 50 years, 50 colors (最小点覆盖)
- hdu1498 二分图匹配(多次最小点覆盖)
- hdu1498 50 years, 50 colors --- 最小点覆盖
- hdu1498二分图最小顶点覆盖
- HDOJ 1054 —— 最小点覆盖
- hdu1150——最小点覆盖
- hdu2119—Matrix(最小点覆盖)
- poj3041—Asteroids(最小点覆盖)
- hdu1498 50 years, 50 colors(最小顶点覆盖)
- POJ2226 Muddy Fields——最小点覆盖问题
- 二分图最小点覆盖数——POJ 3041
- hdu 1498 二分图—最小点覆盖
- POJ 3041 Asteroids(匈牙利算法—最小点覆盖)
- 今天在这里写下第一篇博客,虽然不知道我的路能走多远
- thinkPHP 内置的一个大写字母方法
- contextlib模块
- iOS crash log 文件解析
- MySQL学习笔记
- hdu1498——最小点覆盖
- Xcode升级后插件失效的解决办法
- ios some tips
- a 标签点击有边框的问题
- Masonry框架的使用
- Eclipse使用技巧
- MySQL sql-mode
- codeforces 301B. Yaroslav and Time(下标的艺术)
- Linux学习第二篇