二分图
文章平均质量分 83
闻道-问道
这个作者很懒,什么都没留下…
展开
-
Fire Net (二分图最大匹配)
Suppose 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 a piece of wall. A blockhouse is a small castle tha...原创 2018-03-04 22:34:34 · 1786 阅读 · 0 评论 -
Wrestling Match (dfs乱搞染色)
Nowadays, at least one wrestling match is held every year in our country. There are a lot of peoplein the game is “good player”, the rest is “bad player”. Now, Xiao Ming is referee of the wrestlingm...原创 2018-10-03 17:31:09 · 2157 阅读 · 0 评论 -
#1394 : 网络流四·最小路径覆盖
时间限制:10000ms单点时限:1000ms内存限制:256MB描述国庆期间正是旅游和游玩的高峰期。小Hi和小Ho的学习小组为了研究课题,决定趁此机会派出若干个调查团去沿途查看一下H市内各个景点的游客情况。H市一共有N个旅游景点(编号1..N),由M条单向游览路线连接。在一个景点游览完后,可以顺着游览线路前往下一个景点。为了避免游客重复游览同一个景点,游览线路保证是没有环路的。每一个调查团可以从...原创 2018-03-19 23:36:19 · 235 阅读 · 0 评论 -
#1122 : 二分图二•二分图最大匹配之匈牙利算法
描述上一回我们已经将所有有问题的相亲情况表剔除了,那么接下来要做的就是安排相亲了。因为过年时间并不是很长,所以姑姑希望能够尽可能在一天安排比较多的相亲。由于一个人同一天只能和一个人相亲,所以要从当前的相亲情况表里选择尽可能多的组合,且每个人不会出现两次。不知道有没有什么好办法,对于当前给定的相亲情况表,能够算出最多能同时安排多少组相亲呢?同样的,我们先将给定的情况表转换成图G=(V,E)。在上一回...原创 2018-03-13 22:39:46 · 191 阅读 · 0 评论 -
#1127 : 二分图三·二分图最小点覆盖和最大独立集
描述在上次安排完相亲之后又过了挺长时间,大家好像都差不多见过面了。不过相亲这个事不是说那么容易的,所以Nettle的姑姑打算收集一下之前的情况并再安排一次相亲。所以现在摆在Nettle面前的有2个问题:1.姑姑想要了解之前所有相亲的情况。对于任一个一次相亲,只要跟参与相亲的两人交流就可以得到这次相亲的情况。如果一个人参加了多次相亲,那么跟他交流就可以知道这几次相亲的情况。那么问题来了,挖掘技术到底...原创 2018-03-09 00:15:55 · 179 阅读 · 0 评论 -
Air Raid (二分图最小路径覆盖)
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 town's streets you can...原创 2018-03-04 23:40:06 · 279 阅读 · 0 评论 -
Strategic Game (二分图最小覆盖数)
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 defend a medieva...原创 2018-03-04 23:33:23 · 198 阅读 · 0 评论 -
Oil Skimming (二分图最大匹配)
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 scooped up by e...原创 2018-03-04 23:23:55 · 316 阅读 · 0 评论 -
棋盘游戏 (二分图最大匹配)
小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些格子是可以避开的,也就是说,不在这些格子上放车,也...原创 2018-03-04 23:13:44 · 385 阅读 · 0 评论 -
Courses (二分图最大匹配)
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 students that sa...原创 2018-03-04 23:05:43 · 279 阅读 · 0 评论 -
The Accomodation of Students (二分图判断+二分图最大匹配)
There 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....原创 2018-03-04 22:58:49 · 199 阅读 · 0 评论 -
HDU - 5093(二分图经典建图)
Dear contestant, now you are an excellent navy commander, who is responsible of a tough mission currently. Your fleet unfortunately encountered an enemy fleet near the South Pole where the geographic...原创 2019-01-18 19:54:59 · 269 阅读 · 1 评论