Heavy Transportation POJ
来源:互联网 发布:如何优化英语教学 编辑:程序博客网 时间:2024/06/02 14:30
Language:
Heavy Transportation
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 32906 Accepted: 8734
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
思路:这是一个求最短路的变形,是一个求从1到n的最大承载量,也就是从求最小值变成了求最大值,那就是要看两条连接路中小的那一个决定最大承载量。
PS:刚开始用 Dijkstra 还不是很熟练,老是要借助模版,还是要多加练习。
#include <iostream>#include <vector>#include <string>#include <algorithm>#include <queue>#include <stack>#define MXAN 2010#define INF 1 << 29using namespace std;int mp[MXAN][MXAN];int main(){ int T, n, m; int kase = 0; scanf("%d", &T); while(T--){ for(int i = 0; i < MXAN; ++i) for(int j = 0; j < MXAN; ++j){ mp[i][j] = 0; // 将一开始所有路之间的承载量都初始化为零 } scanf("%d%d", &n, &m); int x, y, z; for(int i = 1; i <= m; ++i){ scanf("%d%d%d", &x, &y, &z); mp[y][x] = mp[x][y] = z; // 这是一个双向路,所以从x到y和从y到x的承载量相同 } int dis[MXAN]; int book[MXAN] = {0}; for(int i = 1; i <= n; ++i){ dis[i] = mp[1][i]; // 一开始从1到各个点的承载量 } book[1] = 1; int u = 0; for(int i = 1; i < n; ++i){ int max_weight = -1; for(int j = 1; j <= n; ++j){ if(!book[j] && dis[j] > max_weight){ u = j; max_weight = dis[j]; } } book[u] = 1; // 防止重复计算 for(int j = 1; j <= n; ++j){ if(dis[j] < min(dis[u], mp[u][j])){ dis[j] = min(dis[u], mp[u][j]); // 求最大的承载量 } } } printf("Scenario #%d:\n%d\n\n", ++kase, dis[n]); } return 0;}
0 0
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- Poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ-1797-Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- 多线程的使用
- C++基础2:结构体、联合体、枚举
- 代理服务器工作原理
- 55:Valid Parentheses
- JavaScript闭包的理解
- Heavy Transportation POJ
- int 单个字符转
- jdk源码之String
- linux3.4 和linux2.6的区别
- 一张表里,不同字段,值相同的两条记录,查询这两条记录中不同字段的语句
- 《Linux内核设计与实现》——内存管理
- 处理inline元素之间换行产生的空白
- 机器学习/深度学习测试题(一) —— 单层感知器的激活函数
- 【lambda】java8 lambda