【HDU 1671】 Phone List 字典树模板题

最新推荐文章于 2022-02-07 23:04:51 发布

追风者_

最新推荐文章于 2022-02-07 23:04:51 发布

阅读量248

点赞数

分类专栏：字典树 HDU 文章标签：字典树 HDU 1671

本文链接：https://blog.youkuaiyun.com/qq_45492531/article/details/106012813

版权

该博客讨论了一道编程题目，涉及检查电话号码列表是否一致，即没有号码是另一个号码的前缀。通过使用字典树（Trie）模板来解决此问题，博客提供了思路和样例输入输出，并解释了如何修改搜索函数来判断是否存在前缀关系。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description
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
2
3
911
97625999
91125426
5
113
12340
123440
12345
98346

Sample Output
NO
YES

题意：判断当前字符串是否不为其他字符串的前缀

思路（字典树）：

模板题，套字典树的板子就行了。只需要在search函数做一点小修改，如果当前访问到color[p]==1的点，说明跑完了别的字符串，存在当前子串的字符串，返回真，若跑到trie[p][c]为空，说明不含有这样的前缀，返回假。最后跑完当前字符串都没发现有空的，说明当前字符串是其他字符串的前缀，函数结束前返回真

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include <queue>
#include <stack>
#include<vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<=n;++i)
#define per(i,n,a) for(int i=n;i>=a;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define maxn 100000+500
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
const int maxm = 100000