二分图匹配
linmory
头疼....太难了
展开
-
hdu 1045 Fire Net dfs深搜或者二分匹配
Fire Net Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12961 Accepted Submission(s): 7865 Problem Description Suppose that we ha原创 2017-11-14 21:23:15 · 210 阅读 · 0 评论 -
hdu 2444 The Accomodation of Students
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 imp原创 2017-11-22 10:45:25 · 190 阅读 · 0 评论 -
hdu 1083 Courses最大匹配
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原创 2017-11-22 10:50:16 · 273 阅读 · 0 评论 -
hdu 1829 A Bug's Life
A Bug's Life Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17246 Accepted Submission(s): 5521 Problem Description Background Profe原创 2017-11-22 10:55:52 · 186 阅读 · 0 评论 -
hdu 1281 棋盘游戏 二分图匹配;
棋盘游戏 小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些格子是可以避开的,也就是说,不在这些原创 2017-11-22 11:15:40 · 253 阅读 · 0 评论 -
hdu 2819 Swap
Swap 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 There are several test原创 2017-11-23 12:33:23 · 226 阅读 · 0 评论