poj 2503 Babelfish Trie

最新推荐文章于 2018-02-01 11:56:00 发布

GadyPu

最新推荐文章于 2018-02-01 11:56:00 发布

阅读量337

点赞数

分类专栏： Trie

本文链接：https://blog.csdn.net/u012077152/article/details/44042125

版权

Trie 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

原题链接：http://poj.org/problem?id=2503

这道题用：快排+二分，Treap，Tries，都过了，最快的Tries +静态内存也要516ms。

二分+快排也要625ms⊙﹏⊙b汗。

具体实现如下：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef char State[11];
typedef struct tries_t{
	State eng;
	struct tries_t *pNext[26];
}tries, *Tries;
tries node[300000];
int sz = 0;
Tries root = NULL;
Tries built(){
	Tries T = &node[sz++];
	memset(T, 0, sizeof(tries));
	return T;
}
void insert(Tries T, char *source, char *eng){
	Tries q = NULL;
	char *p = source;
	while (*p != '\0'){
		int t = *p - 'a';
		if (T->pNext[t] == NULL){
			q = built();
			T->pNext[t] = q;
			T = q;
		}
		else T = T->pNext[t];
		p++;
	}
	strcpy(T->eng, eng);
}
void search(Tries T, char *source){
	char *p = source;
	while (*p != '\0'){
		int t = *p - 'a';
		if (T == NULL || T->pNext[t] == NULL){
			printf("eh\n");
			return;
		}
		T = T->pNext[t];
		p++;
	}
	printf("%s\n", T->eng);
}
int main(){
	root = built();
	State buf,eng, fori;
	while (gets(buf) && buf[0] != '\0') {
		sscanf(buf, "%s %s", eng, fori);
		insert(root, fori, eng);
	}
	while (gets(fori)) search(root, fori);
	return 0;
}