J - What Are You Talking About（map,字典树）

题意:上部分是单词表，下部分是句子，翻译句子。START开始，END结束。

思路:简单字典树。

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?

InputThe 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.
OutputIn 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.

 1 #include<iostream>
 2 #include<map>
 3 #include<stdio.h>
 4 #include<string.h>
 5 using namespace std;
 6 int main()
 7 {
 8     string s,m,e,t;
 9     map<string,string>q;
10     while(1)
11     {
12         cin>>t;
13         while(1)
14         {
15             cin>>m;
16             if(m=="END")
17                 break;
18             cin>>e;
19             q[e]=m;
20         }
21         cin>>t;
22         s="";
23         getchar();
24         char g[3010]={0};
25         while(1)
26         {
27             gets(g);
28             if(strcmp(g,"END")==0) return 0;
29             int len=strlen(g);
30             for(int i=0;i<len;i++)//遍历这个句子
31             {
32                 if(g[i]<'a'||g[i]>'z')
33                 //当前字符不是字母，证明单词结束
34                 {
35                     if(q[s]!="")
36                     //如果字典中有这个单词，输出对应字符串
37                     {
38                         cout<<q[s];
39                     }
40                     else//字典中没有这个单词，则输出单词
41                         cout<<s;
42                     s="";//情况字符串，准备储存下一个单词
43                     cout<<g[i];//输出当前不是字母的字符
44                 }
45                 else//当前字符是字母时
46                     s+=g[i];//将字母存到字符串中
47             }
48             cout<<endl;
49         }
50     }
51 }