vua 10282 - Babelfish（Hash、map）

最新推荐文章于 2022-07-07 18:53:26 发布

nw4869

最新推荐文章于 2022-07-07 18:53:26 发布

阅读量600

点赞数

分类专栏：搜索文章标签： map HASH

本文链接：https://blog.csdn.net/nw4869/article/details/27236057

版权

搜索专栏收录该内容

15 篇文章 0 订阅

订阅专栏

点击打开链接

题意：100000个字的字典。

1、直接用STL中的map 0.532sAC

2、Hash 0.115sAC

#include <iostream>
#include <cstdio>
#include <string>
#include <map>
using namespace std;
int const MAX_SIZE = 11, MAX_N = 100000;
map<string,string> dict;

void print(string s)
{
	if(dict.find(s) != dict.end())
		cout << dict[s] << endl;
	else 
		cout << "eh" << endl;
}

int main()
{
	string s1, s2;
	while(cin >> s1 && cin.peek()!='\n')
	{
		cin >> s2;
		dict[s2] = s1;
	}
	print(s1);
	while(cin >> s1)
		print(s1);
	
	return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int const MAX_SIZE = 11, MAX_N = 100000, MAX_HASH = 100003;
int n;
char s1[MAX_N][MAX_SIZE], s2[MAX_N][MAX_SIZE];
int head[MAX_HASH], nextu[MAX_HASH];

void init_lookup_tabel(){ memset(head, 0, sizeof(head));}

int get_hash(char *s)
{
	int seed = 131;
	int hash = 0;
	while(*s)
		hash = hash * seed + *s++;
	return (hash & 0x7fffffff) % MAX_HASH;
}

int find(char *s)
{
	int hash = get_hash(s);
	int u = head[hash];
	while(u)
	{
		if(!strcmp(s2[u], s))
			return u;
		u = nextu[u];
	}
	return -1;
}

void try_to_insert(int i)
{
	int hash = get_hash(s2[i]);
	nextu[i] = head[hash];
	head[hash] = i;
}

void print(char *s)
{
	int i = find(s);
	if(i != -1)
		printf("%s\n", s1[i]);
	else 
		printf("eh\n");
}

int main()
{
	n = 1;
	char ss1[MAX_SIZE], ss2[MAX_SIZE];
	while(scanf("%s", ss1) && cin.peek()!= '\n')
	{
		scanf("%s", ss2);
		strcpy(s1[n], ss1);
		strcpy(s2[n], ss2);
		try_to_insert(n++);
	}
	print(ss1);
	while(scanf("%s", ss1) != EOF)
		print(ss1);

	return 0;
}