二分图
Sstee1XD
这个作者很懒,什么都没留下…
展开
-
hdu - 2819 Swap 二分图匹配
Problem DescriptionGiven 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 several test cases in the input. The first line of each t原创 2020-08-03 13:57:52 · 178 阅读 · 0 评论 -
hdu - 1045 Fire Net 二分图匹配
Problem DescriptionSuppose 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 that has four openings through which to原创 2020-08-03 10:55:07 · 280 阅读 · 0 评论