POJ3630 Phone List Trie树

题目链接

http://poj.org/problem?id=3630

分析

Trie树，插入时可顺便检查是否经过了终止节点，另外插入完当前字符串后还要检查其终止节点是否有儿子，可能当前字符串是之前某个字符串的前缀。

AC代码

#include <cstdio>
#include <cstring>

inline int read() {
	int num = 0;
	char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9')
		num = num * 10 + c - '0', c = getchar();
	return num;
}

const int maxn = 1e4 + 5;

struct Trie {
	int ch[10 * maxn][10], cnt[10 * maxn], tot;

	int add() {
		++tot;
		memset(ch[tot], 0, sizeof(ch[tot]));
		return tot;
	}

	int insert(char* s) {
		int p = 0;
		for (int i = 0; s[i]; ++i) {
			if (cnt[p]) return 0;
			if (!ch[p][s[i] - '0']) ch[p][s[i] - '0'] = add();
			p = ch[p][s[i] - '0'];
		}
		for (int i = 0; i < 10; ++i)
			if (ch[p][i]) return 0;
		++cnt[p];
		return 1;
	}
} trie;

char s[15];

int main() {
	int t = read();
	while (t--) {
		memset(trie.ch, 0, sizeof(trie.ch));
		memset(trie.cnt, 0, sizeof(trie.cnt));
		trie.tot = 0;
		int n = read(), flag = 1;
		for (int i = 1; i <= n; ++i) {
			scanf("%s", s);
			if (!trie.insert(s)) flag = 0;
		}
		if (flag) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}