map的使用
2016-03-25 16:51
204 查看
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
TLE代码:
此段代码错误的原因便在于,没有仔细理解all the punctuation should not be translated,虽然并不影响结果,但是很多标点影响执行效率,
你要把字典中的每个单词与之做对比,无疑效率大打折扣,应当把标点作为分隔符。还有一点就是不要将map中的每个单词逐一在字符串里寻找,替换。寻找时也是逐个字符进行匹配,效率低。不如一遍遍历字符串,每个标点作为分界点,每加入一个字符便在map里面匹配,map是有大小顺序的,时间复杂度log
n,效率高。
如下:
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!
TLE代码:
#include<iostream> #include<map> #include<string> #include<algorithm> using namespace std; map<string, string>m; //前面为古文,后面为英语 void deal(string & s) { string s1; map<string, string>::iterator it = m.begin(); for (; it != m.end(); ++it) { int pos; if ((pos=s.find((*it).first)) != -1) { s.replace(pos, (*it).first.size(), (*it).second); } } cout << s << endl; } int main() { string b, s2, s1; cin >> b; while (cin >> s2 >> s1&&s1 != "START") { m.insert(make_pair(s1, s2)); } int i; while (1) { string text; getline(cin, text); if (text[0] == 'E'&&text[1] == 'N'&&text[2] == 'D') break; deal(text); } }
此段代码错误的原因便在于,没有仔细理解all the punctuation should not be translated,虽然并不影响结果,但是很多标点影响执行效率,
你要把字典中的每个单词与之做对比,无疑效率大打折扣,应当把标点作为分隔符。还有一点就是不要将map中的每个单词逐一在字符串里寻找,替换。寻找时也是逐个字符进行匹配,效率低。不如一遍遍历字符串,每个标点作为分界点,每加入一个字符便在map里面匹配,map是有大小顺序的,时间复杂度log
n,效率高。
如下:
#include<iostream> #include<map> #include<string> #include<algorithm> using namespace std; map<string,string>m; //前面为古文,后面为英语 void deal(char s[]) { string s1=""; for(int i=0;i<strlen(s);i++) { if(s[i]<'a'||s[i]>'z') { if(m.count(s1)) { cout<<m[s1]; cout<<s[i]; s1=""; } else { cout<<s1; cout<<s[i]; s1=""; } } else s1=s1+s[i]; } if(s1!="") { if(m.count(s1)) { cout<<m[s1]; } else cout<<s1; } cout<<endl; } int main() { string b,s2,s1; cin>>b; while(cin>>s2>>s1&&s1!="START") { m.insert(make_pair(s1,s2)); } char text[3002]; int i; getchar(); while(1) { gets(text); if(text[0]=='E'&&text[1]=='N'&&text[2]=='D') break; deal(text); } }
相关文章推荐
- 详细介绍如何在Eclipse中使用SVN
- Android学习笔记·常见控件TextView
- dialog根据窗口定义大小
- Response 增加Cookie及获取中文Cookie
- libcurl 使用的几个注意事项
- 第三篇——软件之殇,WE ARE THOUSANDS APART!
- 3. 文件系统管理
- 2. 操作系统引导
- view 上推效果
- .Net使用Redis详解之ServiceStack.Redis(七)
- word2016去除回车符和换行符的方法
- 使用EditText在不同场景下调用软键盘的总结
- MAVEN pom.xml 文件详解,整理学习中··················
- word 文档中嵌入和链接OLE 对象|Packager-对象包装程序
- 静态库的使用方法
- Android 如何找到最匹配资源
- Example of Fixed Asset Service Operations
- 1. 用U盘安装Centos6.5 + Win7 双系统
- VS2008 error PRJ0002 : 错误的结果 31 (从“C:\Program Files\Microsoft SDKs\Windows\v6.0A\bin\rc.exe”返回)。
- linux tasklet和workqueue的应用情景