随笔分类 - 二分图匹配
摘要:SwapGiven 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 ...
阅读全文
摘要:棋盘游戏小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。所...
阅读全文
摘要:A Bug's Life Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17246 Accepte...
阅读全文
摘要:Courses Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determin...
阅读全文
摘要:The Accomodation of StudentsThere are a group of students. Some of them may know each other, while others don't. For example, A and B ...
阅读全文
摘要:Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12961 Accepted Subm...
阅读全文

浙公网安备 33010602011771号