zoukankan      html  css  js  c++  java
  • ZOJ2750_Idiomatic Phrases Game(最短路)

    Idiomatic Phrases Game

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    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
    


    Author: ZHOU, Ran
    Source: Zhejiang Provincial Programming Contest 2006
    解题报告
    比較简单的最短路,处理建图就能够了。。。

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #define inf 99999999
    using 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
    ",dis[n-1]);
        }
        else printf("-1
    ");
    }
    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;
    }
    


  • 相关阅读:
    python分包写入文件,写入固定字节内容,当包达到指定大小时继续写入新文件
    java 封装及this 用法
    [效率提升] 记一次使用工具编辑正则表达式快速输出匹配结果
    java用星星符号打印出一个直角三角形
    java按行和列进行输出数据
    java 三种循环及注意事项
    数据的运算,求和,两数求最大,三数求最大,两数是否相等
    采用位异或方式将两个变量数值调换
    今天遇到一件开心事,在eclipse编写的代码在命令窗口中编译后无法运行,提示 “错误: 找不到或无法加载主类”
    定义 java 基本数据类型
  • 原文地址:https://www.cnblogs.com/yxysuanfa/p/6729599.html
Copyright © 2011-2022 走看看