网络流
文章平均质量分 91
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
OPTM-Optimal Marks-SPOJ839最小割
You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range [0..231 – 1]. Different vertexes may have the same mark.For an edge (u, v), we define Cost(u, v) = m原创 2016-02-26 11:42:14 · 2084 阅读 · 0 评论 -
Drainage Ditches
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 62016 Accepted: 23808 Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s fav原创 2015-07-29 15:01:34 · 470 阅读 · 0 评论 -
PIGS
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 18209 Accepted: 8277Description Mirko works on a pig farm that consists of M locked pig-houses and Mirko can’t unlock any原创 2015-08-10 09:15:17 · 448 阅读 · 0 评论 -
A Plug for UNIX
A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14786 Accepted: 4994Description You are in charge of setting up the press room for the inaugural meeting of the原创 2015-08-10 14:18:05 · 296 阅读 · 0 评论 -
Ombrophobic Bovines
Ombrophobic Bovines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16539 Accepted: 3605Description FJ’s cows really hate getting wet so much that the mere thought of getting原创 2015-08-10 20:32:41 · 385 阅读 · 0 评论 -
ACM Computer Factory
ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6104 Accepted: 2113 Special JudgeDescriptionAs you know, all the computers used for ACM contests must be原创 2015-08-11 10:48:34 · 709 阅读 · 0 评论 -
Sightseeing tour
Sightseeing tour Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8276 Accepted: 3489Description The city executive board in Lund wants to construct a sightseeing tour by bus in L原创 2015-08-11 20:41:48 · 577 阅读 · 0 评论 -
Dual Core CPU
Dual Core CPU Time Limit: 15000MS Memory Limit: 131072K Total Submissions: 20935 Accepted: 9054 Case Time Limit: 5000MSDescriptionAs more and more computers are equipped with dual core CP原创 2015-08-12 08:39:33 · 853 阅读 · 0 评论 -
Paratroopers
Paratroopers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7881 Accepted: 2373DescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the原创 2015-08-12 12:24:07 · 585 阅读 · 0 评论 -
Friendship
Friendship Time Limit: 2000MS Memory Limit: 20000K Total Submissions: 9824 Accepted: 2720Description In modern society, each person has his own friends. Since all the people are very busy,原创 2015-08-12 15:33:30 · 369 阅读 · 0 评论 -
Cable TV Network-POJ1966图的连通度
Cable TV Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4404 Accepted: 2047 DescriptionThe interconnection of the relays in a cable TV network is bi-directional. Th原创 2016-01-09 16:45:47 · 720 阅读 · 0 评论 -
Internship-ZOJ2532(网络流求割边)
InternshipTime Limit: 5 Seconds Memory Limit: 32768 KB CIA headquarter collects data from across the country through its classified network. They have been usingoptical fibres long befo原创 2016-01-21 14:23:58 · 902 阅读 · 8 评论 -
Evacuation Plan-POJ2175最小费用消圈算法
Time Limit: 1000MS Memory Limit: 65536KSpecial JudgeDescriptionThe City has a number of municipal buildings and a number of fallout shelters that were build specially to hide municipal workers in cas原创 2016-02-24 10:18:12 · 1465 阅读 · 0 评论 -
Network Wars-ZOJ2676最小割+01规划
Time 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 can transmit data in both dir原创 2016-02-26 09:30:24 · 1528 阅读 · 0 评论 -
【SDUT2414】An interesting game——最小费用
题目描述 Xiao Ming recently designs a little game, in front of player there are N small hillsides put in order, now Xiao Ming wants to increase some hillsides to block the player, so he prepared another M原创 2016-03-20 20:52:00 · 513 阅读 · 0 评论