![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
文章平均质量分 73
ummmmm
这个作者很懒,什么都没留下…
展开
-
【Dinic算法最大流】网络最大流 洛谷P3376
题目描述如题,给出一个网络图,以及其源点和汇点,求出其网络最大流。输入输出格式输入格式: 第一行包含四个正整数N、M、S、T,分别表示点的个数、有向边的个数、源点序号、汇点序号。接下来M行每行包含三个正整数ui、vi、wi,表示第i条有向边从ui出发,到达vi,边权为wi(即该边最大流量为wi) 输出格式: 一行,包含一个正整数,即为该网络的最大流。 ...原创 2018-07-30 10:17:10 · 141 阅读 · 0 评论 -
【dinic最大流】K - Leapin' Lizards HDU - 2732
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3704 Accepted Submission(s): 1517 Problem DescriptionYour platoon of w...原创 2018-08-02 18:41:02 · 133 阅读 · 0 评论 -
【dinic最小割 输出割边】J - Sabotage UVA - 10480
https://vjudge.net/contest/68128#problem/J/// 跑完最大流后的残余网络/// 从源点及汇点开始 分别标记能到达的点/// 遍历边 两端点标记不同即为割边/// (源点不能到达的点必与汇点连通 标记源点能到达的点)/// (遍历边 一端标记 一端未标记为割边)#include <bits/stdc++.h>...原创 2018-08-02 13:00:30 · 242 阅读 · 0 评论 -
【dinic最小割】 I - Control HDU - 4289
ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4505 Accepted Submission(s): 1865 Problem Description You, the head of Depart...原创 2018-08-01 20:28:21 · 115 阅读 · 0 评论 -
【dinic最大流】H - Food HDU - 4292
FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7398 Accepted Submission(s): 2479 Problem Description You, a part-time dining se...原创 2018-08-01 19:25:22 · 132 阅读 · 0 评论 -
【SAP最大流】G - Island Transport HDU - 4280
Island TransportTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 11475 Accepted Submission(s): 3676 Problem Description In the vast...原创 2018-08-01 10:55:52 · 197 阅读 · 0 评论 -
【匈牙利算法二分图匹配】 C - Courses HDU - 1083
CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10555 Accepted Submission(s): 4983 Problem DescriptionConsider a group of N ...原创 2018-07-28 13:16:39 · 120 阅读 · 0 评论 -
[dinic最大流 输出每条边流量] A - ACM Computer Factory POJ - 3436
ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 9232 Accepted: 3406 Special Judge DescriptionAs you know, all the computers used for ACM ...原创 2018-08-05 18:52:36 · 235 阅读 · 0 评论 -
[最短路最大流] O - Marriage Match IV HDU - 3416
Marriage Match IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5253 Accepted Submission(s): 1559 Problem DescriptionDo not sincere ...原创 2018-08-05 16:02:14 · 176 阅读 · 0 评论 -
【最小费用最大流】E - Minimum Cost POJ - 2516
Minimum CostTime Limit: 4000MS Memory Limit: 65536K Total Submissions: 18195 Accepted: 6417 DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your...原创 2018-07-31 20:17:44 · 223 阅读 · 0 评论 -
【最小费用最大流】D - Going Home POJ - 2195
Going HomeTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 24977 Accepted: 12517 DescriptionOn a grid map there are n little men and n houses. In each unit time, ever...原创 2018-07-31 17:40:25 · 193 阅读 · 0 评论 -
【费用流】 最小费用最大流 洛谷P3381
题目描述如题,给出一个网络图,以及其源点和汇点,每条边已知其最大流量和单位流量费用,求出其网络最大流和在最大流情况下的最小费用。输入输出格式输入格式: 第一行包含四个正整数N、M、S、T,分别表示点的个数、有向边的个数、源点序号、汇点序号。接下来M行每行包含四个正整数ui、vi、wi、fi,表示第i条有向边从ui出发,到达vi,边权为wi(即该边最大流量为wi),单位流量的...原创 2018-07-31 16:11:17 · 159 阅读 · 0 评论 -
【dinic最大流】C - A Plug for UNIX POJ - 1087
A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 18411 Accepted: 6394 DescriptionYou are in charge of setting up the press room for the inaugural meeti...原创 2018-07-31 11:07:31 · 161 阅读 · 0 评论 -
[dinic最大流 + 并查集 + 二分] N - Marriage Match II HDU - 3081
Marriage Match IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4899 Accepted Submission(s): 1598 Problem DescriptionPresumably, you...原创 2018-08-04 19:34:30 · 135 阅读 · 0 评论 -
【dinic最大流 二进制缩点】M - Escape HDU - 3605
EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 12433 Accepted Submission(s): 3064 Problem Description2012 If this is the end o...原创 2018-08-03 19:07:39 · 135 阅读 · 0 评论 -
【dinic最大流】 B - Dining POJ - 3281
DiningTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 21934 Accepted: 9733 DescriptionCows are such finicky eaters. Each cow has a preference for certain foods and d...原创 2018-07-30 11:59:28 · 233 阅读 · 0 评论 -
[匈牙利算法] 数量变化二分图匹配 GCPC 2017 Problem F Plug It In!
Adam just moved into his new apartment and simply placed everything into it at random. This means in particular that he did not put any effort into placing his electronics in a way that each one can h...原创 2018-09-26 13:15:12 · 337 阅读 · 0 评论