随笔分类 -  图论 -- 网络流 最大流最小割

上一页 1 2
HDU3605：Marriage Match IV
摘要：Marriage Match IV Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6230 Accepted Submission(s): 18 阅读全文
posted @ 2018-12-22 20:14 heyuhhh 阅读(161) 评论(0) 推荐(0) 编辑
HDU3338：Kakuro Extension（最大流）
摘要：Kakuro Extension Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2847 Accepted Submission(s): 983 阅读全文
posted @ 2018-12-15 21:35 heyuhhh 阅读(253) 评论(0) 推荐(0) 编辑
UVA10480:Sabotage(最小割+输出)
摘要：Sabotage 题目链接：https://vjudge.net/problem/UVA-10480 Description: The regime of a small but wealthy dictatorship has been abruptly overthrown by an unex 阅读全文
posted @ 2018-12-15 21:21 heyuhhh 阅读(236) 评论(0) 推荐(0) 编辑
HDU3605：Escape（状态压缩+最大流）
摘要：Escape Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 13271 Accepted Submission(s): 3351 题目链接：ht 阅读全文
posted @ 2018-12-15 21:11 heyuhhh 阅读(176) 评论(0) 推荐(0) 编辑
HDU3081:Marriage Match II (Floyd/并查集+二分图匹配/最大流（+二分）)
摘要：Marriage Match II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5469 Accepted Submission(s): 17 阅读全文
posted @ 2018-12-15 20:55 heyuhhh 阅读(175) 评论(0) 推荐(0) 编辑
HDU2732：Leapin' Lizards（最大流）
摘要：Leapin' Lizards Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4250 Accepted Submission(s): 1705 阅读全文
posted @ 2018-12-13 23:11 heyuhhh 阅读(164) 评论(0) 推荐(0) 编辑
HDU4289:Control（最小割）
摘要：Control Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5023 Accepted Submission(s): 2067 题目链接：ht 阅读全文
posted @ 2018-12-13 22:58 heyuhhh 阅读(187) 评论(0) 推荐(0) 编辑
HDU4292:Food(最大流)
摘要：Food Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8185 Accepted Submission(s): 2702 题目链接：http: 阅读全文
posted @ 2018-12-10 21:21 heyuhhh 阅读(223) 评论(0) 推荐(0) 编辑
HDU4280：Island Transport（最大流）
摘要：Island Transport Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 13187 Accepted Submission(s): 阅读全文
posted @ 2018-12-10 21:15 heyuhhh 阅读(201) 评论(0) 推荐(0) 编辑
POJ1459：Power Network（多源点多汇点的最大流）
摘要：Power Network 题目链接:http://poj.org/problem?id=1459 Description: A power network consists of nodes (power stations, consumers and dispatchers) connected 阅读全文
posted @ 2018-12-10 19:11 heyuhhh 阅读(841) 评论(0) 推荐(0) 编辑
POJ1087:A Plug for UNIX(最大流)
摘要：A Plug for UNIX 题目链接：https://vjudge.net/problem/POJ-1087 Description: You are in charge of setting up the press room for the inaugural meeting of the 阅读全文
posted @ 2018-12-07 22:08 heyuhhh 阅读(231) 评论(0) 推荐(0) 编辑
POJ3281:Dining(最大流)
摘要：Dining 题目链接：https://vjudge.net/problem/POJ-3281 Description: Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and 阅读全文
posted @ 2018-12-07 21:55 heyuhhh 阅读(159) 评论(0) 推荐(0) 编辑
POJ3436：ACM Computer Factory（最大流）
摘要：ACM Computer Factory 题目链接：http://poj.org/problem?id=3436 Description： As you know, all the computers used for ACM contests must be identical, so the p 阅读全文
posted @ 2018-12-03 23:28 heyuhhh 阅读(179) 评论(0) 推荐(0) 编辑
BZOJ1001:狼抓兔子（最小割最大流+vector模板）
摘要：1001: [BeiJing2006]狼抓兔子 Description 现在小朋友们最喜欢的"喜羊羊与灰太狼",话说灰太狼抓羊不到，但抓兔子还是比较在行的，而且现在的兔子还比较笨，它们只有两个窝，现在你做为狼王，面对下面这样一个网格的地形： 左上角点为(1,1),右下角点为(N,M)(上图中N=4, 阅读全文
posted @ 2018-12-01 00:23 heyuhhh 阅读(282) 评论(0) 推荐(0) 编辑

上一页 1 2