二分图匹配
文章平均质量分 85
zezzezzez
这个作者很懒,什么都没留下…
展开
-
HDU1281 棋盘游戏
棋盘游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5490 Accepted Submission(s): 3235Problem Description小希和Gardon在玩一个游戏:对一个N*M的棋盘原创 2017-11-17 12:59:26 · 298 阅读 · 0 评论 -
HDU2389 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): 4903 Accepted Submission(s): 1622Problem DescriptionYou’re g转载 2017-12-05 17:14:03 · 390 阅读 · 0 评论 -
CodeForces - 551C (二分查找答案+贪心)
C. GukiZ hates Boxestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProfessor GukiZ is concerned about making his wa原创 2017-12-03 17:27:13 · 472 阅读 · 0 评论 -
POJ3189 Steady Cow Assignment
Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7050 Accepted: 2436DescriptionFarmer John's N (1 FJ would like to rearrange the c原创 2017-12-01 16:29:21 · 198 阅读 · 0 评论 -
HDU3829 Cat VS Dog
Cat VS DogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 4146 Accepted Submission(s): 1509Problem DescriptionThe zoo have N cat原创 2017-11-22 11:44:54 · 196 阅读 · 0 评论 -
二分图最小路径覆盖
原博客:点击打开链接最小路径覆盖定义:在一个有向图中,找出最少的路径,使得这些路径经过了所有的点。最小路径覆盖分为最小不相交路径覆盖和最小可相交路径覆盖。最小不相交路径覆盖:每一条路径经过的顶点各不相同。如图,其最小路径覆盖数为3。即1->3>4,2,5。最小可相交路径覆盖:每一条路径经过的顶点可以相同。如果其最小路径覆盖数为2。即1->3->4,2->3>5。特别转载 2017-11-21 20:55:25 · 407 阅读 · 0 评论 -
poj2289 Jamie's Contact Groups
Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 8190 Accepted: 2763DescriptionJamie is a very popular girl and has quite a lot of fr原创 2017-11-29 21:54:08 · 256 阅读 · 0 评论 -
POJ2112 Optimal Milking
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 18613 Accepted: 6650Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K <= 3转载 2017-11-29 21:19:18 · 154 阅读 · 0 评论 -
HDU2063(记录二分图匹配的板子)
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24889 Accepted Submission(s): 10807Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于原创 2017-11-15 13:24:43 · 289 阅读 · 0 评论 -
HDU 1045 Fire Net
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12982 Accepted Submission(s): 7875Problem DescriptionSuppose that we have原创 2017-11-15 13:19:18 · 168 阅读 · 0 评论 -
HDU2444 The Accomodation of Students(染色法判断二分图)
The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7360 Accepted Submission(s): 3284Problem DescriptionT原创 2017-11-16 14:02:09 · 188 阅读 · 0 评论 -
POJ3020 Antenna Placement
Antenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10015 Accepted: 4950DescriptionThe Global Aerial Research Centre has been allotted the ta原创 2017-11-17 19:45:09 · 211 阅读 · 0 评论 -
HDU4185 Oil Skimming
Oil SkimmingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3049 Accepted Submission(s): 1275Problem DescriptionThanks to a certa原创 2017-11-17 19:29:42 · 206 阅读 · 0 评论 -
HDU2819 Swap
SwapTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4036 Accepted Submission(s): 1493Special JudgeProblem DescriptionGiven an N*N原创 2017-11-17 13:18:55 · 232 阅读 · 0 评论 -
HDU-2255(记录km算法的板子,km求最大权,最小权匹配)
传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老百姓都比较富裕,他们都能对每一间房子在转载 2017-12-03 20:59:06 · 349 阅读 · 0 评论