HDU 1671 Phone List （字典树）

HDU 1671 Phone List （字典树）

Phone List

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16978    Accepted Submission(s): 5713

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: 1. Emergency 911 2. Alice 97 625 999 3. 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

2391197625999911254265113123401234401234598346

Sample Output

NOYES

Source

​​2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up（3） ​​

Recommend

lcy   |   We have carefully selected several similar problems for

you:  ​​1251​​​ ​​1247​​​ ​​1677​​​ ​​1298​​​ ​​2846​​

题解：题意不说了。。。。字典树。

AC代码：

#include#include#include#include#includeusing namespace std;typedef long long LL; using namespace std;struct node{ bool end; int a[10];};bool x;int ptr;node list[100000];void Init(){ x=true; ptr=0; for(int i=0;i<100000;i++) { list[i].end=false; for(int j=0;j<10;j++) list[i].a[j]=-1; }}void Insert(char*s){ bool z=false; bool y=false; int now=0; int len=strlen(s); for(int i=0;i

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。