POJ 1797 Heavy Transportation 最短路变形
来源:互联网 发布:内江王记牛肉干淘宝网 编辑:程序博客网 时间:2024/05/19 19:14
Heavy Transportation
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 33121 Accepted: 8783
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 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.
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
13 31 2 31 3 42 3 5
Sample Output
Scenario #1:4
Source
TUD Programming Contest 2004, Darmstadt, Germany
[
1 0
- poj 1797 Heavy Transportation (最短路变形)
- POJ 1797 Heavy Transportation 最短路变形
- Poj 1797 Heavy Transportation ( 最短路变形
- POJ 1797 Heavy Transportation Dijstr最短路变形
- POJ 1797 Heavy Transportation【Dijkstra最短路变形】
- 【POJ】1797 Heavy Transportation 二分+最短路
- poj 1797 Heavy transportation 最短路
- POJ 1797 Heavy Transportation (最短路)
- poj 1797 Heavy Transportation 最短路 dijkstra
- poj-1797-Heavy Transportation [最短路][Dijkstra]
- POJ 1797 Heavy Transportation&&POJ 2253 Frogger 最短路 dijkstra变形
- POJ-1797Heavy Transportation,最短路变形,用dijkstra稍加修改就可以了;
- 【最短路】变形-- nyoj 1248 海岛争霸、poj 1797 Heavy Transportation
- poj1797 Heavy Transportation(最短路变形)
- poj1797 Heavy Transportation(最短路变形)
- Heavy Transportation(最短路变形)
- POJ1797---Heavy Transportation(最短路变形)
- (POJ 1797)Heavy Transportation 最大生成树|最短路变形 (理解最短路核心思想好题)
- 同一个tomcat多个web应用共享session
- MongoDB的分布式文件存储系统
- 343
- 99%游戏开发者都不知道的游戏运营词汇
- 什么是跨域?怎么解决跨域问题?
- POJ 1797 Heavy Transportation 最短路变形
- vim查看函数原型
- bootstrap modal.js解析
- JVM系列
- 炼数成金云计算
- thinkphp5 文件处理类 延伸扩展
- bzoj2002: [Hnoi2010]Bounce 弹飞绵羊
- Java中String.format格式化字符串用法
- Installing and configuring the Hadoop in the VM environment (1)