Heavy Transportation
来源:互联网 发布:一元购完整源码 编辑:程序博客网 时间:2024/05/17 09:21
Heavy Transportation(变形最短路问题)
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 place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo’s place) to crossing n (the customer’s place). You may assume that there is at least one path. All streets can be travelled in both directions.
Input
The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.
Output
The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.
Sample Input
1
3 3
1 2 3
1 3 4
2 3 5
Sample Output
Scenario #1:
4
解题报告
理论上方法二应该更快的啊,可是不知道为什么方法一更快了。经过测试发现,与vector有关。对vector全局声明,然后每次用的时候清空,会加快4倍//只是对这个题而言
套用Bellman-Ford算法
266MS 956K
dijkstra算法
1219MS 1976K
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- Heavy Transportation (POJ1797)
- poj_1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj1797 - Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- NodeJs-创建一个项目
- 双边滤波算法的原理、流程、实现及效果
- 我的2016——关于时间与方向的思考
- java爬取网页内容 简单例子
- C语言复习二
- Heavy Transportation
- 【OpenCV】邻域滤波:方框、高斯、中值、双边滤波
- mutt上玩转PGP
- SPI通信协议详解--CPOL&CPHA
- 小彩球游戏
- smartcheck的选项设置
- [POJ2976]Dropping tests 01分数规划
- Python IDLE快捷键一览
- c++ 求数组最大最小值函数