二分图
二分图
Guuuuuu老师儿
当初的算法竞赛题目博客的留言评论就不回复了,时间太久已经忘干净了,抱歉~
展开
-
过山车 (匈牙利算法)
过山车 RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意和水域浪子或伪酷儿做par原创 2017-11-09 11:28:12 · 464 阅读 · 0 评论 -
Battle ships HDU - 5093(二分图最大匹配)
Battle ships HDU - 5093 题目大意: 给出一个n行m列的图,*代表海域,o代表冰水,#代表冰山,要想在海域中放置船,保证船与船之间不能相互看到,之间只要有山就不能看到,问最多能放多少船。 分析: 这道题其实是使用二分图最大匹配来做,重点就在建图上,先一行一行的看,每到一行计数x1++,如果碰到#,x1也++,这样每个*就对应了一个号,然后再一列一列到看同理,每到一...原创 2018-07-16 21:29:03 · 251 阅读 · 0 评论 -
Machine Schedule POJ - (二分图最小点覆盖=最大匹配)
Machine Schedule POJ - 1325 As we all know, machine scheduling is a very classica...原创 2018-04-13 11:52:29 · 217 阅读 · 0 评论 -
Prime Independence LightOJ - 1356(质因子分解+最大点独立集)
Prime Independence LightOJ - 1356A set of integers is called prime independent if none of its...原创 2018-04-16 16:38:51 · 625 阅读 · 0 评论 -
Swap HDU - 2819 (二分图最大匹配+路径还原)
Swap 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? Input Th原创 2017-12-01 10:52:39 · 431 阅读 · 0 评论 -
Oil Skimming HDU - 4185 (二分图最大匹配)
Oil Skimming 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 Gul原创 2017-11-30 20:15:25 · 478 阅读 · 0 评论 -
The Perfect Stall POJ - 1274 (二部图的最大匹配)
The Perfect Stall POJ - 1274 Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the n原创 2017-11-21 16:00:20 · 322 阅读 · 0 评论 -
棋盘游戏 HDU - 1281(最大二分图匹配)
C - 棋盘游戏 HDU - 1281 小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下原创 2017-11-30 16:23:13 · 428 阅读 · 0 评论 -
Courses HDU - 1083(最大二分图匹配)
Courses 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 committe原创 2017-11-30 15:59:32 · 304 阅读 · 0 评论 -
The Accomodation of Students HDU - 2444(最大二分匹配+染色法判断二分图)
The Accomodation of Students HDU - 2444 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原创 2017-11-30 15:39:20 · 302 阅读 · 0 评论 -
Wrestling Match HDU - 5971(染色法判二分模板)
Wrestling Match HDU - 5971 Nowadays, at least one wrestling match is held every year in our country. There are a lot of people in the game is "good player”, the rest is "bad player”. Now, Xiao Ming ...原创 2018-07-21 19:53:44 · 376 阅读 · 0 评论