POJ - 2503 Babelfish （map || 字典树模板题）

最新推荐文章于 2022-04-09 22:28:03 发布

Tdyh_NY

最新推荐文章于 2022-04-09 22:28:03 发布

阅读量272

点赞数

分类专栏：字典树

本文链接：https://blog.csdn.net/Tdyh_NY/article/details/78133026

版权

字典树专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Babelfish

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 46265		Accepted: 19415

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

题意：

题目还是比较容易读懂的意思是给你一些key-value对然后再给你value 让你判断value是否出现过如果出现过输出key 否则输出eh

本来以为非要字典树才能过的但是发现map一发也能过先贴一个map过的代码 map用的不是很熟

#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <iomanip>
using namespace std;
int cnt ;
map <string,string> MAP;
int main()
{
	char temp[100];
	while ( gets(temp) ) {
		string str_first, str_second;
		int length_temp = strlen(temp);
		if (!temp[0]) break;
		int pos = 0;
		while (temp[pos] != ' ') {
			str_first += temp[pos++];
		}
		pos ++;
		while (pos != length_temp) {
			str_second += temp[pos++];
		}
		MAP[str_second] = str_first;
	}
	string str;
	while ( ~scanf("%s",temp) ) {
		str = temp;
		if (MAP.count(str)) {
			cout << MAP[str] << endl;
		} else {
			cout << "eh" << endl;
		}
	}
}

这份代码如果交C++能比G++快2000ms+ 神奇

然后在贴一个字典树写的代码吧字典树的思路还是比较简单的每次都把value存起来然后cnt就是边号把这个边号当成哈希值来用把对应的key按这个值存起来然后在询问的时候数出来就好

字典树的这份能跑260ms左右

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 10001100;
int tree[N][26] = {0};
bool nums[N] ;
int cnt ;
char key_value[N][11];
void Insert(char *value)
{
	int length_value = strlen(value);
	int i = 0;
	int k = 0;
	while (value[i]) {
		int pos = value[i++] - 'a';
		if (tree[k][pos] == 0)
			tree[k][pos] = cnt ++;
		k = tree[k][pos];
	}
	nums[k] = true;
}
int Find(char *p)
{
	int length_p = strlen(p);
	int i = 0; 
	int k = 0;
	while (p[i]) {
		int pos = p[i++] - 'a';
		if (tree[k][pos] == 0)
			return 0;
		k = tree[k][pos];
	}
	return k;
}
int main()
{
	char str_first[100];
	char str_second[100];
	char str[200];
	cnt = 1;
	memset(nums, false, sizeof(nums));
	while (gets(str)) {
		if (str[0] == 0) break;
		sscanf(str, "%s %s", str_first, 
		str_second);
		Insert(str_second);
		strcpy(key_value[cnt-1] , str_first);
	}
	while (~scanf("%s",str)) {
		int res;
		res = Find(str);
		if (!res) printf("eh\n");
		else printf("%s\n",key_value[res]);
	}
}