hdu 3605 Escape 二分图的多重匹配(匈牙利算法)
来源:互联网 发布:福建卓知襄阳 编辑:程序博客网 时间:2024/05/18 18:20
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3605
Escape
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 8001 Accepted Submission(s): 1758
Problem Description
2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the planet. Now scientists want your help, is to determine what all of people can live in these planets.
Input
More set of test data, the beginning of each data is n (1 <= n <= 100000), m (1 <= m <= 10) n indicate there n people on the earth, m representatives m planet, planet and people labels are from 0. Here are n lines, each line represents a suitable living conditions of people, each row has m digits, the ith digits is 1, said that a person is fit to live in the ith-planet, or is 0 for this person is not suitable for living in the ith planet.
The last line has m digits, the ith digit ai indicates the ith planet can contain ai people most..
0 <= ai <= 100000
The last line has m digits, the ith digit ai indicates the ith planet can contain ai people most..
0 <= ai <= 100000
Output
Determine whether all people can live up to these stars
If you can output YES, otherwise output NO.
If you can output YES, otherwise output NO.
Sample Input
1 1112 21 01 01 1
Sample Output
YESNO
Source
2010 ACM-ICPC Multi-University Training Contest(17)——Host by ZSTU
题目大意: N(N<100,000)个人要去M(M<10)个星球,每个人只可以去一些星球,一个星球最多容纳Ki个人,输出是否所有人都可以选择自己的星球。
解题思路:放置了很久的题目了,一直是TLE,今天翻出来改来改去还是TLE~~~~大过年的,非要AC。
由于n很大,m很小,标记的数组不要太大,15就足够啦。解决多重匹配就是记录一下多重匹配的点(简称Y方点)已经匹配了Pi个点。如果Pi<Ki那么就直接上了,否则的话继续搜索Yi已经匹配的每一个点并将Yi染色,因为Yi搜一次就需要染色了,而且Y方点最多是10个,所以每次找增广路的深度最多是10,这样就很快了!!!(用c++交吧)
详见代码。
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int n,m;int w[15],cnt[15];int Map[100010][12],mat[12][100010];bool vis[15];bool Find(int x){for(int i=0;i<m;i++)if(!vis[i]&&Map[x][i]){vis[i]=1;if(cnt[i]<w[i]){mat[i][cnt[i]++]=x;return true;}for(int j=0;j<cnt[i];j++)if(Find(mat[i][j])){mat[i][j]=x;return true;}}return false;}bool ok(){memset(cnt,0,sizeof(cnt));for(int i=0;i<n;i++){memset(vis,0,sizeof(vis));if(!Find(i))return false;}return true;}int main(){while(~scanf("%d%d",&n,&m)){for(int i=0;i<n;i++)for(int j=0;j<m;j++)scanf("%d",&Map[i][j]);for(int i=0;i<m;i++)scanf("%d",&w[i]); if (ok()==1) printf ("YES\n"); else printf ("NO\n");}return 0;}
1 0
- hdu 3605 Escape 二分图的多重匹配(匈牙利算法)
- hdu_3605 Escape 二分图的多重匹配 匈牙利算法
- hdu 3605 Escape (二分图多重匹配)
- hdu 3605 Escape【二分图多重匹配】
- HDU 3605 Escape【二分图多重匹配】
- HDU 3605 Escape (二分图的多重匹配)
- hdu 3605 Escape (二分图的多重匹配)
- hdu 3605 Escape(二分图多重匹配问题)
- hdu 3605 Escape (二分图多重匹配)
- HDU 3605 Escape (二分图多重匹配模板)
- HDU 3605 Escape (二分图多重匹配模板)
- HDU-3605 Escape(状态压缩+最大流求多重匹配、改版匈牙利算法)
- HDOJ 3605 - Escape 二分图多重匹配
- HDU 3605 Escape(网络流 + 状压简化 | 二分图多重匹配)
- hdu 3605 Escape(最大流+状态压缩 or 二分图多重匹配)
- hdu 3605 Escape/poj 2584 T-Shirt Gumbo(二分图多重匹配)
- hdu3605—Escape(二分图的多重匹配)
- hdu 3605 Escape (二分图匹配)
- SQL查询相关技术-2.比较逻辑重复查询
- 恩VIM 编辑器的使用
- eclipse错误:Syntax error , 'for each' statements are only available if source level is 1.5
- NYOJ-420-p次方求和
- Zookeeper设置开启启动
- hdu 3605 Escape 二分图的多重匹配(匈牙利算法)
- yum search与install用法
- UITableView上的批量操作(系统方法)
- jxl对excel操作总结
- 基于PetShop的数据可视化网站(四):自定义成员资格
- untiy 3d ShaderLab第 1 章Shader(着色器)的概念和在 3D 游戏中的作用
- 1010. 一元多项式求导
- poj 2236 Wireless Network
- linux 下编译 boost 的笔记