POJ 1797 Heavy Transportation【Dijkstra最短路变形】
来源:互联网 发布:块语言编程游戏迷宫 编辑:程序博客网 时间:2024/06/06 10:07
Heavy Transportation
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 29682 Accepted: 7919
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
原题链接:http://poj.org/problem?id=1797
题意:有n个城市,m条道路,每条道路都有一定的承重,问你从1开始到达n的最大承重量(该路线上所有承重量的最小值)。
思路:还是最短路的问题,改变一下判断条件就可以了。
Dijkstra算法AC代码:422ms
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int INF=0x3f3f3f3f;const int maxn=1005;int a[maxn][maxn];bool vis[maxn];int dis[maxn];int n;void Dij(){ for(int i=1;i<=n;i++) { vis[i]=false; dis[i]=a[1][i]; } vis[1]=true; dis[1]=0; for(int i=1;i<=n;i++) { int p; int maxx=0;//此题要找最大的 for(int j=1;j<=n;j++) { //关键代码 if(!vis[j]&&dis[j]>maxx) maxx=dis[p=j]; } vis[p]=true; for(int j=1;j<=n;j++) { //关键代码 if(!vis[j]&&dis[j]<min(a[p][j],dis[p])) { dis[j]=min(a[p][j],dis[p]); } } }}int main(){ int T; int kase=0; cin>>T; while(T--) { int m; scanf("%d%d",&n,&m); int x,y,z; memset(a,0,sizeof(a));//初始化 for(int i=1;i<=m;i++) { scanf("%d%d%d",&x,&y,&z); if(z>a[x][y]) a[x][y]=a[y][x]=z; } Dij(); printf("Scenario #%d:\n",++kase); printf("%d\n\n",dis[n]); } return 0;}
0 0
- 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稍加修改就可以了;
- POJ 1797 Heavy Transportation Dijstr最短路变形
- poj 1797 Heavy Transportation 【最短路Dijkstra 变式】
- POJ 1797 Heavy Transportation(dijkstra变形)
- Poj 1797 Heavy Transportation【Dijkstra变形】
- POJ 1797 - Heavy Transportation(dijkstra变形)
- POJ 1797 Heavy Transportation dijkstra 变形
- poj 1797 Heavy Transportation 【dijkstra的变形】
- POJ.1797 Heavy Transportation (Dijkstra变形)
- 【POJ】1797 Heavy Transportation 二分+最短路
- poj 1797 Heavy transportation 最短路
- Android实践之ScrollView中滑动冲突处理
- Core Image人脸检测
- Java基础之(十七)继承和组合
- POJ3468 A Simple Problem with Integers
- 工作日志-Spinner的onItemSelected报空指针
- POJ 1797 Heavy Transportation【Dijkstra最短路变形】
- python提示ImportError: No module named win64com解决办法
- Java NIO框架Netty教程(一) – Hello Netty
- OpenGL Projection Matrix
- java 比较两个日期之间的大小
- iOS 怎样实现最多保留n位小数
- Java设计模式之原型模式与深浅拷贝
- 滑雪问题
- 博弈,枚举必胜区间______A multiplication game( poj 2505)