
图论:网络流
文章平均质量分 84
Killerfear
这个作者很懒,什么都没留下…
展开
-
(beginer) 最小费用最大流 UVA 10806 - Dijkstra, Dijkstra.
Problem ?Dijkstra, Dijkstra.Time Limit: 10 seconds Dexter: "You don't understand. I can't walk...they've tied my shoelaces together."Topper Harley: "A knot. Bastards!" Jim Abrahams and Pat Pr原创 2014-02-08 09:55:26 · 765 阅读 · 0 评论 -
(intermediate) 带下界的最小流 UVA 1440 - Inspection
You are in charge of a team that inspects a new ski resort. A ski resort is situated on several mountains and consists of a number of slopes. Slopes are connected with each other, forking and joining.原创 2014-03-06 20:39:41 · 1313 阅读 · 0 评论 -
(intermediate) 最小费用流 UVA 12092 - Paint the Roads
HPaint the RoadsInput: Standard InputOutput: Standard Output In a country there are n cities connected by m one way roads. You can paint any of these roads. To paint a road i原创 2014-03-07 15:30:35 · 758 阅读 · 0 评论 -
(beginer) UVA 最小费用流 1349 Optimal Bus Route Design
A big city wants to improve its bus transportation system. One of the improvement is to add scenic routes which go es through attractive places. Your task is to construct a bus-route-plan for sight-se原创 2014-03-24 18:54:26 · 799 阅读 · 0 评论 -
(intermediate) 混合图欧拉回路 UVA 10735 - Euler Circuit
Problem DEuler CircuitInput: standard inputOutput: standard outputTime Limit: 2 secondsAn Euler circuit is a graph traversal starting and ending at the same vertex and using every edge exact原创 2014-03-27 00:25:12 · 1116 阅读 · 0 评论 -
最小割 UVA 1515 Pool construction
Pool construction原创 2014-07-30 11:30:41 · 738 阅读 · 0 评论 -
网络流 UVA 12264 Risk
F RiskRisk is a board game played on a world map. This world is divided into regions by borders. Each region is controlled by a player (either you or one of your opponents). Any region that y原创 2014-07-29 21:13:54 · 750 阅读 · 0 评论 -
网络流 UVA 11544 Recruiter's Problem
Problem GRecruiter's Problem Input: Standard InputOutput: Standard Output You are working as an HR officer in “Nice Computer Programmer's Company(NCPC)”. You have to hire a lot of people in原创 2014-07-30 08:16:08 · 741 阅读 · 0 评论 -
0-1规划 UVA 1389 Hard Life
John is a Chief Executive Officer at a privately owned medium size company. The owner of the company has decided to make his son Scott a manager in the company. John fears that the owner will ultimate原创 2014-07-31 09:24:19 · 652 阅读 · 0 评论 -
BZOJ 最小费用流最大流 1070: [SCOI2007]修车
题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1070原创 2014-08-28 21:57:50 · 586 阅读 · 0 评论 -
(intermediate) UVA 带下界的网络流 1369 - Travel
Kim works in a traveling agency in Korea. Recently, his foreign customer gave him an international call and asked him to make a travel plan in Korea. The customer wants to visit two famous roads along原创 2014-03-11 17:54:06 · 825 阅读 · 0 评论 -
(intermediate) 网络流:矩阵模型 UVA 11082 - Matrix Decompressing
Problem IMatrix DecompressingInput: Standard InputOutput: Standard Output Some RxC matrix of positive integers is encoded and represented by its R cumulative row sum and C column sum entries原创 2014-03-04 17:20:27 · 1447 阅读 · 0 评论 -
(beginer) 网络流(最大流+二分) UVA 1345 - Jamie\'s Contact Groups
Jamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list has become so long that it often takes a long time for h原创 2014-02-08 09:55:28 · 1025 阅读 · 0 评论 -
(beginer)网络流(最小割最大流) UVA 1212 - Duopoly
The mobile network market in country XYZ used to be dominated by two large corporations, XYZ Telecom and XYZ Mobile. The central government recently has realized that radio frequency spectrum is a s原创 2014-02-08 09:55:37 · 624 阅读 · 0 评论 -
(beginer) 网络流 UVA 10249 - The Grand Dinner
Problem DThe Grand DinnerInput: standard inputOutput: standard outputTime Limit: 15 secondsMemory Limit: 32 MB Each team participating in this year’s ACM World Finals contest is expected to原创 2014-02-08 09:55:45 · 627 阅读 · 0 评论 -
(beginer) 网络流(拆点)UVA 12125 - March of the Penguins
Problem B - March of the PenguinsTime limit: 4 secondsSomewhere near the south pole, a number of penguins are standing on a number of ice floes. Being social animals, the penguins would like to get原创 2014-02-08 09:55:35 · 705 阅读 · 0 评论 -
(beginer) 网络流(拆点+时序模型) UVA 1161 - Objective: Berlin
Objective: Berlin The administration of a well-known football team has made a study about the lack of support in international away games. This study has concluded that the only reason for this原创 2014-02-08 09:55:33 · 785 阅读 · 0 评论 -
(beginer) 网络流(区间模型+最大费用流) UVA 1317 Concert Hall Scheduling
You are appointed director of a famous concert hall, to save it from bankruptcy. The hall is very popular, and receives many requests to use its two fine rooms, but unfortunately the previous direct原创 2014-02-08 09:55:40 · 816 阅读 · 0 评论 -
(beginer) 网络流(最小费用流+费用跟流量有关) UVA 1486 - Transportation
There are N cities, and M directed roads connecting them. Now you want to transport K units of goods from city 1 to city N. There are many robbers on the road, so you must be very careful. The more原创 2014-02-08 09:55:42 · 899 阅读 · 0 评论 -
(beginer) 网络流(拆点) UVA 563 Crimewave
Crimewave Nieuw Knollendam is a very modern town. This becomes clear already when looking at the layout of its map, which is just a rectangular grid of streets and avenues. Being an impo原创 2014-03-03 16:16:26 · 803 阅读 · 0 评论 -
(intermediate) 网络流(时序模型+离散化) UVA 11167 - Monkeys in the Emei Mountain
Problem CMonkeys in the Emei MountainInput: Standard InputOutput: Standard Output Xuexue is a pretty monkey living in the Emei mountain. She is extremely thirsty during time 2 and time 9 ev原创 2014-03-03 22:35:37 · 1620 阅读 · 0 评论 -
BZOJ 1066: [SCOI2007]蜥蜴
题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1066代码:原创 2014-08-30 12:00:47 · 443 阅读 · 0 评论