What Are You Talking About HDU - 1075 （字典树）

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.

        

题目大意：给出一个“翻译-原文”的对应表，然后给出句子，要把句子中的原文都翻译出来。

解题思路：我是对于每次给出的原文串建立了字典树，字典树中没个结点要多保存一个翻译的字符串，一遍查找。

最后对于句子中没个单词在这颗字典树上跑一遍看看是否有对应的翻译即可。当然这个题用map写也是可以的。

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1075

/*
@Author: Top_Spirit
@Language: C++
*/
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std ;
typedef long long ll ;
const int Maxn = 100 ;
const int Maxn1 = 1e6 + 10 ;
const int INF = 0x3f3f3f3f ;

typedef struct Node {
    int isword;
    char word[12];
    struct Node *next[26];
}tire;

void insert (tire *root, char *a,char *b){
    tire *p = root;
    for (int i = 0; i < b[i]; i++){
        int id = b[i] - 'a';
        if (p -> next[id] == NULL){
            tire *q = new (tire);
            for (int i = 0; i < 26; i++){
                q -> next[i] = NULL;
            }
            q -> isword = 0;
            p -> next[id] = q;
        }
        p = p ->next[id];
    }
    p -> isword = 1;
    strcpy(p -> word,a);
}

char *find (tire *root, char *str){
    tire *p = root;
    for (int i = 0; str[i]; i++){
        int id = str[i] - 'a';
        if (p -> next[id] == NULL){
            return NULL;
        }
        p = p -> next[id];
    }
    if (p -> isword == 1){
        return p -> word;
    }
    else return NULL;
}

int main (){
    char a[Maxn],b[Maxn],word[Maxn],*str,p[31000];
    scanf("%s",a);
    tire *root = new tire;
    for (int i = 0;i < 26; i++){
        root -> next[i] = NULL;
    }
    root -> isword = 0;
    while (scanf("%s",a) && strcmp(a,"END") != 0){
        scanf("%s",b);
        insert(root,a,b);
    }
    scanf("%s",a);
    getchar();
    while (gets(p) && strcmp(p,"END") != 0){
        int len = strlen(p);
        for (int i = 0; i < len; i++){
            if (p[i] >= 'a' && p[i] <= 'z'){
                int j = i;
                while (j < len && p[j] >= 'a' && p[j] <= 'z'){
                    j++;
                }
                int k = 0;
                for (int v = i; v < j; v++){
                    word[k++] = p[v];
                }
//                printf("%s\n",word);
                i = j - 1;
                word[k] = '\0';
                str = find (root,word);
                if (str){
                    printf("%s",str);
                }
                else printf("%s",word);
            }
            else printf("%c",p[i]);
        }
        puts("");
    }
}