F - Babelfish解题报告（map函数）（陈渊）

最新推荐文章于 2022-04-14 20:17:20 发布

原创最新推荐文章于 2022-04-14 20:17:20 发布 · 4.7k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#dictionary #string #search #each #input #64bit

hash 及二分法专题解题报告专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一个编程挑战，使用C++中的map函数来实现一个简单的翻译程序。输入包含一个包含多达100,000个条目的字典，以及一段待翻译的外语文本。程序将外语文本翻译成英文，对于未出现在字典中的词汇，则统一翻译为“eh”。

F - Babelfish

Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.

Input

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

Output

Output is the message translated to English, one word per line. Foreign 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

Sample Output

cat
eh
loops

Hint

Huge input and output,scanf and printf are recommended.

这个题目可以用到c++中的库函数map函数进行一对一的映射关系的建立，具体的关于map函数的用法，请见群共享。

#include<iostream>
#include<map>
#include<string>
using namespace std;
int main()
{
	map<string,string> search;//定义一个map函数 search
	char *a,*b;
	char line[1001];
	while(1)
	{
		gets(line);
		if(strlen(line)==0)
			break;
		a=strtok(line," ");//进行字符串的分割
		b=strtok(NULL," ");//进行字符串的分割
		search[string(b)]=string(a);//对相应的字符串进行标记
	}
	string word;
	while(cin>>word)
	{
		string result=search[word];//搜索单词
		if(result=="")
			result="eh";
		cout<<result<<endl;
	}
	return 0;
}