HDU2112
题解:一道题看起来很简单的题目,wa了7次。(┬_┬)
1、起点和终点可能相同。但是不要相同立刻contiue,因为后面还有输入。
2、两个车站之间是来回的,不是单向的。不知道哪个评论说是单向的。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
int const inf = 0x7f7f7f7f;
int const N = 150 + 10;
int st,en,n,m,dis[N];
struct Edge
{
int from,to,dist;
};
vector<Edge>G[N];
map<string,int>mp;
priority_queue<pii,vector<pii>,greater<pii> >q;
void Dijkstra(int s){
for(int i=0;i<N;i++) dis[i] = inf;
dis[s] = 0;
q.push(make_pair(0,s));
while(!q.empty()){
pii p = q.top(); q.pop();
int u = p.second;
if(dis[u] < p.first) continue;
for(int i=0;i<G[u].size();i++){
Edge e = G[u][i];
if(dis[e.to] > dis[e.from] + e.dist){
dis[e.to] = dis[e.from] + e.dist;
q.push(make_pair(dis[e.to],e.to));
}
}
}
if(dis[en] == inf) printf("%d\n",-1);
else printf("%d\n",dis[en]);
}
int main(){
while(~scanf("%d",&n)&&(n!=-1)){ //n可以为0
for(int i=0;i<N;i++) G[i].clear();
mp.clear();
string s1,s2;
cin>>s1>>s2;
m = 0;
if(!mp[s1]) mp[s1] = ++m;
if(!mp[s2]) mp[s2] = ++m;
st = mp[s1], en = mp[s2];
bool flag;
if(s1 == s2) flag = true;
else flag = false;
for(int i=0;i<n;i++){
int dist;
cin>>s1>>s2>>dist;
if(!mp[s1]) mp[s1] = ++m;
if(!mp[s2]) mp[s2] = ++m;
G[mp[s1]].push_back((Edge){mp[s1],mp[s2],dist});
G[mp[s2]].push_back((Edge){mp[s2],mp[s1],dist});
}
if(flag){
cout<<0<<endl;
continue;
}
Dijkstra(st);
}
return 0;
}