随笔分类 - 图论 二分匹配
摘要:Land of Farms Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 539 Accepted Submission(s): 177 Pro
阅读全文
摘要:Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 15682 Accepted: 5597 Case Time Limit: 1000MS Description FJ has moved his K
阅读全文
摘要:Muddy Fields Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9754 Accepted: 3618 Description Rain has pummeled the cows' field, a rectangul
阅读全文
摘要:Purifying Machine Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5004 Accepted: 1444 Description Mike is the owner of a cheese factory. He
阅读全文
摘要:Kindergarten Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6191 Accepted: 3052 Description In a kindergarten, there are a lot of kids. Al
阅读全文
摘要:Girls and Boys Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 11694 Accepted: 5230 Description In the second year of the university somebo
阅读全文
摘要:题意:在通讯录中有N个人,每个人能可能属于多个group,现要将这些人分组m组,设各组中的最大人数为max,求出该最小的最大值 下面用的是朴素的查找,核心代码find_path复杂度是VE的,不过据说可以用DINIC跑二分图可以得到sqrt(v)*E的
阅读全文
摘要:题意:见挑战230页 分析:强大的二分匹配(因为一个门一时刻只能通过一个人),这是我的做法,用的是枚举时间 不过看挑战上是直接枚举时间和门组成的二元组的点,每次dfs该点,进行一次匈牙利算法,最后再算出时间 好像程序可以简化一点,不过我的这份代码的效率比较高,排名在270多名,不过开的数组大小很关键
阅读全文

浙公网安备 33010602011771号