HDU1075:What Are You Talking About

最新推荐文章于 2024-05-16 11:43:34 发布

南城边

最新推荐文章于 2024-05-16 11:43:34 发布

阅读量935

点赞数

分类专栏： HDU 文章标签：数据结构 Trie树

本文链接：https://blog.csdn.net/nanchengbian/article/details/8943703

版权

HDU 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

点击打开题目链接

What Are You Talking About

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)
Total Submission(s): 9410 Accepted Submission(s): 2943

Problem Description

Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into English. Can you help him?

Input

The problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string "START", this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian's language. A line with a single string "END" indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string "START", this string should be ignored, then an article written in Martian's language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can't find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(' '), tab('\t'), enter('\n') and all the punctuation should not be translated. A line with a single string "END" indicates the end of the book part, and that's also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.

Output

In this problem, you have to output the translation of the history book.

Sample Input

      
      
       
       START
from fiwo
hello difh
mars riwosf
earth fnnvk
like fiiwj
END
START
difh, i'm fiwo riwosf.
i fiiwj fnnvk!
END

Sample Output

      
      
       
       hello, i'm from mars.
i like earth!


       
       
        
        
         
         Hint
        
        
Huge input, scanf is recommended.

Author

Ignatius.L

=====================================题目大意=====================================

帮助Ignatius将火星人送给他的火星历史书翻译为英文。

=====================================算法分析=====================================

Trie树。

=======================================代码=======================================

#include<stdio.h>
#include<ctype.h>
#include<string.h>

struct TrieNode { char *map;  TrieNode *next[26]; };

TrieNode * NewNode()
{
    TrieNode *tmp=new TrieNode;
    memset(tmp,0,sizeof(TrieNode));
    return tmp;
}

void Insert(TrieNode *Root,char *MtWord,char *EgWord)
{
    for(int i=0;MtWord[i];++i)
    {
        int j=MtWord[i]-'a';
        if(Root->next[j]==NULL) Root->next[j]=NewNode();
        Root=Root->next[j];
    }
    Root->map=new char[strlen(EgWord)+1];
    strcpy(Root->map,EgWord);
}

char * Search(TrieNode *Root,char *MtWord)
{
    for(int i=0;MtWord[i];++i)
    {
        Root=Root->next[MtWord[i]-'a'];
        if(Root==NULL) break;
    }
    return Root&&Root->map?Root->map:MtWord;
}

int main()
{
    TrieNode *Root=NewNode();
    char MtWord[15],EgWord[15],Str[3005];
    scanf("START%*c");
    while(scanf("%s%*c",EgWord)==1&&strcmp(EgWord,"END"))
    {
        scanf("%s%*c",MtWord);
        Insert(Root,MtWord,EgWord);
    }
    scanf("START%*c");
    while(gets(Str)!=NULL&&strcmp(Str,"END"))
    {
        int i=0;
        while(Str[i])
        {
            if(islower(Str[i]))
            {
                int j;
                for(j=0;islower(Str[i]);++j)
                {
                    MtWord[j]=Str[i++];
                }
                MtWord[j]=0;
                printf("%s",Search(Root,MtWord));
            }
            else
            {
                printf("%c",Str[i++]);
            }
        }
        printf("\n");
    }
    return 0;
}