ZOJ2750_Idiomatic Phrases Game (Shortest Path)

Idiomatic Phrases Game Time Limit: 2 Seconds Memory Limit: 65536 KB

Tom is playing a game calledIdiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. this game will give Tom two idioms. he shoshould 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 shocould 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

55 12345978ABCD23415 23415608ACBD34127 34125678AEFD412315 23415673ACC341234 41235673FBCD2156220 12345678ABCD30 DCBF5432167D0

Sample Output

17-1

Author: ZHOU, Ran
Source: Zhejiang Provincial Programming Contest 2006
Solution reportA relatively simple shortest path can be used to create a graph...

#include <iostream>#include <cstdio>#include <cstring>#define inf 99999999using namespace std;struct node{    int t;    char idiom[100];} List[1010];int n,mmap[1010][1010],dis[1010],vis[1010];int Is_same(char *str1,char *str2){    char s[10];    int l1=strlen(str1),k=0;    strncpy(s,str2,4);    for(int i=l1-4; i<l1; i++)    {        if(str1[i]!=s[k++])            return 0;    }    return 1;}void dij(){    int i,j,minn,u;    for(i=0; i<n; i++)    {        dis[i]=mmap[0][i];        vis[i]=0;    }    vis[0]=1;    dis[0]=0;    for(i=0; i<n-1; i++)    {        u=0;        minn=inf;        for(j=0; j<n; j++)        {            if(!vis[j]&&dis[j]<minn)            {                minn=dis[j];                u=j;            }        }        vis[u]=1;        for(j=0; j<n; j++)        {            if(!vis[j]&&dis[j]>dis[u]+mmap[u][j])            {                dis[j]=dis[u]+mmap[u][j];            }        }    }    if(dis[n-1]!=inf)    {        printf("%d\n",dis[n-1]);    }    else printf("-1\n");}int main(){    int i,j;    while(~scanf("%d",&n))    {        if(!n)break;        for(i=0; i<n; i++)        {            for(j=0; j<n; j++)                mmap[i][j]=inf;            mmap[i][i]=0;        }        for(i=0; i<n; i++)            scanf("%d%s",&List[i].t,List[i].idiom);        for(i=0; i<n; i++)        {            for(j=0; j<n; j++)            {                if(i!=j)                if(Is_same(List[i].idiom,List[j].idiom))                {                    mmap[i][j]=List[i].t;                }            }        }        dij();    }    return 0;}