网络流
文章平均质量分 84
KinFungYu
前SCAU ACM校队队员
展开
-
poj 3155 Hard Life(最大密度子图)
Hard LifeTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 6908 Accepted: 1998Case Time Limit: 2000MS Special JudgeDescriptionJohn is a Chief原创 2014-11-12 20:00:30 · 914 阅读 · 0 评论 -
poj 2125 Destroying The Graph(最小割,最小点权覆盖)
Destroying The GraphTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6588 Accepted: 2081 Special JudgeDescriptionAlice and Bob play the following game.原创 2014-01-16 23:51:20 · 867 阅读 · 0 评论 -
poj 3084 Panic Room(最小割,边连通度)
Panic RoomTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1813 Accepted: 928DescriptionYou are the lead programmer for the Securitron 9042, the latest and原创 2014-01-17 16:29:51 · 843 阅读 · 0 评论 -
poj 1815 Friendship(最小点割集)
FriendshipTime Limit: 2000MS Memory Limit: 20000KTotal Submissions: 8465 Accepted: 2370DescriptionIn modern society, each person has his own friends. Since all the原创 2014-01-16 17:50:53 · 1174 阅读 · 0 评论 -
poj 3680 Intervals(最大费用流+离散化)
IntervalsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6049 Accepted: 2434DescriptionYou are given N weighted open intervals. The ith interval covers原创 2014-01-15 17:20:18 · 876 阅读 · 0 评论 -
hdu 3251 Being a Hero(最小割,最大权闭包+输出割边)
Being a HeroTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 806 Accepted Submission(s): 255Special JudgeProblem DescriptionYou原创 2014-01-21 14:45:45 · 919 阅读 · 0 评论 -
poj 3422 Kaka's Matrix Travels(最大费用流+拆点)
Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7117 Accepted: 2841DescriptionOn an N × N chessboard with a non-negative number in原创 2014-01-13 22:52:33 · 780 阅读 · 0 评论 -
poj 2175 Evacuation Plan(最小费用流+消圈)
Evacuation PlanTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2963 Accepted: 791 Special JudgeDescriptionThe City has a number of municipal buildings原创 2014-01-13 16:16:13 · 971 阅读 · 0 评论 -
hdu 3002 King of Destruction(全局最小割,StoerWagner算法)
King of DestructionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 975 Accepted Submission(s): 381Problem DescriptionZhou xingxin原创 2014-01-21 17:42:02 · 1093 阅读 · 0 评论 -
hdu 4067 Random Maze(最小费用流)
Random MazeTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1046 Accepted Submission(s): 356Problem DescriptionIn the game “A Chi原创 2014-01-13 21:45:16 · 834 阅读 · 0 评论 -
poj 3204 Ikki's Story I - Road Reconstruction(最小割,求关键边)
Ikki's Story I - Road ReconstructionTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 6461 Accepted: 1844DescriptionIkki is the king of a small country –原创 2014-01-17 22:37:43 · 863 阅读 · 0 评论 -
poj 3921 Destroying the bus stations(最小割,点连通+floyd)
Destroying the bus stationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1562 Accepted: 512DescriptionGabiluso is one of the greatest spies in his count原创 2014-01-20 19:02:09 · 828 阅读 · 0 评论 -
hdu 1280 Finding shortest path(最短路+最大流最小割)
Finding shortest pathTime Limit: 1000msMemory Limit: 65536kbDescriptionI 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 · 1097 阅读 · 0 评论 -
sgu 176 Flow construction(有源汇上下界最小流)
Flow constructionTime Limit: 500MS Memory Limit: 4096KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] Description176. Flow constructio原创 2014-09-12 22:15:50 · 1012 阅读 · 0 评论 -
poj 2396 Budget(有源汇上下界可行流)
BudgetTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5621 Accepted: 2140 Special JudgeDescriptionWe are supposed to make a budget proposal for this m原创 2014-04-28 22:01:20 · 804 阅读 · 0 评论 -
zoj 3229 Shoot the Bullet(有源汇上下界最大流)
Shoot the BulletTime 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 · 849 阅读 · 0 评论 -
zoj 2314 Reactor Cooling(无源汇上下界可行流)
Reactor CoolingTime 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 · 847 阅读 · 0 评论 -
whu 1124 Football Coach(最大流,判断满流)
Problem 1124 - Football Coach Time Limit: 2000MS Memory Limit: 65536KB Total Submit: 239 Accepted: 100 Special Judge: No DescriptionIt is not an easy job to be a c原创 2014-04-09 23:07:45 · 929 阅读 · 0 评论 -
uva 11248 Frequency Hopping(增加边的容量使最大流达到某个值)
Frequency HoppingTime Limit: 10000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionE Frequency Hopping原创 2014-04-05 12:44:37 · 894 阅读 · 0 评论 -
zoj 2676 Network Wars(01分数规划+最小割)
Network WarsTime 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 · 1020 阅读 · 0 评论 -
zoj 2587 Unique Attack(最小割的唯一性判定)
Unique AttackTime 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 · 772 阅读 · 0 评论 -
hdu 3035 War(平面图最小割)
WarTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1128 Accepted Submission(s): 301Problem DescriptionCountry X is under attack原创 2014-03-18 00:07:23 · 1034 阅读 · 1 评论 -
poj 1637 Sightseeing tour(混合欧拉)
Sightseeing tourTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6937 Accepted: 2877DescriptionThe city executive board in Lund wants to construct a sights原创 2013-12-27 21:22:37 · 625 阅读 · 0 评论 -
hdu 3667 Transportation(最小费用流+拆边)
TransportationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1908 Accepted Submission(s): 789Problem DescriptionThere are N citi原创 2014-01-10 22:44:12 · 857 阅读 · 0 评论 -
poj 2391 Ombrophobic Bovines(二分枚举+floyd+最大流+拆点)
Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12743 Accepted: 2806DescriptionFJ's cows really hate getting wet so much that the mere原创 2013-10-16 23:08:55 · 755 阅读 · 0 评论 -
poj 3281 Dining(最大流+拆点)
DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7941 Accepted: 3622DescriptionCows are such finicky eaters. Each cow has a preference for certain原创 2013-10-13 15:57:56 · 960 阅读 · 0 评论 -
poj 3189 Steady Cow Assignment(多重匹配or二分最大流)
Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5033 Accepted: 1740DescriptionFarmer John's N (1 <= N <= 1000) cows each reside in on原创 2013-10-12 22:15:21 · 1161 阅读 · 0 评论 -
poj 1149 PIGS(最大流+经典构图)
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14578 Accepted: 6479DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirk原创 2013-10-13 09:56:03 · 1834 阅读 · 1 评论 -
poj 2239 Selecting Courses(二分图最大匹配or最大流)
Selecting CoursesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7633 Accepted: 3365DescriptionIt is well known that it is not easy to select courses in t原创 2013-04-30 10:10:58 · 918 阅读 · 0 评论 -
poj 1698 Alice's Chance(最大流)
Alice's ChanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4521 Accepted: 1907DescriptionAlice, a charming girl, have been dreaming of being a movie st原创 2013-10-11 16:03:58 · 751 阅读 · 0 评论 -
poj 1087 A Plug for UNIX(最大流)
A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12979 Accepted: 4328DescriptionYou are in charge of setting up the press room for the inaug原创 2013-10-09 23:46:40 · 745 阅读 · 0 评论 -
hdu 3572 Task Schedule(最大流,判断满流+isap模版)
Task ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2371 Accepted Submission(s): 858Problem DescriptionOur geometry原创 2013-10-07 23:17:17 · 834 阅读 · 0 评论 -
poj 1273 Drainage Ditches(最大流 dinic模版)
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 50102 Accepted: 19026DescriptionEvery time it rains on Farmer John's fields, a pond forms原创 2013-09-30 17:30:54 · 652 阅读 · 0 评论 -
hdu 3081 Marriage Match II(二分最大流+并查集+判断满流)
Marriage Match IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1322 Accepted Submission(s): 470Problem DescriptionPresumabl原创 2013-10-17 22:53:05 · 1045 阅读 · 0 评论 -
hdu 3277 Marriage Match III(二分最大流+并查集+判断满流+拆点)
Marriage Match IIITime Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1011 Accepted Submission(s): 293Problem DescriptionPresuma原创 2013-10-20 21:45:00 · 938 阅读 · 0 评论 -
poj 3498 March of the Penguins(满足点容量限制的网络流)
March of the PenguinsTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 3948 Accepted: 1802DescriptionSomewhere near the south pole, a number of penguins a原创 2013-10-28 23:47:21 · 1164 阅读 · 0 评论 -
hdu 3879 Base Station(最大权闭包)
Base StationTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65768/32768 K (Java/Others)Total Submission(s): 1540 Accepted Submission(s): 639Problem DescriptionA famous mobile co原创 2013-12-23 16:44:31 · 770 阅读 · 0 评论 -
hdu 3491 Thieves(最小割)
ThievesTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1145 Accepted Submission(s): 514Problem DescriptionIn the kingdom of Henry原创 2013-12-21 22:31:57 · 854 阅读 · 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): 1578Problem Description给你一个n*n的格子的棋盘,每个格子里面有原创 2013-12-20 23:49:36 · 769 阅读 · 0 评论 -
hdu 3820 Golden Eggs(最小割,最大点权独立集+拆点)
Golden EggsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 337 Accepted Submission(s): 192Problem DescriptionThere is a grid with原创 2013-12-21 20:13:41 · 745 阅读 · 0 评论