zoj1109-Language of FatMouse 【字典树】

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=109

 

Language of FatMouse

---

Time Limit: 10 Seconds      Memory Limit: 32768 KB

---

We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.

Input Specification

Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output Specification

Output is the message translated to English, one word per line. FatMouse words not in the dictionary should be translated as "eh".

Sample Input

dog ogday
cat atcay
pig igpay
froot ootfray
loops oopslay

atcay
ittenkay
oopslay

Output for Sample Input

cat
eh
loops

 

 

题意：fat有一种自己的语言，所以有自己的词典，每个fat的单词对应一个人类单词。输入是个词典。然后给你一系列fat的单词，通过词典给出对应的人类单词，如果找不到，输出eh

思路A：直接利用map映射。

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

#define MAX 0x7fffffff
#define N 20

map<string,string> m;
map<string,string>::iterator it;

int main(){
    //freopen("D:\\input.in","r",stdin);
    //freopen("D:\\output.out","w",stdout);
    char s1[N],s2[N];
    while(cin.peek()!='\n'){
        scanf("%s %s",s1,s2);
        getchar();
        m.insert(pair<string,string>(string(s2),string(s1)));
    }
    getchar();
    while(gets(s1)!=NULL){
        it=m.find(s1);
        if(it!=m.end()){
            printf("%s\n",(*it).second.c_str());
        }else{
            printf("eh\n");
        }
    }
    return 0;
}

思路B：使用字典树，在node里另加个字符串，用来存储映射的字符串即可。

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

#define MAX 0x7fffffff
#define N 20

struct node{
    node *word[26];
    char* eng_word;
    node(){
        for(int i=0;i<26;i++) word[i]=NULL;
        eng_word=NULL;
    }
}*root;

void Insert(char* s,char* st);
char* Find(char* s);

int main(){
    //freopen("D:\\input.in","r",stdin);
    //freopen("D:\\output.out","w",stdout);
    char s1[N],s2[N];
    root=new node;
    while(cin.peek()!='\n'){
        scanf("%s %s",s1,s2);
        getchar();
        Insert(s2,s1);
    }
    getchar();
    while(gets(s1)!=NULL){
        printf("%s\n",Find(s1));
    }
    return 0;
}
void Insert(char* s,char* st){
    int len=strlen(s);
    node *current=root,*new_node;
    for(int i=0;i<len;i++){
        if(current->word[s[i]-'a']!=NULL)   current=current->word[s[i]-'a'];
        else{
            new_node=new node;
            current->word[s[i]-'a']=new_node;
            current=current->word[s[i]-'a'];
        }
    }
    current->eng_word=new char[strlen(st)+1];
    strcpy(current->eng_word,st);
}
char* Find(char* s){
    int len=strlen(s);
    node *current=root;
    for(int i=0;i<len;i++){
        if(current->word[s[i]-'a']!=NULL)   current=current->word[s[i]-'a'];
        else    return "eh";
    }
    if(current->eng_word==NULL) return "eh";
    else    return current->eng_word;
}