![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最大匹配+独立集+团+最小路径.点覆盖
qq_37383726
这个作者很懒,什么都没留下…
展开
-
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 gro原创 2017-03-23 00:58:26 · 229 阅读 · 0 评论 -
【poj 2942 】 Knights of the Round Table 【tarjan求bcc+黑白染色判二分图】
Description Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not very su原创 2017-07-26 20:57:38 · 260 阅读 · 0 评论 -
【hdoj 3081】Marriage Match II 【并查集orfloyd +完美匹配】or【最大流+二分+并查集】
Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kids. What a happy time as so many原创 2017-07-27 10:54:00 · 376 阅读 · 0 评论 -
【HDU - 1533】 Going Home 【 MCMF or KM 】
On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to原创 2017-10-08 21:12:35 · 292 阅读 · 0 评论 -
【 HDU 1853】Cyclic Tour 【MCMF or KM 解哈密顿环】
There are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy that, each cycle contain at least two cities, and each city belo原创 2017-10-09 21:37:12 · 268 阅读 · 0 评论 -
Strategic Game 【无向图的最小顶点覆盖】
Strategic Game Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5357 Accepted Submission(s): 2477Problem Description Bob enjoys playing c原创 2017-05-27 18:15:13 · 1303 阅读 · 0 评论 -
【HDU - 3605 】Escape 【状态压缩 构图+最大流 or 多重匹配】
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 wan原创 2017-10-20 22:24:31 · 411 阅读 · 0 评论 -
【CF #435】A B C
A. Mahmoud and Ehab and the MEX time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Dr. Evil kidnapped Mahmoud and Ehab in the evil land bec原创 2017-10-12 22:49:03 · 204 阅读 · 0 评论 -
Treasure Exploration 【传递闭包】+【最小路径覆盖】
Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never know...原创 2017-07-19 09:35:17 · 252 阅读 · 0 评论 -
The King’s Problem 【scc+缩点+最小路径覆盖】
In the Kingdom of Silence, the king has a new problem. There are N cities in the kingdom and there are M directional roads between the cities. That means that if there is a road from u to v, you can on原创 2017-07-22 15:26:31 · 280 阅读 · 0 评论 -
喵哈哈村的魔法大师 【SCC+缩点+floyd求传递闭包+最大匹配+01 背包】
题目链接╳灬兲笙疯癫°月是月大叔的ID,他是一个掌握着429种魔法的魔法大师,最擅长的技能就是搞事,今天他又要开始搞事了。现在有一个由n个点,m条边组成的有向图,每个点上面都有一个魔法家族。现在月大叔为了通知别人参加他的魔法大会,于是他就要拜访所有的家族。由于是有向图,所以可能存在过去,就无法回来的情况,但是没有关系。月大叔可以创造传送卷轴,传送卷轴可以传送到任意一个点。第i张传送卷轴的造价是 a原创 2017-05-30 23:55:36 · 430 阅读 · 0 评论 -
Girls and Boys 【最大独立集团】
Girls and BoysTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11291 Accepted Submission(s): 5293Problem Description the second year of th原创 2017-03-28 21:47:10 · 324 阅读 · 0 评论 -
过山车 【裸 匈牙利算法】
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12508 Accepted Submission(s): 5460Problem DescriptionRPG girls今天和大家一起去游乐原创 2017-03-23 00:01:41 · 263 阅读 · 0 评论 -
最小路径覆盖,最小点覆盖,最大独立点集 【概念】
node 1:最小路径覆盖 在一个PXP的有向图中,路径覆盖就是在图中找一些路经,使之覆盖了图中的所有顶点,且任何一个顶点有且只有一条路径与之关联;(如果把这些路径中的每条路径从它的起始点走到它的终点,那么恰好可以经过图中的每个顶点一次且仅一次);如果不考虑图中存在回路,那么每条路径就是一个弱连通子集. 由上面可以得出: 1.一个单独的顶点是一条路径; 2.如果存在一路径p1,p2,……p原创 2017-05-24 00:02:37 · 779 阅读 · 0 评论 -
Machine Schedule 【最小顶点覆盖】
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8858 Accepted Submission(s): 4449Problem Description As we all know, machin原创 2017-03-28 22:54:03 · 248 阅读 · 0 评论 -
Air Raid 【DAG 最小路径覆盖】
Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town’s streets you can原创 2017-05-24 00:59:12 · 374 阅读 · 0 评论 -
棋盘游戏 【二分匹配+枚举】
棋盘游戏 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的棋盘,在格子里放尽原创 2017-05-27 18:45:55 · 227 阅读 · 0 评论 -
Selecting Courses 【最大匹配】
Selecting Courses Time Limit: 1000MSMemory Limit: 65536K Total Submissions: 8998Accepted: 4005 Description It is well known that it is not easy to select courses in the college, for there is usuall原创 2017-05-27 18:58:52 · 758 阅读 · 0 评论 -
50 years, 50 colors 【最小顶点覆盖】
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 fuu原创 2017-05-27 20:08:50 · 353 阅读 · 0 评论 -
【HDU - 2255】 奔小康赚大钱 【KM算法模板】
传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。 另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老百姓都比较富裕,他们都能对每一间房子在他...原创 2017-10-02 14:52:45 · 201 阅读 · 0 评论