二分图匹配
偷吃了老鼠的土豆
戒骄戒躁,脚踏实地,坚持不懈,愈挫愈勇。
展开
-
hdu-2255(KM算法-二分图的最大权匹配)
题目:HDU - 2255传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。 另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老百姓都比较富裕...原创 2019-01-29 18:24:18 · 192 阅读 · 0 评论 -
poj-2112(最大流-最短路-二分答案)
题目:POJ - 2112FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the ...原创 2019-01-26 17:32:38 · 177 阅读 · 0 评论 -
POJ-2289(二分答案+多重匹配)
题目:POJ - 2289 Jamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list has become so long that it often takes a l...原创 2019-01-26 13:27:50 · 1085 阅读 · 0 评论 -
HDU-3829(最大独立集)
题目:HDU - 3829 The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child's like-animal is a cat, then his/hers disli...原创 2019-01-20 20:18:27 · 280 阅读 · 0 评论 -
poj-2594(可相交最小路径覆盖)
题目:POJ - 2594 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 ...原创 2019-01-20 18:13:21 · 369 阅读 · 0 评论 -
HDU-1151(最小路径覆盖)
题目:HDU - 1151 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 tow...原创 2019-01-20 17:39:01 · 317 阅读 · 0 评论 -
HDU-1054(二分图匹配+最小点覆盖+Hopcroft-Karp)
题目:HDU - 1054 Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must ...原创 2019-01-20 16:42:26 · 209 阅读 · 0 评论 -
poj - 3020(二分匹配)
题目:http://poj.org/problem?id=3020The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got t...原创 2019-01-20 15:43:40 · 228 阅读 · 0 评论 -
HDU-2819(二分图匹配+记录路径)
题目:HDU - 2819 Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1?InputThere are sev...原创 2018-12-24 18:29:07 · 200 阅读 · 0 评论 -
HDU-1281(二分图匹配)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1281小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一...原创 2018-12-24 16:11:53 · 119 阅读 · 0 评论 -
HDU-1083(最大匹配)
题目:HDU - 1083 Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P ...原创 2018-12-22 16:59:17 · 115 阅读 · 0 评论 -
HDU-2444(二分图最大匹配+交叉染色法)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2444There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. B...原创 2018-12-22 15:31:58 · 275 阅读 · 0 评论 -
hdu-4185(二分图匹配)
题目:HDU - 4185 Thanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floating in the Gulf of Mexico just waiting to be...原创 2018-12-26 21:29:43 · 283 阅读 · 0 评论 -
HDU-2389(二分图最大匹配-hopcroft-karp算法)
题目:HDU - 2389 You’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a soothing wind sends fresh, salty a...原创 2018-12-26 15:21:52 · 466 阅读 · 0 评论 -
HDU-1045(二分图匹配)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1045Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or ...原创 2018-12-09 14:27:55 · 479 阅读 · 0 评论 -
HDU-3488(二分图最大权匹配+有向环最小权值覆盖)
题目:HDU - 3488 In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the ki...原创 2019-01-29 18:51:10 · 280 阅读 · 0 评论