ACM 图论----二分匹配
关注
分享
扫一扫
文章平均质量分 90
青山绿水之辈
奋斗青春年华
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
hdu1068Girls and Boys(二分匹配，最大独立集)
Problem Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one原创 2014-07-28 11:15:33 · 952 阅读 · 0 评论 -
hdu2444The Accomodation of Students (最大匹配+判断是否为二分图)
The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2244 Accepted Submission(s): 1056Problem DescriptionThere a原创 2014-07-30 14:43:40 · 2230 阅读 · 1 评论 -
hdu2119Matrix (二分匹配，最小顶点覆盖)
MatrixTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1819 Accepted Submission(s): 792Problem DescriptionGive you a matrix(only contain原创 2014-07-30 10:34:16 · 1005 阅读 · 0 评论 -
hdu1350Taxi Cab Scheme (最小路径覆盖)
Taxi Cab SchemeTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 712 Accepted Submission(s): 337Problem DescriptionRunning a taxi stati原创 2014-08-04 21:17:32 · 1259 阅读 · 0 评论 -
POJ3343&HDU2413Against Mammoths (二分匹配)经典
Against MammothsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 316 Accepted Submission(s): 90Problem DescriptionBack to year 3024, hum原创 2014-08-18 20:54:05 · 1363 阅读 · 0 评论 -
HNU13028Attacking rooks (二分匹配，一行变多行，一列变多列)
Attacking rooksTime Limit: 20000ms, Special Time Limit:50000ms,Memory Limit:65536KBTotal submit users: 12, Accepted users:7Problem 13028 : No special judgementProblem descr原创 2014-10-02 17:14:58 · 1305 阅读 · 0 评论 -
CSU1552: Friends（快速判断大数是不是素数+二分匹配）
1552: FriendsTime Limit: 3 Sec Memory Limit: 256 MBSubmit: 187 Solved: 43[Submit][Status][Web Board]DescriptionOn an alien planet, every extraterrestrial is born with a number. If原创 2015-04-04 13:54:02 · 896 阅读 · 0 评论 -
HDU1845 Jimmy’s Assignment（最大匹配）卡时间
Jimmy’s AssignmentTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1093 Accepted Submission(s): 446Problem DescriptionJimmy is stu原创 2015-05-12 19:15:09 · 1070 阅读 · 0 评论 -
hdu1045Fire Net (一行变多行，一列变多列，最小顶点覆盖)
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6280 Accepted Submission(s): 3549Problem DescriptionSuppose that we have a squa原创 2014-08-01 11:32:17 · 1096 阅读 · 0 评论 -
hdu3729I'm Telling the Truth (最大二分匹配，输出匹配的顶点)经典
I'm Telling the TruthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1335 Accepted Submission(s): 686Problem DescriptionAfter this year原创 2014-08-02 10:57:27 · 1069 阅读 · 0 评论 -
hdu1507Uncle 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): 1943 Accepted Submission(s): 809Special JudgeProblem Descripti原创 2014-08-05 19:42:35 · 1360 阅读 · 0 评论 -
hdu2063过山车（最大匹配）
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10455 Accepted Submission(s): 4607Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以原创 2014-07-30 10:36:03 · 895 阅读 · 0 评论 -
hdu3360National Treasures (最大匹配，拆点法)
National TreasuresTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1038 Accepted Submission(s): 364Problem DescriptionThe great hall of原创 2014-08-05 01:00:20 · 1972 阅读 · 0 评论 -
hdu1151Air Raid (二分匹配，最小路径覆盖)
Problem DescriptionConsider 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 t原创 2014-07-28 15:54:57 · 902 阅读 · 0 评论 -
hdu1179Ollivanders: Makers of Fine Wands since 382 BC. (二分最大匹配)
Problem DescriptionIn Diagon Alley ,there is only one Wand-seller,peeling gold letters over the door read Ollivanders: Makers of Fine Wands since 382 BC.A single wand lay on a faded purple cushion i原创 2014-07-28 16:49:48 · 1215 阅读 · 0 评论 -
hdu3118Arbiter (利用二分图的定义，枚举每种状态)
ArbiterTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 773 Accepted Submission(s): 401Problem DescriptionArbiter is a kind of starshi原创 2014-08-02 00:41:38 · 1842 阅读 · 0 评论 -
hdu2819Swap (行列匹配，输出交换路径)
SwapTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1453 Accepted Submission(s): 491Special JudgeProblem DescriptionGiven an N*N matrix原创 2014-08-02 13:32:38 · 1420 阅读 · 0 评论 -
hdu3861The King’s Problem (强连通 缩点+最小路径覆盖)
The King’s ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1606 Accepted Submission(s): 584Problem DescriptionIn the Kingdom of原创 2014-08-02 15:38:29 · 1496 阅读 · 0 评论 -
hdu1150Machine Schedule (二分匹配，最小顶点覆盖)
Problem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of原创 2014-07-28 14:51:29 · 828 阅读 · 0 评论 -
hdu1281棋盘游戏(二分匹配，最小顶点覆盖)
Problem Description小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻松的解决了这个问题（见下图）注意不能放车的地方不影响车的互相攻击。所以现在Gardon想让小希来解决一个更难的问题，在保证尽量多的“车”的前提下，棋盘里有些格原创 2014-07-28 17:58:45 · 942 阅读 · 0 评论 -
hdu149850 years, 50 colors (多个最小顶点覆盖)
50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1516 Accepted Submission(s): 818Problem DescriptionOn Octorber 21st,原创 2014-07-29 09:52:19 · 1026 阅读 · 0 评论 -
hdu2768Cat vs. Dog (反建法，最大独立集)
Cat vs. DogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1520 Accepted Submission(s): 570Problem DescriptionThe latest reality show h原创 2014-08-04 11:25:38 · 1711 阅读 · 0 评论 -
HDU 2389 Rain on your Parade （二分图匹配（Hopcroft-Carp的算法模板））
Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 3033 Accepted Submission(s): 952Problem DescriptionYou’re gi原创 2015-05-16 23:27:50 · 1175 阅读 · 0 评论