图的匹配问题
理想主义文艺青年
理想主义源于对生活的憧憬 文艺是对生活的态度
展开
-
csu 1552: Friends(拉宾米勒测试+二分匹配)
1552: FriendsTime Limit: 3 Sec Memory Limit: 256 MBSubmit: 129 Solved: 24[Submit][Status][Web Board]DescriptionOn an alien planet, every extraterrestrial is born with a number. If原创 2015-03-28 19:22:41 · 818 阅读 · 0 评论 -
CSU 1623 Inspectors(二分图最大权匹配 KM算法)(UVAlive 6879)
题目链接:http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1623选用一些边 覆盖所有的点 使得这些边的权值和最小比赛时的想法是用一般图最大权匹配 样例也过了 但是提交总是WA看kuangbin模版中写的是点的个数必须是偶数。。是不是有可能是这个原因改用二分图最大权匹配之后就过了。。。。#include #include原创 2015-05-17 20:33:12 · 649 阅读 · 0 评论 -
POJ 2289 Jamie's Contact Groups(二分图多重匹配)
Language:DefaultJamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 6735 Accepted: 2197DescriptionJamie is a very popular girl a原创 2015-05-17 01:15:44 · 873 阅读 · 0 评论 -
poj 1548 Robots(最小路径覆盖)
Language:DefaultRobotsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4021 Accepted: 1834DescriptionYour company provides robots that can be used原创 2015-05-11 23:48:56 · 655 阅读 · 0 评论 -
hdu 3335 Divisibility(二分匹配)
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=3335这道题之前的一种做法是用Dancing Links做的 当然这道题也可以用 二分匹配做 求符合要求的最长的链 在这里涉及到一个定理 Dilworth定理此题还要除重#include #include #include #include #include #i原创 2015-05-11 16:32:27 · 928 阅读 · 0 评论 -
URAL 2038 Minimum Vertex Cover(二分匹配)
2038. Minimum Vertex CoverTime limit: 1.0 secondMemory limit: 64 MBA vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of t原创 2015-04-25 00:07:25 · 1363 阅读 · 0 评论 -
hdu 5093 Battle ships(二分匹配)
Battle shipsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 521 Accepted Submission(s): 213Problem DescriptionDear contestant原创 2015-04-18 22:20:21 · 613 阅读 · 0 评论 -
zoj 3316 Game(带花树+完美匹配)
GameTime Limit: 1 Second Memory Limit: 32768 KBFire and Lam are addicted to the game of Go recently. Go is one of the oldest board games. It is rich in strategy despite its simple rules原创 2015-04-01 21:59:09 · 915 阅读 · 0 评论 -
hdu 4687 Boke and Tsukkomi(一般图匹配 带花树算法)
Boke and TsukkomiTime Limit: 3000/3000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 739 Accepted Submission(s): 231Problem DescriptionA new se原创 2015-04-01 13:07:18 · 856 阅读 · 0 评论 -
poj 1904 King's Quest(Tarjan+匹配)
Language:DefaultKing's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 7653 Accepted: 2781Case Time Limit: 2000MSDescriptionOnce upon a原创 2015-03-31 16:10:44 · 673 阅读 · 0 评论 -
hiho #1127 : 二分图三·二分图最小点覆盖和最大独立集(无向图 二分图匹配)
题目链接:点击打开链接#1127 : 二分图三·二分图最小点覆盖和最大独立集时间限制:10000ms单点时限:1000ms内存限制:256MB描述在上次安排完相亲之后又过了挺长时间,大家好像都差不多见过面了。不过相亲这个事不是说那么容易的,所以Nettle的姑姑打算收集一下之前的情况并再安排一次相亲。所以现在摆在Net原创 2015-03-16 00:09:45 · 869 阅读 · 0 评论 -
hdu 4685 Prince and Princess(Tarjan+二分匹配)
Prince and PrincessTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1224 Accepted Submission(s): 350Problem DescriptionThere a原创 2015-03-31 21:49:27 · 734 阅读 · 0 评论 -
URAL 1099 Work Scheduling(一般图匹配 带花树算法)
URAL - 1099Work SchedulingTime Limit: 500MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThere is certain amount of night g原创 2015-04-01 12:45:55 · 989 阅读 · 0 评论 -
hnuoj 13377 Book Club(匈牙利算法)
Book ClubTime Limit: 5000ms, Special Time Limit:12500ms, Memory Limit:65536KBTotal submit users: 35, Accepted users: 17Problem 13377 : No special judgementProblem description原创 2015-08-09 20:11:40 · 843 阅读 · 2 评论