标签:
Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 19826 Accepted Submission(s): 4671
6 xiasha westlake xiasha station 60 xiasha ShoppingCenterofHangZhou 30 station westlake 20 ShoppingCenterofHangZhou supermarket 10 xiasha supermarket 50 supermarket westlake 10 -1
50 Hint: The best route is: xiasha->ShoppingCenterofHangZhou->supermarket->westlake 虽然偶尔会迷路,但是因为有了你的帮助 **和**从此还是过上了幸福的生活。 ――全剧终――
#include <stdio.h> #include <string.h> #include <queue> #include <iostream> #include <algorithm> #include <map> #define INF 0x3f3f3f3f using namespace std; int n; int edgenum; int head[20005]; char ex[35],ey[35]; int vis[155]; int dis[155]; void init() { edgenum=0; memset(head,-1,sizeof(head)); } struct Edge { int from,to,val,next; }edge[20005]; void addedge(int u,int v,int w) { Edge E={u,v,w,head[u]}; edge[edgenum]=E; head[u]=edgenum++; } map<string,int>mp; int t; void getmap() { mp.clear();//一定要清零! getchar(); scanf("%s%s",ex,ey); mp[ex]=1; t=2; if(!mp[ey]) { mp[ey]=t++; } char a[35],b[35]; int c; for(int i=1;i<=n;i++) { getchar(); scanf("%s%s%d",a,b,&c); if(!mp[a]) { mp[a]=t++; } if(!mp[b]) { mp[b]=t++; } addedge(mp[a],mp[b],c); addedge(mp[b],mp[a],c); } } void SPFA() { queue<int>q; q.push(1); memset(vis,0,sizeof(vis)); memset(dis,INF,sizeof(dis)); vis[1]=1; dis[1]=0; while(!q.empty()) { int u=q.front(); q.pop(); vis[u]=0; for(int i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].to; if(dis[v]>dis[u]+edge[i].val) { dis[v]=dis[u]+edge[i].val; if(vis[v]==0) { vis[v]=1; q.push(v); } } } } if(dis[mp[ey]]==INF) printf("-1\n"); else printf("%d\n",dis[mp[ey]]); } int main() { while(scanf("%d",&n)&&(n!=-1)) { init(); getmap(); SPFA(); } return 0; }
版权声明:本文为博主原创文章,未经博主允许不得转载。
HDU 2112 HDU Today <SPFA算法+map函数>
标签:
原文地址:http://blog.csdn.net/dxx_111/article/details/47803601