2018_2_5_Babelfish_词典_map_STL

最新推荐文章于 2021-01-25 16:42:05 发布

原创最新推荐文章于 2021-01-25 16:42:05 发布 · 195 阅读

0 ·

CC 4.0 BY-SA版权

poj 同时被 3 个专栏收录

130 篇文章

订阅专栏

词典

6 篇文章

订阅专栏

map

5 篇文章

订阅专栏

本文介绍了一个使用 C++ 在 POJ 平台上解决翻译问题的方法。具体包括了如何通过字典映射实现从一种语言到另一种语言的转换，并提供了一段完整的示例代码。该解决方案适用于大规模输入输出场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

poj G++能过
Babelfish

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 46957		Accepted: 19676

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.

Source

Waterloo local 2001.09.22

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

const int maxn=1e5+10;
const int maxs=10+5;

map<string,string> dict;

bool isblank(char s[]){
	int k=strlen(s);
	while(--k>=0)
	if(isalpha(s[k]))
	return false;
	return true;
}

char t1[maxs],t2[maxs];
int main(){
	char s[maxs*2];
	int n=0;
	gets(s);
	while(!isblank(s)){
		sscanf(s,"%s%s",t1,t2);
		dict[t2]=t1;
		gets(s);
	}
	int k;
	while(scanf("%s",s)!=EOF){
		if(dict.end()==dict.find(s)){
			puts("eh");
		}else{
			puts(dict[s].c_str());
		}
	}
}