
最短路
文章平均质量分 79
Techay
我是为了c币才写的简介
展开
-
Silver Cow Party(边取反最短路)
Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional原创 2015-10-18 23:13:38 · 608 阅读 · 0 评论 -
The Shortest Path in Nya Graph(神一样的建图)
Description This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this para原创 2015-10-30 19:34:22 · 623 阅读 · 0 评论 -
Candies(差数约分系统-最短路)
During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the原创 2015-10-30 18:43:15 · 611 阅读 · 0 评论 -
Extended Traffic(spfa判负环)
Description Dhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoid shortest routes, and hence the crowded roads, to re原创 2015-10-30 19:09:58 · 527 阅读 · 0 评论 -
Tram(转换为最短路模型)
Description Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the in原创 2015-10-30 19:01:43 · 660 阅读 · 0 评论 -
Subway(最短路)
http://blog.youkuaiyun.com/catglory/article/details/49342213 这个写得比较好,图画的也不错,转载了。题目链接:[POJ 2502]Subway[最短路] 题意分析: 你从A到B上学,可以选择走路或者到地铁站搭乘地铁到达,走路速度10km/h,地铁速度40km/h,你可以任意站点下车上车,问:最快要多少分钟到达学校? 解题思路: 建图求转载 2015-10-30 18:53:02 · 488 阅读 · 0 评论 -
0 or 1(最短路转化)
Description Given a n*n matrix C ij (1<=i,j<=n),We want to find a n*n matrix X ij (1<=i,j<=n),which is 0 or 1. Besides,X ij meets the following conditions: 1.X 12+X 13+…X 1n=1 2.X 1n+X 2n+…X n-1n=1原创 2015-10-30 19:47:13 · 1020 阅读 · 0 评论 -
昂贵的聘礼(坑爹的枚举+bellmanford)
Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:”嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。”探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,原创 2015-10-30 18:57:37 · 590 阅读 · 0 评论 -
MPI Maelstrom(最短路)
Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee’s r原创 2015-10-18 23:22:16 · 388 阅读 · 0 评论 -
Currency Exchange(bellman-Ford)
Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencie原创 2015-10-18 23:16:51 · 403 阅读 · 0 评论 -
Invitation Cards(最短路)
Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Com原创 2015-10-18 23:25:45 · 665 阅读 · 0 评论 -
Frogger(链式前向星+spfa小改动)
Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of t原创 2015-10-18 23:04:29 · 413 阅读 · 0 评论 -
Til the Cows Come Home(链式前向星+spfa)
Description Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wa原创 2015-10-18 23:01:12 · 347 阅读 · 0 评论 -
Arbitrage(bellman-Ford)
Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buy原创 2015-10-18 23:23:34 · 510 阅读 · 0 评论 -
Heavy Transportation(最短路变形)
Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the原创 2015-10-18 23:09:52 · 659 阅读 · 0 评论 -
Wormholes(bellman-Ford)
Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a原创 2015-10-18 23:19:44 · 343 阅读 · 0 评论 -
Layout(差束约分系统)
Description Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows原创 2015-10-30 19:52:22 · 590 阅读 · 0 评论