二分匹配
文章平均质量分 81
Lionel_D
这个作者很懒,什么都没留下…
展开
-
hdu 2063 过山车 二分图的最大匹配模板。。感觉模板代码很简洁
Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意和水域浪子或伪酷儿做partner。考虑到经费问题,boss刘决定只让找到partner的人去坐过山车,其他的人原创 2015-04-27 17:59:07 · 835 阅读 · 0 评论 -
hdu 2444 The Accomodation of Students 判断是否为二分图+最大匹配
Problem DescriptionThere 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. But this may not imply that A and C know each other.Now you are given all pairs of stu原创 2015-04-28 10:05:29 · 924 阅读 · 0 评论 -
hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
Problem DescriptionConsider 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 students that satisfies simultaneously the condition原创 2015-04-28 09:05:49 · 1148 阅读 · 0 评论 -
hdu 1281 棋盘游戏 二分匹配
Problem Description小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些格子是可以避开的,也就是说,不在这些格子上放车,也可以保证尽量多的“车”被放下。但是某些格子若不放子,就无法保证放尽量多原创 2015-04-28 17:20:12 · 1136 阅读 · 0 评论 -
hdu 4751 Divide Groups 2—sat问题 还是未理解
This year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus back to visit and take photos. After carefully planning, Tom200 announced his activity plan, one that contains two char原创 2015-04-28 21:59:12 · 957 阅读 · 0 评论