二分匹配
夜幕下的ACM之路
通往成功的路注定是孤独的,我不会放弃!!!!
展开
-
POJ 3041 Asteroids(二分匹配模板题)
/*poj 3041行和列建立二分图一个点上有东西则建立一条边。题目就相当于求最小点覆盖数=最大二分匹配数*/#include<stdio.h>#include<iostream>#include<string.h>#include<algorithm>using namespace std;/* *****************************************原创 2016-02-20 21:47:56 · 356 阅读 · 0 评论 -
HDU 1083 Courses(二分图最大匹配【匈牙利算法】)
http://acm.hdu.edu.cn/showproblem.php?pid=1083 CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6048 Accepted Submission(s): 2914Pr原创 2016-07-22 10:22:51 · 402 阅读 · 0 评论 -
HDU 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): 5145 Accepted Submission(s): 2341Problem Description There are原创 2016-07-22 10:18:03 · 402 阅读 · 0 评论 -
二分匹配题集(转自夏天的风,不时更新)
普通匹配,多重匹配【HDU】 1068 Girls and Boys 最大匹配★ 1150 Machine Schedule 最小点覆盖★ 1151 Air Raid 最小路径覆盖★ 1179 Ollivanders 最大匹配★ 1281 棋盘游戏 行列匹配+求关键点★★ 1498 50 years, 50 colors 行列匹配★ 1507 Uncle Tom’s Inherited原创 2016-05-09 07:16:32 · 491 阅读 · 0 评论 -
HDU 1179 Ollivanders: Makers of Fine Wands since 382 BC.(匈牙利算法)
Problem Description In 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 in原创 2016-05-08 18:40:32 · 777 阅读 · 0 评论 -
HDU 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): 1314 Accepted Submission(s): 718Problem Desc原创 2016-05-08 18:35:00 · 518 阅读 · 0 评论 -
HDU 1068 Girls and Boys(二分匹配--匈牙利算法)
Problem Description the 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原创 2016-05-08 14:28:32 · 567 阅读 · 0 评论 -
HDU 2063 过山车(第一发二分匹配)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2063 Problem Description RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD原创 2016-05-08 13:58:18 · 500 阅读 · 0 评论 -
FZU 2039 Pets(二分匹配裸题)
Problem DescriptionAre you interested in pets? There is a very famous pets shop in the center of the ACM city. There are totally m pets in the shop, numbered from 1 to m. One day, there are n customers原创 2016-05-05 13:41:58 · 504 阅读 · 0 评论 -
HDU 1068 Girls and Boys(最小独立集)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1068 Girls and BoysTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10870 Accepted Submissi原创 2016-11-04 20:18:10 · 431 阅读 · 0 评论