C
来源:互联网 发布:java 打印日志log 编辑:程序博客网 时间:2024/06/04 22:36
点击打开链接
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.
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.
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.
13 31 2 31 3 42 3 5
Scenario #1:4
#include<cstdio>#include<algorithm>#include<cstring>#include<queue>using namespace std;#define INF 0x3f3f3f3fstruct Pair{int first,second;bool friend operator < (Pair a,Pair b){return a.second < b.second;}}pr,ne;int n,m;vector<int> edge[1005]; int length[1005][1005];int dis[1005];void dijkstra(){memset(dis,-1,sizeof(dis));bool vis[1005];memset(vis,false,sizeof(vis));dis[1] = 0;pr.first = 1;pr.second = 0;priority_queue<Pair> Q;Q.push(pr);while (!Q.empty()){pr = Q.top();Q.pop();if (vis[pr.first])continue;vis[pr.first] = true;for (int i = 0 ; i < edge[pr.first].size() ; i++){ne.first = edge[pr.first][i];if(pr.first==1) ne.second =length[pr.first][ne.first];else {if(pr.second<length[pr.first][ne.first]) ne.second = pr.second; else ne.second =length[pr.first][ne.first];}if (ne.second > dis[ne.first]){dis[ne.first] = ne.second;Q.push(ne);}}}}int main(){int t,k=1;scanf("%d",&t);while(t--){ scanf ("%d%d",&n,&m); memset(edge,0,sizeof(edge)); memset(length,-1,sizeof(length)); for (int i = 1 ; i <=m; i++) {int x,y,z;scanf ("%d%d%d",&x,&y,&z);edge[x].push_back(y);edge[y].push_back(x);if (length[x][y] == -1)length[x][y] = length[y][x] = z;elselength[x][y] = length[y][x] = max(z,length[x][y]); } dijkstra(); printf("Scenario #%d:\n%d\n\n",k++,dis[n]); } return 0;}
阅读全文
0 0
- c
- c
- c
- c
- C
- c
- c
- c
- C+
- c
- C
- c
- c
- c
- C
- C
- c
- C
- 【Android
- HDU 3999----The order of a Tree(二叉树的前序遍历)
- ArrayList源码分析
- openresty 应用与配置分离start|stop|reload脚本
- Unity开发之重写InputField
- C
- 用java面向对象的内容建立学生姓名,学号,id,班级,每一科的成绩,以及对管理员实现(对老师只实现查看):通过名字查询成绩,通过学号查询成绩,通过id修改姓名,通过姓名修改成绩
- HDOJ1258 又是一道深搜入门题
- 浅谈Python web框架
- CVPR2017-如何在无标签数据集上训练模型
- 5.classification--Probabilistic Generative Model
- 程序员职业生涯
- D
- K