随笔分类 -  匹配问题

POJ 3020 Antenna Placement(二分匹配最小路径覆盖)
摘要：Description：The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most str... 阅读全文
posted @ 2015-08-13 14:29 搁浅の记忆 阅读(200) 评论(0) 推荐(0)
HDU 2819 Swap（记录二分匹配的过程）
摘要：Problem Description：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 ... 阅读全文
posted @ 2015-08-12 20:24 搁浅の记忆 阅读(176) 评论(0) 推荐(0)
HDU 2444 The Accomodation of Students（BFS判断是否为二分图）
摘要：Description：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 ea... 阅读全文
posted @ 2015-08-11 16:00 搁浅の记忆 阅读(405) 评论(0) 推荐(0)
HDU 1498 50 years, 50 colors
摘要：Problem Description：On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it's so nice, isn't it? To celebrate this... 阅读全文
posted @ 2015-08-11 10:22 搁浅の记忆 阅读(162) 评论(0) 推荐(0)
POJ 1466 Girls and Boys(最大独立集)
摘要：Description：In the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically i... 阅读全文
posted @ 2015-08-10 20:00 搁浅の记忆 阅读(175) 评论(0) 推荐(0)
HDU 1045 Fire Net（缩点求最大匹配）
摘要：Problem Description：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 repres... 阅读全文
posted @ 2015-08-10 17:56 搁浅の记忆 阅读(145) 评论(0) 推荐(0)
POJ 2195 Going Home(BFS+KM求最小权值)
摘要：Description：On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or ver... 阅读全文
posted @ 2015-08-10 15:56 搁浅の记忆 阅读(319) 评论(0) 推荐(0)
HDU 2255 奔小康赚大钱(KM算法求完备匹配)
摘要：Problem Description：传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到... 阅读全文
posted @ 2015-08-08 20:56 搁浅の记忆 阅读(191) 评论(0) 推荐(0)