trie hdu1075
2015-08-12 10:46
190 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1075
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)
Total Submission(s): 17230 Accepted Submission(s): 5613
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
Sample Output
What Are You Talking About
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 17230 Accepted Submission(s): 5613
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!
#include<iostream> #include <stdio.h> #include <stdlib.h> #include<string.h> #include<map> using namespace std; map<string,string>M; int main() { string a,b; cin>>a;//"START" while(cin>>a && a!="END") { cin>>b; M[b] = a; } cin>>a;//"START" getchar();//吃回车 char tmp[3005]; while(1) { gets(tmp);//用这个比getline()强 if(strcmp(tmp,"END") == 0 ) break; int i,len; len = strlen(tmp); b = ""; for(i=0;i<len;i++) { if(!(tmp[i]>='a' && tmp[i]<='z'))//非小写字母 { if(M[b]!="")//存在这个单词 cout<<M[b]; else cout<<b; b=""; cout<<tmp[i]; } else { b+=tmp[i]; // cout<<M[b]<<" "; } //小写字母 } cout<<endl; } return 0; }
相关文章推荐
- poj3984 迷宫问题
- [java] 匿名内部类
- 邮箱password复位图
- C语言中的malloc使用详解
- 共享内存
- Java基础总结之各个模块重要知识点
- json数据解析
- hdoj畅通工程
- iOS推送小结
- trie hdu1251 字典树
- 不敢死队问题
- 【Java设计模式】· 策略模式(Strategy Pattern)
- 【HDOJ 5371】 Hotaru's problem
- 了解你的家公家IP
- 自己封装的Metro风格的后台UI框架,暂命名MUI(持续更新)
- phpstorm 9 keygen
- 最近准备研读thinkphp源码,ctag派上用场了
- iOS UITextView内容添加后,自动滚动到最后一行
- C#线程池ThreadPool
- Mybatis_review之配置文件中的properties节点内容说明