HDU Today
Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 38098 Accepted Submission(s): 9215
Problem Description
经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。
这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在什么地方下车(其实徐总自己有车,却一定要与民同乐,这就是徐总的性格)。
徐总经常会问蹩脚的英文问路:“Can you help me?”。看着他那迷茫而又无助的眼神,热心的你能帮帮他吗?
请帮助他用最短的时间到达目的地(假设每一路公交车都只在起点站和终点站停,而且随时都会开)。
Input
输入数据有多组,每组的第一行是公交车的总数N(0<=N<=10000);
第二行有徐总的所在地start,他的目的地end;
接着有n行,每行有站名s,站名e,以及从s到e的时间整数t(0<t<100)(每个地名是一个长度不超过30的字符串)。
note:一组数据中地名数不会超过150个。
如果N==-1,表示输入结束。
Output
如果徐总能到达目的地,输出最短的时间;否则,输出“-1”。
Sample Input
6
xiasha westlake
xiasha station 60
xiasha ShoppingCenterofHangZhou 30
station westlake 20
ShoppingCenterofHangZhou supermarket 10
xiasha supermarket 50
supermarket westlake 10
-1
// 方法一: Flord()
#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 0x3f3f3f3f;
int map[156][156];
int N,cnt;
int sp,ep;
char s[32],e[32],stop[156][32];
void Flord(void){
for( int k=1;k<=cnt;k++)
for( int i=1;i<=cnt;i++)
for( int j=1;j<=cnt;j++)
if( map[i][j] > map[i][k] + map[k][j])
map[i][j] = map[i][k] + map[k][j];
}
int main(void){
while( scanf("%d",&N) != EOF && ( N != -1) ){
sp = ep =0;
scanf("%s",&s);
scanf("%s",&e);
cnt = 0;
memset( map , maxn , sizeof(map) );
char ss[32],ee[32];
int w;
for( int i =1 ;i<=N ;i++){
scanf("%s",&ss);
scanf("%s",&ee);
scanf("%d",&w);
int pos1 = 0;
int pos2 = 0;
for( int j=1;j<=cnt;j++)
if( strcmp( ss,stop[j] ) == 0 ){
pos1 = j;
break;
}
if( pos1 == 0){
cnt++;
strcpy( stop[cnt],ss);
pos1 = cnt;
if(strcmp(s,ss) == 0)
sp = pos1;
if(strcmp(e,ss) == 0)
ep = pos1;
}
for( int k=1;k<=cnt;k++)
if( strcmp( ee,stop[k] ) == 0 ){
pos2 = k;
break;
}
if( pos2 == 0){
cnt++;
strcpy( stop[cnt],ee);
pos2 = cnt;
if( strcmp(s,ee) == 0 )
sp = pos2;
if( strcmp(e,ee) == 0 )
ep = pos2;
}
if( w < map[ pos1 ][pos2] ){
map[pos1][pos2] = w;
map[pos2][pos1] = w;
}
}
if( strcmp(s,e) == 0){
printf("0\n");
continue;
}
if( sp == 0 || ep == 0 ){
printf("-1\n");
continue;
}
for( int i=1;i<=cnt;i++)
map[i][i] = 0 ;
Flord();
if( map[sp][ep] == maxn)
printf("-1\n");
else printf("%d\n",map[sp][ep]);
}
return 0;
}
//方法二: dijskra
#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 0x3f3f3f3f;
int map[156][156];
int N,cnt;
int sp,ep;
char s[32],e[32],stop[156][32];
int vis[156],dis[156];
void dij(void){
int minn ,pos =0;
vis[pos] = 1;
for( int i=1;i<=cnt;i++){
minn = maxn;
pos = 0;
for( int j =1;j<=cnt;j++)
if( !vis[j] && dis[j] < minn){
minn = dis[j];
pos = j;
}
vis[pos] = 1;
for( int j=1;j<=cnt;j++)
if( dis[j] > dis[pos] + map[pos][j] )
dis[j] = dis[pos] + map[pos][j];
}
}
int main(void){
while( scanf("%d",&N) != EOF && ( N != -1) ){
sp =ep =0;
scanf("%s",&s);
scanf("%s",&e);
cnt = 0;
memset( map , maxn , sizeof(map) );
memset( vis , 0 ,sizeof(vis) );
char ss[32],ee[32];
int w;
for( int i =1 ;i<=N ;i++){
scanf("%s",&ss);
scanf("%s",&ee);
scanf("%d",&w);
int pos1 = 0,pos2 = 0;
for( int j=1;j<=cnt;j++)
if( strcmp( ss,stop[j] ) == 0 ){
pos1 = j;
break;
}
if( pos1 == 0){
cnt++;
strcpy( stop[cnt],ss);
pos1 = cnt;
if( strcmp(ss,s) == 0)
sp = pos1;
if( strcmp(ss,e) == 0)
ep = pos1;
}
for( int j=1;j<=cnt;j++)
if( strcmp( ee,stop[j] ) == 0 ){
pos2 = j;
break;
}
if( pos2 == 0){
cnt++;
strcpy( stop[cnt],ee);
pos2 = cnt;
if( strcmp(ee,s) == 0 )
sp = pos2;
if( strcmp(ee,e) == 0 )
ep = pos2;
}
if( w < map[ pos1 ][pos2] ){
map[pos1][pos2] = w;
map[pos2][pos1] = w;
}
}
if( strcmp(s,e) == 0){
printf("0\n");
continue;
}
if( sp == 0 || ep == 0 ){
printf("-1\n");
continue;
}
for( int i = 1; i<=cnt; i++)
dis[i] = map[sp][i];
dis[sp] = 0;
vis[sp] = 1;
dij();
if( dis[ep] == maxn)
printf("-1\n");
else printf("%d\n",dis[ep]);
}
return 0;
}