hdu2112 spfa

  最开始的起点ss和终点tt，一定要在cin之后就要map，否则如下数据

0
aaa bbb

  因为n=0，如果没有map，s=name2ID[ss]和t=name2ID[tt]没有被赋值。在这里WA了n次，给跪了。

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<sstream>
#define LL long long
#define OJ_DEBUG 0
#define READ_FILE 1
using namespace std;
const int NN_MAX = 10010;
const int MM_MAX = NN_MAX*NN_MAX;
const int INF = 0x3f3f3f3f;
struct Edge{
    int from,to,dis;
    Edge(int a1=0,int a2=0,int a3=0):from(a1),to(a2),dis(a3){};
};
/**********************************************************/
int n,m,s,t,lenEdge;
map<string,int> name2ID;
int d[NN_MAX];
bool vis[NN_MAX];
vector<Edge>theEdge;
vector<int>G[NN_MAX];
/**********************************************************/
int min_2 (int x,int y) {return x<y?x:y;}
int max_2 (int x,int y) {return x>y?x:y;}
bool dijkstra1();
void dijkstra2();
/**********************************************************/
int main()
{
    if (READ_FILE) freopen ("in.txt","r",stdin);
    while(cin>>n && n!=-1)
    {
        for(int i=0;i<NN_MAX;i++) G[i].clear();
        theEdge.clear(); name2ID.clear();

        string ss,tt;
        cin>>ss>>tt;
        string s1,s2;
        int a1,a2,a3;
        m=1,lenEdge=0;
        if(name2ID.count(ss)==0) name2ID[ss]=m++;//坑爹在这里WA了n次
        if(name2ID.count(tt)==0) name2ID[tt]=m++;
        for(int i=0;i<n;i++){
            cin>>s1>>s2>>a3;
            if(name2ID.count(s1)==0) name2ID[s1]=m++;
            if(name2ID.count(s2)==0) name2ID[s2]=m++;
            a1=name2ID[s1],a2=name2ID[s2];
            theEdge.push_back(Edge(a1,a2,a3)); G[a1].push_back(lenEdge++);
            theEdge.push_back(Edge(a2,a1,a3)); G[a2].push_back(lenEdge++);
        }
        s=name2ID[ss],t=name2ID[tt];
        if(s==t){
            cout<<0<<endl;
            continue;
        }
        if(dijkstra1()) cout<<d[t]<<endl;
        else cout<<-1<<endl;
    }
    return 0;
}
struct HeapNode {
    int i,d;
    HeapNode(int a1=0, int a2=0):i(a1),d(a2){};
    bool operator < (const HeapNode& rhs) const {return d>rhs.d;}
};
bool dijkstra1()
{
    for(int i=0;i<=m;i++) d[i]=(i==s?0:INF);
    memset(vis,0,sizeof(vis));
    priority_queue<HeapNode> pq;
    pq.push(HeapNode(s,0));
    while(!pq.empty())
    {
        HeapNode x = pq.top(); pq.pop();
        if(vis[x.i]) continue;
        vis[x.i]=1;
        for(int i=0;i<G[x.i].size();i++){
            Edge& e = theEdge[G[x.i][i]];
            if(!vis[e.to] && d[e.to]>d[x.i]+e.dis){
                d[e.to]=d[x.i]+e.dis;
                pq.push(HeapNode(e.to,d[e.to]));
            }
        }
    }
    return d[t]<INF;
}