网络流
文章平均质量分 84
KinFungYu
前SCAU ACM校队队员
展开
-
poj 3155 Hard Life(最大密度子图)
Hard Life Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 6908 Accepted: 1998 Case Time Limit: 2000MS Special Judge Description John is a Chief原创 2014-11-12 20:00:30 · 904 阅读 · 0 评论 -
poj 2125 Destroying The Graph(最小割,最小点权覆盖)
Destroying The Graph Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6588 Accepted: 2081 Special Judge Description Alice and Bob play the following game.原创 2014-01-16 23:51:20 · 855 阅读 · 0 评论 -
poj 3084 Panic Room(最小割,边连通度)
Panic Room Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1813 Accepted: 928 Description You are the lead programmer for the Securitron 9042, the latest and原创 2014-01-17 16:29:51 · 834 阅读 · 0 评论 -
poj 1815 Friendship(最小点割集)
Friendship Time Limit: 2000MS Memory Limit: 20000K Total Submissions: 8465 Accepted: 2370 Description In modern society, each person has his own friends. Since all the原创 2014-01-16 17:50:53 · 1161 阅读 · 0 评论 -
poj 3680 Intervals(最大费用流+离散化)
Intervals Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 6049 Accepted: 2434 Description You are given N weighted open intervals. The ith interval covers原创 2014-01-15 17:20:18 · 865 阅读 · 0 评论 -
hdu 3251 Being a Hero(最小割,最大权闭包+输出割边)
Being a Hero Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 806 Accepted Submission(s): 255 Special Judge Problem Description You原创 2014-01-21 14:45:45 · 899 阅读 · 0 评论 -
poj 3422 Kaka's Matrix Travels(最大费用流+拆点)
Kaka's Matrix Travels Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7117 Accepted: 2841 Description On an N × N chessboard with a non-negative number in原创 2014-01-13 22:52:33 · 770 阅读 · 0 评论 -
poj 2175 Evacuation Plan(最小费用流+消圈)
Evacuation Plan Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2963 Accepted: 791 Special Judge Description The City has a number of municipal buildings原创 2014-01-13 16:16:13 · 960 阅读 · 0 评论 -
hdu 3002 King of Destruction(全局最小割,StoerWagner算法)
King of Destruction Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 975 Accepted Submission(s): 381 Problem Description Zhou xingxin原创 2014-01-21 17:42:02 · 1077 阅读 · 0 评论 -
hdu 4067 Random Maze(最小费用流)
Random Maze Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1046 Accepted Submission(s): 356 Problem Description In the game “A Chi原创 2014-01-13 21:45:16 · 822 阅读 · 0 评论 -
poj 3204 Ikki's Story I - Road Reconstruction(最小割,求关键边)
Ikki's Story I - Road Reconstruction Time Limit: 2000MS Memory Limit: 131072K Total Submissions: 6461 Accepted: 1844 Description Ikki is the king of a small country –原创 2014-01-17 22:37:43 · 851 阅读 · 0 评论 -
poj 3921 Destroying the bus stations(最小割,点连通+floyd)
Destroying the bus stations Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1562 Accepted: 512 Description Gabiluso is one of the greatest spies in his count原创 2014-01-20 19:02:09 · 812 阅读 · 0 评论 -
hdu 1280 Finding shortest path(最短路+最大流最小割)
Finding shortest path Time Limit: 1000ms Memory Limit: 65536kb Description I guess every contestant knows how to find a shortest path in a bidirectional graph, so this problem is intended to b原创 2014-02-27 21:23:33 · 1084 阅读 · 0 评论 -
sgu 176 Flow construction(有源汇上下界最小流)
Flow construction Time Limit: 500MS Memory Limit: 4096KB 64bit IO Format: %I64d & %I64u [Submit] [Go Back] [Status] Description 176. Flow constructio原创 2014-09-12 22:15:50 · 997 阅读 · 0 评论 -
poj 2396 Budget(有源汇上下界可行流)
Budget Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 5621 Accepted: 2140 Special Judge Description We are supposed to make a budget proposal for this m原创 2014-04-28 22:01:20 · 793 阅读 · 0 评论 -
zoj 3229 Shoot the Bullet(有源汇上下界最大流)
Shoot the Bullet Time Limit: 2 Seconds Memory Limit: 32768 KB Special Judge Gensokyo is a world which exists quietly beside ours, separated by a mystical border. It is a utopia wher原创 2014-04-28 18:19:58 · 837 阅读 · 0 评论 -
zoj 2314 Reactor Cooling(无源汇上下界可行流)
Reactor Cooling Time Limit: 5 Seconds Memory Limit: 32768 KB Special Judge The terrorist group leaded by a well known international terrorist Ben Bladen is buliding a nuclear reacto原创 2014-04-28 15:35:16 · 833 阅读 · 0 评论 -
whu 1124 Football Coach(最大流,判断满流)
Problem 1124 - Football Coach Time Limit: 2000MS Memory Limit: 65536KB Total Submit: 239 Accepted: 100 Special Judge: No Description It is not an easy job to be a c原创 2014-04-09 23:07:45 · 916 阅读 · 0 评论 -
uva 11248 Frequency Hopping(增加边的容量使最大流达到某个值)
Frequency Hopping Time Limit: 10000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu [Submit] [Go Back] [Status] Description E Frequency Hopping原创 2014-04-05 12:44:37 · 882 阅读 · 0 评论 -
zoj 2676 Network Wars(01分数规划+最小割)
Network Wars Time Limit: 5 Seconds Memory Limit: 32768 KB Special Judge Network of Byteland consists of n servers, connected by m optical cables. Each cable connects two servers and原创 2014-05-01 10:22:31 · 1000 阅读 · 0 评论 -
zoj 2587 Unique Attack(最小割的唯一性判定)
Unique Attack Time Limit: 5 Seconds Memory Limit: 32768 KB N supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different原创 2014-04-29 14:10:39 · 756 阅读 · 0 评论 -
hdu 3035 War(平面图最小割)
War Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1128 Accepted Submission(s): 301 Problem Description Country X is under attack原创 2014-03-18 00:07:23 · 1023 阅读 · 1 评论 -
poj 1637 Sightseeing tour(混合欧拉)
Sightseeing tour Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6937 Accepted: 2877 Description The city executive board in Lund wants to construct a sights原创 2013-12-27 21:22:37 · 618 阅读 · 0 评论 -
hdu 3667 Transportation(最小费用流+拆边)
Transportation Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1908 Accepted Submission(s): 789 Problem Description There are N citi原创 2014-01-10 22:44:12 · 844 阅读 · 0 评论 -
poj 2391 Ombrophobic Bovines(二分枚举+floyd+最大流+拆点)
Ombrophobic Bovines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12743 Accepted: 2806 Description FJ's cows really hate getting wet so much that the mere原创 2013-10-16 23:08:55 · 747 阅读 · 0 评论 -
poj 3281 Dining(最大流+拆点)
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7941 Accepted: 3622 Description Cows are such finicky eaters. Each cow has a preference for certain原创 2013-10-13 15:57:56 · 948 阅读 · 0 评论 -
poj 3189 Steady Cow Assignment(多重匹配or二分最大流)
Steady Cow Assignment Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5033 Accepted: 1740 Description Farmer John's N (1 <= N <= 1000) cows each reside in on原创 2013-10-12 22:15:21 · 1149 阅读 · 0 评论 -
poj 1149 PIGS(最大流+经典构图)
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14578 Accepted: 6479 Description Mirko works on a pig farm that consists of M locked pig-houses and Mirk原创 2013-10-13 09:56:03 · 1824 阅读 · 1 评论 -
poj 2239 Selecting Courses(二分图最大匹配or最大流)
Selecting Courses Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7633 Accepted: 3365 Description It is well known that it is not easy to select courses in t原创 2013-04-30 10:10:58 · 907 阅读 · 0 评论 -
poj 1698 Alice's Chance(最大流)
Alice's Chance Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4521 Accepted: 1907 Description Alice, a charming girl, have been dreaming of being a movie st原创 2013-10-11 16:03:58 · 740 阅读 · 0 评论 -
poj 1087 A Plug for UNIX(最大流)
A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12979 Accepted: 4328 Description You are in charge of setting up the press room for the inaug原创 2013-10-09 23:46:40 · 715 阅读 · 0 评论 -
hdu 3572 Task Schedule(最大流,判断满流+isap模版)
Task Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2371 Accepted Submission(s): 858 Problem Description Our geometry原创 2013-10-07 23:17:17 · 826 阅读 · 0 评论 -
poj 1273 Drainage Ditches(最大流 dinic模版)
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 50102 Accepted: 19026 Description Every time it rains on Farmer John's fields, a pond forms原创 2013-09-30 17:30:54 · 641 阅读 · 0 评论 -
hdu 3081 Marriage Match II(二分最大流+并查集+判断满流)
Marriage Match II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1322 Accepted Submission(s): 470 Problem Description Presumabl原创 2013-10-17 22:53:05 · 1029 阅读 · 0 评论 -
hdu 3277 Marriage Match III(二分最大流+并查集+判断满流+拆点)
Marriage Match III Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1011 Accepted Submission(s): 293 Problem Description Presuma原创 2013-10-20 21:45:00 · 926 阅读 · 0 评论 -
poj 3498 March of the Penguins(满足点容量限制的网络流)
March of the Penguins Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 3948 Accepted: 1802 Description Somewhere near the south pole, a number of penguins a原创 2013-10-28 23:47:21 · 1152 阅读 · 0 评论 -
hdu 3879 Base Station(最大权闭包)
Base Station Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 65768/32768 K (Java/Others) Total Submission(s): 1540 Accepted Submission(s): 639 Problem Description A famous mobile co原创 2013-12-23 16:44:31 · 760 阅读 · 0 评论 -
hdu 3491 Thieves(最小割)
Thieves Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1145 Accepted Submission(s): 514 Problem Description In the kingdom of Henry原创 2013-12-21 22:31:57 · 846 阅读 · 0 评论 -
hdu 1565 方格取数(1)(最小割,最大点权独立集)
方格取数(1) Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4127 Accepted Submission(s): 1578 Problem Description 给你一个n*n的格子的棋盘,每个格子里面有原创 2013-12-20 23:49:36 · 760 阅读 · 0 评论 -
hdu 3820 Golden Eggs(最小割,最大点权独立集+拆点)
Golden Eggs Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 337 Accepted Submission(s): 192 Problem Description There is a grid with原创 2013-12-21 20:13:41 · 732 阅读 · 0 评论