网络流问题
Detective-Conan
且随疾风前行 身后亦须留心
展开
-
(模板题)poj 1459 Power Network(Edmonds-Karp算法求最大流)
Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 26991 Accepted: 14034 Description A power network consists of nodes (power stations, consumer原创 2016-08-01 09:06:05 · 520 阅读 · 0 评论 -
poj 3436 ACM Computer Factory
ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6912 Accepted: 2448 Special Judge Description As you know, all the computers used原创 2016-08-01 16:21:14 · 315 阅读 · 0 评论 -
poj 2516 Minimum(SPFA解决最小费用最大流)
Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 16007 Accepted: 5614 Description Dearboy, a goods victualer, now comes to a big problem, and h原创 2016-09-26 19:10:47 · 313 阅读 · 0 评论 -
poj 2195 Going Home(二分图最优匹配KM算法)
Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21805 Accepted: 11032 Description On a grid map there are n little men and n houses. In each uni原创 2016-09-27 08:46:13 · 370 阅读 · 0 评论 -
poj 3155 Hard Life
Hard Life Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 8495 Accepted: 2468 Case Time Limit: 2000MS Special Judge Description John is a Chief原创 2016-11-06 17:42:44 · 254 阅读 · 0 评论 -
poj 3422 Kaka's Matrix Travels
Kaka's Matrix Travels Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9453 Accepted: 3840 Description On an N × N chessboard with a non-negative number in原创 2016-09-29 20:42:10 · 257 阅读 · 0 评论 -
(模板题)poj 3308 Paratroopers(Dinic算法最大流)
Paratroopers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8481 Accepted: 2554 Description It is year 2500 A.D. and there is a terrible war between the f原创 2016-10-29 14:26:35 · 406 阅读 · 0 评论 -
(模板题)loj #127. 最大流 加强版(hlpp)
题目链接:https://loj.ac/problem/127 最大流hlpp模板(原作者是xehoth,我就改了改拿来用用) 请根据题目要求做修改。 Note:可将vector改为链式前向星,代码我就不贴出来了,如有需要请私信我。 update(2018.9.29): 算是对这个板子的总结。 在检验板子的时候发现这个东西跑网络流时间下限较高,但上限小,适合跑边数多的图,毕竟O(),时...原创 2018-08-24 16:14:07 · 1329 阅读 · 0 评论