![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
文章平均质量分 80
笑着走完自己的路
这个作者很懒,什么都没留下…
展开
-
hdoj 1569 方格取数(2) 【最小割】 【最大点权独立集】
方格取数(2)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5589 Accepted Submission(s): 1741Problem Description给你一个m*n的格子的棋盘,每个格原创 2015-08-25 23:02:37 · 772 阅读 · 0 评论 -
poj 2914 Minimum Cut 【无向图全局最小割 Stoer-wagner算法】
Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 8379 Accepted: 3516Case Time Limit: 5000MSDescriptionGiven an undirected graph, in whi原创 2015-09-25 12:38:21 · 779 阅读 · 0 评论 -
hdoj 3605 Escape 【状态压缩构图 + 最大流】
EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 7623 Accepted Submission(s): 1635Problem Description2012 If this is the原创 2015-09-06 14:42:03 · 509 阅读 · 0 评论 -
poj 1815 Friendship 【最小割点集】【枚举删点 + 求解最小字典序】
FriendshipTime Limit: 2000MS Memory Limit: 20000KTotal Submissions: 9923 Accepted: 2742DescriptionIn modern society, each person has his own friends. Since all th原创 2015-09-14 23:38:06 · 612 阅读 · 0 评论 -
hdoj 3491 Thieves 【最小割点集】
ThievesTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1483 Accepted Submission(s): 665Problem DescriptionIn the kingdom of H原创 2015-09-14 21:56:24 · 535 阅读 · 0 评论 -
hdoj 3488 Tour 【最小费用最大流】【KM算法】
TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2299 Accepted Submission(s): 1151Problem DescriptionIn the kingdom of Hen原创 2015-08-24 16:03:32 · 1327 阅读 · 0 评论 -
hdoj 2246 Interesting Housing Problem 【最大费用最大流 or KM算法】
Interesting Housing ProblemTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2726 Accepted Submission(s): 986Problem Description原创 2015-08-28 00:11:19 · 789 阅读 · 2 评论 -
hdoj 1533 Going Home 【最小费用最大流】【KM入门题】
Going HomeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3443 Accepted Submission(s): 1763Problem DescriptionOn a grid map原创 2015-08-24 14:41:12 · 2014 阅读 · 0 评论 -
lightoj 1153 - Internet Bandwidth 【无向图最大流】
1153 - Internet BandwidthPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBOn the Internet, machines (nodes) are richly interconnect原创 2015-10-19 23:57:55 · 2008 阅读 · 0 评论 -
hdoj 3468 Treasure Hunting 【BFS找所有最短路径上的点 + 最大流】
Treasure HuntingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1635 Accepted Submission(s): 429Problem DescriptionDo you li原创 2015-10-03 16:17:58 · 906 阅读 · 0 评论 -
hdoj 2883 kebab 【时间区间离散化 + 最大流】
kebabTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1271 Accepted Submission(s): 531Problem DescriptionAlmost everyone likes原创 2015-08-30 00:36:49 · 1208 阅读 · 0 评论 -
poj 3680 Intervals 【坐标区间离散化 + 最大费用最大流】
IntervalsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7037 Accepted: 2929DescriptionYou are given N weighted open intervals. The ith interval covers原创 2015-09-05 21:51:20 · 626 阅读 · 0 评论 -
poj 2987 Firing 【最大权闭合图 输出点数和最大权值】
FiringTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 9006 Accepted: 2707DescriptionYou’ve finally got mad at “the world’s most stupid” employees of原创 2015-09-05 18:30:43 · 588 阅读 · 0 评论 -
zoj 2676 Network Wars 【0-1分数规划 + 最小割】 【吃一堑长一智】
Network WarsTime Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeNetwork of Byteland consists of n servers, connected by m optical cables. Each cable connects two servers and ca原创 2015-09-02 00:25:06 · 585 阅读 · 0 评论 -
poj 3084 Panic Room 【最小割】
Panic RoomTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1975 Accepted: 1027DescriptionYou are the lead programmer for the Securitron 9042, the latest原创 2015-09-02 14:53:59 · 797 阅读 · 0 评论 -
hdoj 3061 Battle 【最小割 之 最大权闭合图】 【入门题目】
BattleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1044 Accepted Submission(s): 499Problem Description由于小白同学近期习武十分刻苦,很快被晋升原创 2015-09-03 21:00:52 · 451 阅读 · 0 评论 -
poj 2112 Optimal Milking 【最大流 简单题】 【floyd预处理最短路 + 二分 + 最大流】
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 13910 Accepted: 5023Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K <=原创 2015-08-06 18:24:05 · 753 阅读 · 0 评论 -
hdoj 3879 Base Station 【最小割 之 最大权闭合图】
Base StationTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65768/32768 K (Java/Others)Total Submission(s): 2100 Accepted Submission(s): 885Problem DescriptionA famous mobil原创 2015-09-03 16:11:38 · 706 阅读 · 0 评论 -
hdoj 3917 Road constructions 【最小割 之 最大权闭合图】
Road constructionsTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1475 Accepted Submission(s): 489Problem DescriptionN cities原创 2015-09-03 17:32:22 · 377 阅读 · 0 评论 -
hdoj 4265 Science! 【二分 + 最大流】【求最大完美匹配数并输出完美匹配】
Science!Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 439 Accepted Submission(s): 119Special JudgeProblem DescriptionWelcom原创 2015-09-02 22:22:53 · 618 阅读 · 0 评论 -
hdoj 3996 Gold Mine 【最小割 之 最大权闭合图】
Gold MineTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2415 Accepted Submission(s): 525Problem DescriptionLong long ago, th原创 2015-09-04 12:28:25 · 484 阅读 · 0 评论 -
poj 1637 Sightseeing tour 【网络流 求解混合欧拉回路是否存在】
Sightseeing tourTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8331 Accepted: 3522DescriptionThe city executive board in Lund wants to construct a sigh原创 2015-09-09 00:41:43 · 550 阅读 · 0 评论 -
hdoj 3338 Kakuro Extension 【行进列出 最大流】
Kakuro ExtensionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1432 Accepted Submission(s): 484Special JudgeProblem Description原创 2015-10-03 16:16:34 · 593 阅读 · 0 评论 -
poj 2699 The Maximum Number of Strong Kings 【二分 + 竞赛图建模判断是否满流】
The Maximum Number of Strong KingsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1839 Accepted: 860DescriptionA tournament can be represented by a comp原创 2015-09-17 00:24:44 · 489 阅读 · 0 评论 -
hdoj 4411 Arrest 【费用流 + 最短路】
ArrestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1731 Accepted Submission(s): 682Problem DescriptionThere are (N+1) citi原创 2016-01-31 19:36:36 · 530 阅读 · 0 评论 -
zzuoj 10405: I.Earthquake 【最小割】
10405: I.EarthquakeTime Limit: 2 Sec Memory Limit: 128 MBSubmit: 19 Solved: 4[Submit][Status][Web Board]DescriptionWenchuan has had an earthquake that has struck a town.The earthquake原创 2016-03-04 17:22:58 · 362 阅读 · 0 评论 -
Codeforces 653D Delivery Bears 【二分+最大流】
题目链接:Codeforces 653D Delivery Bears原创 2016-03-21 21:09:56 · 537 阅读 · 0 评论 -
zzuoj 10459: Tutti! 【最小费用最大流】
题目链接:zzulioj 10459: Tutti!10459: Tutti! Time Limit: 10 Sec Memory Limit: 128 MB Submit: 12 Solved: 2 [Submit][Status][Web Board] Description 因为Raywzy计划在清明节去爬泰山,所以他决定在去之前好好的锻炼一下身体,跑步是很好的办法!在zz原创 2016-04-10 11:33:16 · 512 阅读 · 0 评论 -
uva 4259 - Dangerous Tunnels 【二分 + 最大流】
题目链接:uva 4259 - Dangerous TunnelsSomewhere in the world, there are two tribes separated by mountains. The two tribes are named Kulolo and Gulolo, respectively, where Kulolo is at a higher altitude a原创 2016-05-14 16:47:10 · 437 阅读 · 0 评论 -
poj 3155 Hard Life 【最大密度子图】 【0-1分数规划 + 最小割】
Hard LifeTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 7752 Accepted: 2230Case Time Limit: 2000MS Special JudgeDescriptionJohn is a Chief原创 2015-09-05 12:57:46 · 605 阅读 · 0 评论 -
网络流 dinic算法 SAP 记录
给定一个有向图(若是无向图,那么可以用两条有向边表示一条无向边),边有一个权值表示这条边上的流量,问题:有n个城市,告诉你m条路以及路上最多分分钟的车流量。然后我们求 从1 点压入无限多的车,问从n点 分分钟能跑出多少车量的问题称为 网络流(最大流)。我们称无限多进入车辆的点为:源点车辆的出口的点为:汇点 我们可以用如下结构体来记录信息:(这里用的是邻接表建图)原创 2015-06-12 12:17:26 · 636 阅读 · 0 评论 -
hdoj 5855 Less Time, More profit 【最大权闭合图】
hdoj 5855 Less Time, More profit题意:nn个工厂,mm个商店,第ii个商店在若干个工厂的支持下可以获利pro[i]pro[i],第ii个工厂需要投资pay[i]pay[i]且花费时间T[i]T[i],现在要求利润不能少于LL,问你最小的tt。就是一个裸的最大权闭合图,然后套个二分就KO了。保证图的连通,砍掉第ii个工厂当然要容量无穷大啦。#inclu原创 2016-08-17 22:16:17 · 536 阅读 · 0 评论 -
hdoj 5619 Jam's store 【最小费用最大流】
Jam's storeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 8 Accepted Submission(s): 3Problem DescriptionJam didn't study wel原创 2016-01-31 19:28:26 · 450 阅读 · 0 评论 -
poj 2391 Ombrophobic Bovines 【floyd + 二分 + 拆点网络流】
Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16494 Accepted: 3601DescriptionFJ's cows really hate getting wet so much that the mer原创 2015-08-06 23:57:56 · 534 阅读 · 0 评论 -
hdoj 4494 Teamwork 【最小费用最大流】
TeamworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 404 Accepted Submission(s): 200Problem DescriptionSome locations in c原创 2015-12-05 21:41:29 · 623 阅读 · 0 评论 -
hdoj 5457 Hold Your Hand 【字典树 + 最小割】
Hold Your HandTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 203 Accepted Submission(s): 53Problem DescriptionShe walks in原创 2015-10-05 23:27:43 · 506 阅读 · 0 评论 -
hdoj 4307 Matrix 【最大流 求解矩阵乘最值】【经典构图!】
MatrixTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1573 Accepted Submission(s): 445Problem DescriptionLet A be a 1*N matri原创 2015-09-06 16:00:00 · 676 阅读 · 0 评论 -
zoj 2539 Energy Minimization 【构建最小割模型求解 函数最值】【基础题】
Energy MinimizationTime Limit: 2 Seconds Memory Limit: 65536 KBMany of the problems that arise in early computer vision can be naturally expressed in terms of minimization of an energy fu原创 2015-09-18 16:56:45 · 783 阅读 · 0 评论 -
lightoj 1154 - Penguins 【拆点建图后枚举汇点 满流判可行解】
1154 - PenguinsPDF (English)StatisticsForumTime Limit: 4 second(s)Memory Limit: 32 MBSomewhere near the South Pole, a number of penguins are standing on原创 2015-10-24 09:19:31 · 728 阅读 · 0 评论 -
lightoj 1171 - Knights in Chessboard (II) 【奇偶图 最小割】
1171 - Knights in Chessboard (II)PDF (English)StatisticsForumTime Limit: 3 second(s)Memory Limit: 32 MBGiven an m x n chessboard where some of the cells原创 2015-10-25 13:20:38 · 717 阅读 · 0 评论