HDU 1546 Idiomatic Phrases Game(dijkstra+优先队列)

Idiomatic Phrases Game

Problem Description

Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should build a list of idioms and the list starts and ends with the two given idioms. For every two adjacent idioms, the last Chinese character of the former idiom should be the same as the first character of the latter one. For each time, Tom has a dictionary that he must pick idioms from and each idiom in the dictionary has a value indicates how long Tom will take to find the next proper idiom in the final list. Now you are asked to write a program to compute the shortest time Tom will take by giving you the idiom dictionary.

 

 

Input

The input consists of several test cases. Each test case contains an idiom dictionary. The dictionary is started by an integer N (0 < N < 1000) in one line. The following is N lines. Each line contains an integer T (the time Tom will take to work out) and an idiom. One idiom consists of several Chinese characters (at least 3) and one Chinese character consists of four hex digit (i.e., 0 to 9 and A to F). Note that the first and last idioms in the dictionary are the source and target idioms in the game. The input ends up with a case that N = 0. Do not process this case.

 

 

Output

One line for each case. Output an integer indicating the shortest time Tome will take. If the list can not be built, please output -1.

 

 

Sample Input

5

5 12345978ABCD2341

5 23415608ACBD3412

7 34125678AEFD4123

15 23415673ACC34123

4 41235673FBCD2156

2

20 12345678ABCD

30 DCBF5432167D

0

 

Sample Output

17

-1

 

 

#include<map>
#include<queue>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;

struct edge
{
    int from,to,time;
    edge(int u,int v,int w):from(u),to(v),time(w){};
};

struct Node
{
    int st;
    int ed;
    int val;
}node[1005];

struct heapnode
{
    int u,d;
    bool operator < (const heapnode &temp)const
    {
        return d>temp.d;
    }
};

const int inf =0x3f3f3f3f;
map<string,int>key;
vector<edge>edges;
vector<int>G[1005];
int d[1005],vis[1005];
int num,n;

void init()
{
    for(int i=0;i<n;i++)
    G[i].clear();
    edges.clear();
    memset(vis,0,sizeof(vis));
    key.clear();
}

void addedge(int u,int v,int w)
{
    edges.push_back(edge(u,v,w));
    int m=edges.size();
    G[u].push_back(m-1);
}

void dijkstra(int S)
{
    priority_queue<heapnode>q;
    q.push((heapnode){S,0});
    for(int i=0;i<n;i++)
    d[i]=inf;
    d[S]=0;
    while(!q.empty())
    {
        int u=q.top().u;
        q.pop();
        if(vis[u])
        continue;
        vis[u]=1;
        for(int i=0;i<G[u].size();i++)
        {
            edge& e=edges[G[u][i]];
            if(d[e.to]>d[u]+e.time)
            {
                d[e.to]=d[u]+e.time;
                q.push((heapnode){e.to,d[e.to]});
            }
        }
    }
}

int main()
{
    //freopen("in.txt","r",stdin);
    char s[105],sub1[5],sub2[5];
    string temp1,temp2;
    int i,j,val,t,k;
    while(scanf("%d",&t),t)
    {
        j=num=0;
        n=t;
        init();
        while(t--)
        {
            scanf("%d %s",&val,s);
            int len=strlen(s);
            for(i=0;i<4;i++)
            sub1[i]=s[i];
            sub1[i]='\0';
            temp1=sub1;
            if(!key.count(temp1))
            key[temp1]=num++;
            for(k=0,i=len-4;i<=len;i++,k++)
            sub2[k]=s[i];
            temp2=sub2;
            if(!key.count(temp2))
            key[temp2]=num++;
            node[j].st=key[temp1];
            node[j].ed=key[temp2];
            node[j].val=val;
            for(int k=0;k<j;k++)
            if(node[k].ed==node[j].st)
            addedge(k,j,node[k].val);
            else if(node[j].ed==node[k].st)
            addedge(j,k,node[j].val);
            else;
            j++;
        }
        dijkstra(0);
        if(d[n-1]==inf)
        printf("-1\n");
        else
        printf("%d\n",d[n-1]);
    }
    return 0;
}