C - Phone List POJ - 3630(tire 字典树)

最新推荐文章于 2024-09-19 11:17:46 发布

zengyz-wh

最新推荐文章于 2024-09-19 11:17:46 发布

阅读量158

点赞数

分类专栏：算法文章标签： c语言 list 开发语言

本文链接：https://blog.csdn.net/qq_34832548/article/details/121219685

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

该博客介绍了如何使用C语言解决POJ - 3630问题，即检查电话号码列表是否一致，避免一个号码是另一个号码的前缀。博主分享了解题思路和AC代码，通过字典树模板来判断电话号码列表的前缀冲突情况。

摘要由CSDN通过智能技术生成

C - Phone List POJ - 3630

Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:

Emergency 911
Alice 97 625 999
Bob 91 12 54 26
In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.

Input

The first line of input gives a single integer, 1 ≤ t ≤ 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 ≤ n ≤ 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.

Output

For each test case, output “YES” if the list is consistent, or “NO” otherwise.

Sample Input

Sample Output

NO
YES

解题思路

字典树模板题,每次插入的时候顺便进行判断操作,如果每次操作都有新的分支进入并且前缀没有前面存在过的单词,则返回true,如果存在false,则输出NO即可,反之输出YES

AC代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
const int N = 100010;
int son[N][27], cnt;
bool vis[N];
char aa[20];
int t,n;
bool insert() {
	int cur= 0;
	bool flag1=false,flag2=false;
	for (int i = 0; aa[i]; i++) {
		int u = aa[i] - '0';
		if (!son[cur][u]) {
			son[cur][u] = ++cnt;
			flag1=true;
		}
		cur = son[cur][u];
		if (vis[cur])
			flag2 = true;
	}
	vis[cur]=true;
	return flag1&&!flag2;
}
int main() {

	scanf("%d",&t);
	while (t--) {
		memset(son, 0, sizeof son);
		memset(vis, false, sizeof vis);
		bool flag = true;
		cnt = 0;
		scanf("%d",&n);
		while (n--) {
			scanf("%s",aa);
			if(!insert())flag=false;
		}
		if (flag)
			puts("YES");
		else
			puts("NO");
	}
}