明明是一个基础Dijkstra。。。怎么每次一旦用string的map就这么多7788的错误
GG
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#define INF 1e9
using namespace std;
const int maxn = 150+10;
const int maxm = 10000+10;
struct Edge
{
int from,to,dist;
Edge(int f,int t,int d):from(f),to(t),dist(d){}
};
struct HeapNode
{
int d,u;
HeapNode(int d,int u):d(d),u(u){}
bool operator<(const HeapNode&rhs)const
{
return d>rhs.d;
}
};
struct Dijkstra
{
int n,m;
vector<Edge> edges;
vector<int> G[maxn];
bool done[maxn];
int d[maxn];
void init(int n)
{
this->n=n;
for(int i=0;i<n;i++) G[i].clear();
edges.clear();
}
void AddEdge(int from,int to,int dist)
{
edges.push_back(Edge(from,to,dist));
m = edges.size();
G[from].push_back(m-1);
}
int dijkstra(int s,int e)
{
if(s==e) return 0;
priority_queue<HeapNode> Q;
for(int i=0;i<n;i++) d[i]=INF;
d[s]=0;
memset(done,0,sizeof(done));
Q.push(HeapNode(d[s],s));
while(!Q.empty())
{
HeapNode x=Q.top(); Q.pop();
int u=x.u;
if(done[u]) continue;
done[u]=true;
for(int i=0;i<G[u].size();i++)
{
Edge &e=edges[G[u][i]];
if(d[e.to] > d[u]+e.dist)
{
d[e.to] = d[u]+e.dist;
Q.push(HeapNode(d[e.to],e.to));
}
}
}
if(d[e]==INF) return -1;
return d[e];
}
}DJ;
map<string ,int >mp;
int m,cnt,u[maxn],v[maxn],c[maxn];
int ID(string s){
if(mp.find(s)==mp.end())return mp[s]=cnt++;
return mp[s];
}
int main()
{
while(scanf("%d",&m))
{
if(m==-1)break;
cnt=0;
mp.clear();
char s1[100],s2[100];
scanf("%s%s",s1,s2);
string s(s1),e(s2);
int val;
int S=ID(s),E=ID(e);
for(int i=0;i<m;i++){
scanf("%s%s%d",s1,s2,&val);
string U(s1),V(s2);
u[i]=ID(U);v[i]=ID(V);c[i]=val;
}
DJ.init(cnt);
for(int i=0;i<m;i++){
DJ.AddEdge(u[i],v[i],c[i]);
DJ.AddEdge(v[i],u[i],c[i]);
}
int ans=DJ.dijkstra(S,E);
printf("%d\n",ans);
}
return 0;
}