POJ2263 Heavy Cargo
2016-05-19 23:37
309 查看
Heavy Cargo
Description
Big Johnsson Trucks Inc. is a company specialized in manufacturing big trucks. Their latest model, the Godzilla V12, is so big that the amount of cargo you can transport with it is never limited by the truck itself. It is only limited by the weight restrictions
that apply for the roads along the path you want to drive.
Given start and destination city, your job is to determine the maximum load of the Godzilla V12 so that there still exists a path between the two specified cities.
Input
The input will contain one or more test cases. The first line of each test case will contain two integers: the number of cities n (2<=n<=200) and the number of road segments r (1<=r<=19900) making up the street network.
Then r lines will follow, each one describing one road segment by naming the two cities connected by the segment and giving the weight limit for trucks that use this segment. Names are not longer than 30 characters and do not contain white-space characters.
Weight limits are integers in the range 0 - 10000. Roads can always be travelled in both directions.
The last line of the test case contains two city names: start and destination.
Input will be terminated by two values of 0 for n and r.
Output
For each test case, print three lines:
a line saying "Scenario #x" where x is the number of the test case
a line saying "y tons" where y is the maximum possible load
a blank line
Sample Input
Sample Output
Source
Ulm Local 1998
Floyd直接解,唯一的难点是城市名称与图上点的对应,但是有STL还怕什么呢?
用STL的map保存城市和点的映射以后跑一遍floyd就行
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 4004 | Accepted: 2124 |
Big Johnsson Trucks Inc. is a company specialized in manufacturing big trucks. Their latest model, the Godzilla V12, is so big that the amount of cargo you can transport with it is never limited by the truck itself. It is only limited by the weight restrictions
that apply for the roads along the path you want to drive.
Given start and destination city, your job is to determine the maximum load of the Godzilla V12 so that there still exists a path between the two specified cities.
Input
The input will contain one or more test cases. The first line of each test case will contain two integers: the number of cities n (2<=n<=200) and the number of road segments r (1<=r<=19900) making up the street network.
Then r lines will follow, each one describing one road segment by naming the two cities connected by the segment and giving the weight limit for trucks that use this segment. Names are not longer than 30 characters and do not contain white-space characters.
Weight limits are integers in the range 0 - 10000. Roads can always be travelled in both directions.
The last line of the test case contains two city names: start and destination.
Input will be terminated by two values of 0 for n and r.
Output
For each test case, print three lines:
a line saying "Scenario #x" where x is the number of the test case
a line saying "y tons" where y is the maximum possible load
a blank line
Sample Input
4 3 Karlsruhe Stuttgart 100 Stuttgart Ulm 80 Ulm Muenchen 120 Karlsruhe Muenchen 5 5 Karlsruhe Stuttgart 100 Stuttgart Ulm 80 Ulm Muenchen 120 Karlsruhe Hamburg 220 Hamburg Muenchen 170 Muenchen Karlsruhe 0 0
Sample Output
Scenario #1 80 tons Scenario #2 170 tons
Source
Ulm Local 1998
Floyd直接解,唯一的难点是城市名称与图上点的对应,但是有STL还怕什么呢?
用STL的map保存城市和点的映射以后跑一遍floyd就行
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<map> #include<cstring> using namespace std; map<string,int>mp; int m[200][200]; int n,r; int cnt=0; int anscnt=0; void floyd(){ int i,j,k; for(i=1;i<=n;i++) for(j=1;j<=n;j++) for(k=1;k<=n;k++){ m[i][j]=max(m[i][j],min(m[i][k],m[k][j])); } return; } int main(){ while(scanf("%d%d",&n,&r)!=EOF && n!=0 &&r!=0){ memset(m,0,sizeof(m)); mp.clear(); cnt=0; int i,j; for(i=1;i<=n;i++)m[i][i]=1000000; //初始化 string u,v;//为了用STL的map,开了string int x; for(i=1;i<=r;i++){ cin>>u>>v>>x; if(!mp.count(u))mp[u]=++cnt;//城市名与结点对应 if(!mp.count(v))mp[v]=++cnt; // cout<<u<<" "<<v<<" "<<cnt<<" "<<x<<endl;//测试 m[mp[u]][mp[v]]=m[mp[v]][mp[u]]=x; } floyd(); cin>>u>>v; printf("Scenario #%d\n",++anscnt); printf("%d tons\n\n",m[mp[u]][mp[v]]); } return 0; }
相关文章推荐
- ACM: dp题 poj 1276 go on 动态规…
- Google官方 由浅入深详解Fragment【附Fragment使用常见问题】
- 啦啦啦啦~Django1.96---编写第一个Django应用(3)
- TensorFlow Machine Learning with Financial Data on Google Cloud Platform
- 《Google软件测试之道》告诉你什么是测试
- UVA - 11054 Wine trading in Gergovia
- mongo笔记
- 啦啦啦啦~Django1.96---Django的模板渲染(render)机制
- GDOI 2016 Day2 T1 SigemaGO
- mongo命令
- 无法安装 golang.org/x/tools/的库
- google protobuf入门(序列化和反序列化)
- 【BZOJ2229】[Zjoi2011]最小割【Gomory-Hu树】
- HDU3635 Dragon Balls(并查集)
- goaccess安装
- 【Algorithm】 多边形+凸包+面积
- ODI利用goldengate实现增量数据捕获
- Google IO 2016 首日热点
- 重磅!谷歌将与搜狗合作进入中国
- goahead 的认证和自定义登陆页面的cookie使用