网络流相关
文章平均质量分 84
mengxiang000000
这个作者很懒,什么都没留下…
展开
-
UvaLive 7037 The Problem Needs 3D Arrays 【最大密度子图-最大权闭合子图做法】
题目大意:现在让我们求一个子序列(逆序数/子序列长度)的最大值。思路:经典的最大密度子图问题①首先用到01分数规划。因为要求X/Y的最大值,那么我们可以定义:F(Mid)=X-Mid*Y如果有F(MID)>=0,那么就有:X-mid*Y>=0,那么就有X/Y>=Mid那么观察到问题具有单调性,那么Mid的值,我们二分处理即可。原创 2017-10-05 15:21:11 · 453 阅读 · 0 评论 -
hdu 3126 Nova【计算几何+二分+最大流Dinic】好题
NovaTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1349 Accepted Submission(s): 253Problem DescriptionThe Lich is a powerful h原创 2016-10-11 16:11:54 · 408 阅读 · 0 评论 -
hdu 4859 海岸线【最小割---------Dinic】
海岸线Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 288 Accepted Submission(s): 164Problem Description欢迎来到珠海!由于土地资源越来越紧张,使得许多海原创 2016-09-21 16:45:15 · 389 阅读 · 0 评论 -
Codeforces 362 E Petya and Pipes【费用流】好题
E. Petya and Pipestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA little boy Petya dreams of growing up and becomin原创 2016-09-08 16:26:12 · 1489 阅读 · 0 评论 -
hdu 4862 Jump 【最小费用最大流】好题
JumpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1405 Accepted Submission(s): 597Problem DescriptionThere are n*m grids, each原创 2016-09-23 15:10:21 · 377 阅读 · 0 评论 -
hdu 5889 Barricade【最短路SPFA+最小割--------Dinic】
BarricadeTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 759 Accepted Submission(s): 224Problem DescriptionThe empire is under at原创 2016-09-19 16:06:53 · 474 阅读 · 0 评论 -
hdu 2883 kebab【最大流Dinic+缩点】
kebabTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1623 Accepted Submission(s): 688Problem DescriptionAlmost everyone likes keb原创 2016-08-15 10:48:42 · 720 阅读 · 0 评论 -
Codeforces 510 E Fox And Dinner【预处理素数+建图+最大流Dinic】好题
E. Fox And Dinnertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is participating in a party in Prime Kingd原创 2016-09-06 11:28:53 · 910 阅读 · 0 评论 -
Codeforces 653 D Delivery Bears【二分+最大流】
D. Delivery Bearstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNiwel is a little golden bear. As everyon原创 2016-09-05 23:57:32 · 563 阅读 · 0 评论 -
Poj 2455 Secret Milking Machine【二分+最大流】
Secret Milking MachineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11570 Accepted: 3354DescriptionFarmer John is constructing a new原创 2016-08-26 11:01:11 · 740 阅读 · 0 评论 -
Codeforces 546 E Soldier and Traveling【最大流Dinic+判断残余网络】
E. Soldier and Travelingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the country there are n cities andm bidirectional ro原创 2016-09-05 15:35:24 · 782 阅读 · 0 评论 -
hdu 3996 Gold Mine【最大权闭包-----最小割最大流Dinic】
Gold MineTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2700 Accepted Submission(s): 592Problem DescriptionLong long ago, there原创 2016-08-25 19:18:08 · 716 阅读 · 0 评论 -
hdu 2063 过山车【最大流Dinic】= =作死真好玩系列
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18690 Accepted Submission(s): 8150Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可原创 2016-08-13 14:27:33 · 784 阅读 · 0 评论 -
hdu 2485 Destroying the bus stations【最大流Dinic+最短路floyd】好题
Destroying the bus stationsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2619 Accepted Submission(s): 879Problem DescriptionGab原创 2016-08-13 13:52:32 · 911 阅读 · 0 评论 -
Poj 3228 Gold Transportation【二分+最大流Dinic】
Gold TransportationTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3281 Accepted: 1159DescriptionRecently, a number of gold mines have been discovered原创 2016-09-04 13:51:56 · 442 阅读 · 1 评论 -
Poj 2584 T-Shirt Gumbo【最大流】
T-Shirt GumboTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3164 Accepted: 1481DescriptionBoudreaux and Thibodeaux are student volunteers for this ye原创 2016-08-24 21:31:16 · 453 阅读 · 0 评论 -
Poj 1966 Cable TV Network【点连通度------最大流Dinic】
Cable TV NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4656 Accepted: 2149DescriptionThe interconnection of the relays in a cable TV network原创 2016-09-03 19:54:14 · 1093 阅读 · 0 评论 -
hdu 3998 Sequence【dp+拆点+最大流--------Dinic】
SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2186 Accepted Submission(s): 789Problem DescriptionThere is a sequence X原创 2016-09-15 13:37:20 · 361 阅读 · 0 评论 -
hdu 4971 A simple brute force problem.【最小权闭包】
A simple brute force problem.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 729 Accepted Submission(s): 381Problem DescriptionTh原创 2016-10-22 16:01:11 · 341 阅读 · 0 评论 -
Poj 3068 "Shortest" pair of paths【拆点+最小费用最大流】
"Shortest" pair of pathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1288 Accepted: 545DescriptionA chemical company has an unusual shortest path p原创 2016-09-28 13:11:54 · 559 阅读 · 0 评论 -
Codeforces 322D Ciel and Duel【思维+费用流】
D. Ciel and Dueltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is playing a card game with her f原创 2017-09-28 17:57:24 · 327 阅读 · 0 评论 -
Hdu 6214 Smallest Minimum Cut【Dinic-最大流最小割】
Smallest Minimum CutTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 740 Accepted Submission(s): 285Problem DescriptionConside原创 2017-09-18 15:30:31 · 548 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 J.Our Journey of Dalian Ends【最小费用最大流】
Life is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unexpected people.Now our journey of Dalian ends. To be carefully considered are the原创 2017-09-13 15:10:56 · 476 阅读 · 0 评论 -
GYM 101128 F.Landscaping【最小割--Dinic】
题目大意:给你一个N*M的矩阵,其中“#”代表高地,“.”代表低地,我们有N+M辆车,从高地转到低地需要花费A,我们使得高地变成低地或者是使得低地变成高地的花费为B.我们的车每列从上到下,每行从左到右行驶,问最小花费是多少。思路:很显然我们不能直接Dp,因为我们当前的块如果变化了,会对之前很多结果进行了影响,我们考虑多加维度取消这个后效性无果,不妨考虑网络流原创 2017-08-21 11:29:53 · 469 阅读 · 0 评论 -
2017"百度之星"程序设计大赛 - 初赛(B)1005.度熊的交易计划【最小费用流】
度度熊的交易计划 Accepts: 460 Submissions: 2329 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description度度熊参与了喵哈哈村的商业大会,但是这次商业大会遇原创 2017-08-13 17:50:52 · 916 阅读 · 1 评论 -
2016 计蒜之道 复赛 菜鸟物流的运输网络【拆点+思维建图+网络流】
菜鸟物流的运输网络菜鸟物流有自己的运输网络,网络中包含 nn 个城市物流集散中心,和 mm 对城市之间的运输线路(线路是双向的)。菜鸟物流允许淘宝卖家自行确定包裹的运输路径,但只有一条限制规则:不允许经过重复的城市。淘宝卖家小明从 aa 城市寄出快递后,希望包裹在 midmid 城市进行包装加工以后再寄往 bb 城市。现在小明希望算出一个满足他需求的合法运输路径,你可以帮他算出来么?原创 2017-06-09 13:21:07 · 964 阅读 · 0 评论 -
LibreOJ β Round F. ZQC 的游戏【思维建图+最大流】
F. ZQC 的游戏内存限制: 256 MiB时间限制: 1000 ms标准输入输出转到题库提交记录返回比赛题目描述Agar.io 是一款流行的游戏,每个玩家在二维平面上控制一个球。我们对游戏进行下列简化:现在有 n(1≤n≤100) n(1 \leq n \leq 100)n(1≤n≤100) 个玩家(包括原创 2017-06-17 11:57:39 · 767 阅读 · 0 评论 -
ZZULIOJ 2131 Can Win【思维建图+最大流】
2131: Can WinTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 479 Solved: 61SubmitStatusWeb BoardDescriptionZhc很喜欢看某个竞技比赛,比赛的规则是这样的:队伍分成AB两组进行比赛,除了组内比赛,两组之间还会进行一定的比赛,每场比赛赢者得1分,输者不得分,没有平原创 2017-05-17 23:18:24 · 362 阅读 · 1 评论 -
CSU 1506 Double Shortest Paths【最小费用最大流】
1506: Double Shortest PathsSubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 410 Solved: 134 DescriptionInputThere will be at原创 2017-05-06 15:38:04 · 416 阅读 · 0 评论 -
Codeforces 808F Card Game【思维建图+最小割】
F. Card Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDigital collectible card games have become very popular原创 2017-05-25 13:21:53 · 1100 阅读 · 0 评论 -
ZZULIOJ 1875 蛤玮的财宝【最大费用流】
1875: 蛤玮的财宝Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 599 Solved: 138SubmitStatusWeb BoardDescription蛤玮和他的妹子出海游玩,不小心遭遇了海难,他们醒来之后发现自己到了一座金银岛.岛主非常好心的告诉他们在岛的另一边有船可以送他们回家.这座岛可以看成n*m原创 2017-05-24 18:51:22 · 342 阅读 · 0 评论 -
Poj 3436 ACM Computer Factory【最大流Dinic+建图】
ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7353 Accepted: 2617 Special JudgeDescriptionAs you know, all the computers use原创 2016-12-30 13:16:02 · 436 阅读 · 0 评论 -
【哈理工OJ 750题纪念!】Hrbust 2200 Escaping【建图+最大流-------Dinic】
EscapingTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 36(19 users)Total Accepted: 5(5 users)Rating: Special Judge: NoDescriptionOne原创 2016-11-23 15:08:38 · 687 阅读 · 2 评论 -
hdu 3452 Bonsai【最大流最小割-------Dinic】
BonsaiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 995 Accepted Submission(s): 499Problem DescriptionAfter being assaulted原创 2016-11-22 18:05:45 · 397 阅读 · 0 评论 -
hrbust 1798 秘密产奶机器【二分+最大流】
秘密产奶机器Time Limit: 6000 MSMemory Limit: 32768 KTotal Submit: 11(7 users)Total Accepted: 7(6 users)Rating: Special Judge: NoDescriptionJohn正在建原创 2016-10-06 12:25:25 · 472 阅读 · 0 评论 -
Poj 3921 Destroying the bus stations【最小费用流】
Destroying the bus stationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2266 Accepted: 715DescriptionGabiluso is one of the greatest spies in his c原创 2016-09-29 11:46:25 · 965 阅读 · 0 评论 -
hrbust 1716 双狙人【费用流Min_Cost_Max_flow】
双狙人Time Limit: 1000 MSMemory Limit: 32768 K Total Submit: 27(13 users)Total Accepted: 15(12 users)Rating: Special Judge: No原创 2016-08-09 17:11:19 · 460 阅读 · 0 评论 -
hdu 3488 Tour【最小费用最大流】
TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2992 Accepted Submission(s): 1457Problem DescriptionIn the kingdom of Henryy,原创 2016-09-15 12:18:53 · 344 阅读 · 0 评论 -
Poj 3204 Ikki's Story I - Road Reconstruction【最大流Dinic+可行方案边数统计】
Ikki's Story I - Road ReconstructionTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 7546 Accepted: 2185DescriptionIkki is the king of a small count原创 2016-08-12 11:51:59 · 810 阅读 · 0 评论 -
hdu 3416 Marriage Match IV【SPFA+最大流Dinic】
Marriage Match IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3417 Accepted Submission(s): 1019Problem DescriptionDo not since原创 2016-08-12 09:16:29 · 664 阅读 · 0 评论