最大匹配(权值匹配)、独立集、团 && 最小路径、点覆盖
文章平均质量分 80
笑着走完自己的路
这个作者很懒,什么都没留下…
展开
-
二分图 【总结】
术语:最大匹配、最小路径覆盖、最小点覆盖、最大独立集、最大团、最大(小)权值匹配。性质:(1) 最小路径覆盖 = 节点数 - 最大匹配。(2) 最小点覆盖 = 最大匹配。(3) 最大独立集 = 节点数 - 最小点覆盖 = 节点数 - 最大匹配 = 补图的最大团 = 。(4) 最大团 = 补图的最大独立集。求解最大匹配算法有三个:匈牙利、HK、KM(大材小用了)匈牙利算法原创 2015-11-11 18:03:29 · 535 阅读 · 4 评论 -
匈牙利算法改进 之 队列优化寻找极大增广路径集 —— Hopcroft-Karp算法 【记录】
算法求解:同匈牙利算法解决的问题,只不过优化了时间复杂度。算法分析:增广sqrt(n)次,每次需要遍历边数m,时间复杂度——O(sqrt(n) * m)。算法实现:1,BFS寻找多条不相交的增广路径,找到极大增广路径集。在这个过程中,设置数组dx[]、dy[]建立X集、Y集的层次图,可以理解为维护距离标号。(可能说法不恰当,这点同最大流Dinic算法里面BFS找一条增广路,原创 2015-10-17 10:29:37 · 1434 阅读 · 0 评论 -
hdoj 3435 A new Graph Game 【无向图判断权值最小哈密顿环】【KM算法】
A new Graph GameTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1934 Accepted Submission(s): 827Problem DescriptionAn undirec原创 2015-08-25 20:55:32 · 1801 阅读 · 0 评论 -
KM算法 求二分图最大权值的完美匹配 【模板 记录】
概念介绍可行顶标:一个节点函数l,使得对任意弧都有lx[x] + ly[y] >= Map[x][y]。相等子图:是原关系的生成子图G,包含所有点,但只包含满足lx[x] + ly[y] = Map[x][y]的弧。匈牙利树:当前拥有匹配关系原创 2015-08-24 17:22:26 · 1098 阅读 · 0 评论 -
hdoj 3488 Tour 【最小费用最大流】【KM算法】
TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2299 Accepted Submission(s): 1151Problem DescriptionIn the kingdom of Hen原创 2015-08-24 16:03:32 · 1299 阅读 · 0 评论 -
hdoj 1533 Going Home 【最小费用最大流】【KM入门题】
Going HomeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3443 Accepted Submission(s): 1763Problem DescriptionOn a grid map原创 2015-08-24 14:41:12 · 2002 阅读 · 0 评论 -
hdoj 1845 Jimmy’s Assignment 【HK】
Jimmy’s AssignmentTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1304 Accepted Submission(s): 527Problem DescriptionJimmy is原创 2015-10-17 10:34:14 · 445 阅读 · 0 评论 -
hdoj 2255 奔小康赚大钱 【KM算法模板题】
奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5339 Accepted Submission(s): 2334Problem Description传说在遥远的地方有一个非常富裕的村落,原创 2015-08-14 22:46:42 · 486 阅读 · 0 评论 -
hdoj 2389 Rain on your Parade 【HK】
Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 3305 Accepted Submission(s): 1063Problem DescriptionYou’原创 2015-10-17 11:00:59 · 389 阅读 · 0 评论 -
hdoj 2246 Interesting Housing Problem 【最大费用最大流 or KM算法】
Interesting Housing ProblemTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2726 Accepted Submission(s): 986Problem Description原创 2015-08-28 00:11:19 · 782 阅读 · 2 评论 -
hdoj 2119 Matrix 【行列匹配 求解最小点覆盖】【基础题】
MatrixTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2234 Accepted Submission(s): 992Problem DescriptionGive you a matrix(on原创 2015-09-15 23:09:23 · 505 阅读 · 0 评论 -
lightoj 1150 - Ghosts! 【BFS + 二分查找 + 判二分图完美匹配】
1150 - Ghosts!PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBIt's a dark, cloudy and spooky night. The ghosts of 'VutPara' gravey原创 2015-10-10 20:58:25 · 764 阅读 · 0 评论 -
Codeforces 557D Vitaly and Cycle 【染色判二分图 + 组合数学】
题目链接:Codeforces 557D Vitaly and CycleD. Vitaly and Cycle time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output After Vitaly was expelled from原创 2016-04-21 18:06:18 · 717 阅读 · 0 评论 -
lightoj 1011 - Marriage Ceremonies 【状压dp or KM】
题目链接:lightoj 1011 - Marriage Ceremonies1011 - Marriage Ceremonies PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB You work in a company which organizes marri原创 2016-04-27 13:57:23 · 466 阅读 · 0 评论 -
lightoj 1356 - Prime Independence 【质因子分解 奇偶构图 + HK优化】
1356 - Prime IndependencePDF (English)StatisticsForumTime Limit: 3 second(s)Memory Limit: 32 MBA set of integers is called prime independent if none of原创 2015-10-25 21:32:50 · 1427 阅读 · 0 评论 -
hdoj 5556 Land of Farms 【DFS + 最大独立集->补图最大团】
Land of FarmsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 19 Accepted Submission(s): 13Problem DescriptionFarmer John and原创 2015-11-14 22:36:56 · 1036 阅读 · 0 评论 -
lightoj 1152 - Hiding Gold 【奇偶建二分图 求最大匹配】
1152 - Hiding GoldPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are given a 2D board where in some cells there are gold. You原创 2015-10-15 22:58:55 · 670 阅读 · 0 评论 -
poj 3692 Kindergarten 【最大团 = 补图最大独立集 = 补图节点数 - 补图最大匹配】
KindergartenTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5922 Accepted: 2899DescriptionIn a kindergarten, there are a lot of kids. All girls of the原创 2015-11-11 21:27:01 · 818 阅读 · 0 评论 -
hdoj 2444 The Accomodation of Students 【黑白染色判二分图 + 最大匹配】
The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3743 Accepted Submission(s): 1754Problem Description原创 2015-09-22 22:58:25 · 570 阅读 · 0 评论 -
poj 1419 Graph Coloring 【最大团】
Graph ColoringTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4559 Accepted: 2085 Special JudgeDescriptionYou are to write a program that tries to f原创 2015-11-11 18:05:10 · 752 阅读 · 0 评论 -
hdoj 1530 Maximum Clique 【最大团】
Maximum CliqueTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3207 Accepted Submission(s): 1689Problem DescriptionGiven a g原创 2015-11-11 18:04:42 · 586 阅读 · 0 评论 -
lightoj 1429 - Assassin`s Creed (II) 【BFS预处理传递闭包 + SCC缩点 + DAG最小路径覆盖】
1429 - Assassin`s Creed (II)PDF (English)StatisticsForumTime Limit: 4 second(s)Memory Limit: 32 MBEzio needs to kill N targets located in N different ci原创 2015-10-16 23:47:53 · 805 阅读 · 2 评论 -
Light oj 1149 - Factors and Multiples 【二分图最大匹配】【好题】
1149 - Factors and MultiplesPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou will be given two sets of integers. Let's call the原创 2015-08-20 18:42:16 · 662 阅读 · 0 评论 -
hdoj 1507 Uncle Tom's Inherited Land* 【二分图 二维坐标划分奇偶集构图 求最大匹配】
Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2507 Accepted Submission(s): 1036Special JudgeProblem原创 2015-09-07 19:14:42 · 559 阅读 · 0 评论 -
hdoj 1498 50 years, 50 colors 【最小点覆盖】
50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1830 Accepted Submission(s): 1003Problem DescriptionOn Octor原创 2015-05-12 16:39:12 · 566 阅读 · 0 评论 -
nyoj 239 月老的难题
月老的难题时间限制:1000 ms | 内存限制:65535 KB难度:4描述月老准备给n个女孩与n个男孩牵红线,成就一对对美好的姻缘。现在,由于一些原因,部分男孩与女孩可能结成幸福的一家,部分可能不会结成幸福的家庭。现在已知哪些男孩与哪些女孩如果结婚的话,可以结成幸福的家庭,月老准备促成尽可能多的幸福家庭,请你帮他找出最多可能促成的幸福原创 2015-05-09 11:02:29 · 471 阅读 · 0 评论 -
poj 2239 Selecting Courses 【二分图最大匹配】
Selecting CoursesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8998 Accepted: 4005DescriptionIt is well known that it is not eas原创 2015-04-23 18:46:30 · 570 阅读 · 0 评论 -
hdoj 1281 棋盘游戏
棋盘游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2664 Accepted Submission(s): 1559Problem Description小希和Gardon在玩一个游戏:对一个N*M的原创 2015-03-08 16:05:40 · 528 阅读 · 0 评论 -
hdoj 1179 Ollivanders: Makers of Fine Wands since 382 BC.
Ollivanders: Makers of Fine Wands since 382 BC.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1016 Accepted Submission(s): 563P原创 2015-03-19 21:28:27 · 672 阅读 · 0 评论 -
hdoj 1151 Air Raid
Air RaidTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3609 Accepted Submission(s): 2371Problem DescriptionConsider a town whe原创 2015-02-26 19:31:34 · 387 阅读 · 0 评论 -
hdoj 1068 Girls and Boys
Girls and BoysTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8074 Accepted Submission(s): 3696Problem Descriptionthe second原创 2015-02-22 23:18:59 · 589 阅读 · 0 评论 -
hdoj 1150 Machine Schedule
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6317 Accepted Submission(s): 3163Problem DescriptionAs we all k原创 2015-02-24 09:15:57 · 465 阅读 · 0 评论 -
hdoj 1083 Courses
CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4072 Accepted Submission(s): 1942Problem DescriptionConsider a group o原创 2015-02-22 22:23:28 · 477 阅读 · 0 评论 -
hdoj 1054 Strategic Game
Strategic GameTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5357 Accepted Submission(s): 2477Problem DescriptionBob enjoys原创 2015-02-26 20:59:24 · 376 阅读 · 0 评论 -
hdoj 1526 A Plug for UNIX 【floyd求传递闭包 + 二分图匹配】
A Plug for UNIXTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 892 Accepted Submission(s): 200Problem DescriptionYou are in cha原创 2015-07-28 07:53:05 · 461 阅读 · 0 评论 -
zoj 3460 Missile 【二分 + 二分图匹配】 【经典建模】 【二分 + 最大流】
MissileTime Limit: 2 Seconds Memory Limit: 65536 KB You control N missile launching towers. Every tower has enough missiles, but for each tower only one missile can be launch at the sam原创 2015-08-02 21:27:45 · 793 阅读 · 0 评论 -
poj 2594 Treasure Exploration 【warshall 求传递闭包 + 最小路径覆盖】
Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7201 Accepted: 2938DescriptionHave you ever read any book about treasure explorati原创 2015-07-21 16:27:02 · 443 阅读 · 0 评论 -
hdoj 5090 Game with Pearls 【二分图最大匹配】
Game with PearlsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1913 Accepted Submission(s): 671Problem DescriptionTom and Je原创 2015-08-13 14:07:44 · 518 阅读 · 0 评论 -
hdoj 5093 Battle ships 【二分图求最大匹配】【经典建图】
Battle shipsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 892 Accepted Submission(s): 313Problem DescriptionDear contestant原创 2015-08-13 14:43:19 · 537 阅读 · 0 评论 -
hdoj 1045 Fire Net 【DFS n皇后变形】 【二分图】
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7510 Accepted Submission(s): 4306Problem DescriptionSuppose that we原创 2015-06-27 11:06:31 · 485 阅读 · 0 评论