HDU1671 字典树

Phone List

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

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

2

3

911

97625999

91125426

5

113

12340

123440

12345

98346

 

Sample Output

NO

YES

 

题意：

一次给出n个电话号码，如果刚给出的一个电话号码的前几位包含前面给出的某一个号码则这个号码不能拨打（输入那前几位时就会马上打出去了）。

代码：

 //字典树的权值作为标记点，每输入一个号码，查找他每一位的val值有没有等于1的，如果没有就把他放入字典树他的最后一
 //位的val值置为1，如果有说明与前面的某一个冲突。
 #include<iostream>
 #include<cstdio>
 #include<cstring>
 using namespace std;
 const int MAX=;
 const int CON=;
 int nod[MAX][CON],val[MAX];
 int sz;
 void init()
 {
     sz=;
     memset(nod[],,sizeof(nod[]));
     val[]=;
 }
 void insert(char s[])
 {
     int len=strlen(s);
     int rt=;
     for(int i=;i<len;i++)
     {
         int id=s[i]-'';
         if(nod[rt][id]==)
         {
             memset(nod[sz],,sizeof(nod[sz]));
             nod[rt][id]=sz;
             val[sz++]=;
         }
         rt=nod[rt][id];
     }
     val[rt]=;
 }
 int search(char s[])
 {
     int len=strlen(s);
     int rt=,cnt=;
     for(int i=;i<len;i++)
     {
         int id=s[i]-'';
         if(nod[rt][id]==)
         return ;
         rt=nod[rt][id];
         if(val[rt]==)
         return ;
     }
 }
 int main()
 {
     char ch[];
     int t,n,flag;
     scanf("%d",&t);
     while(t--)
     {
         init();
         scanf("%d",&n);
         flag=;
         for(int i=;i<=n;i++)
         {
             scanf("%s",ch);
             if(flag) continue;
             flag=search(ch);
             insert(ch);
         }
         if(flag) printf("NO\n");
         else printf("YES\n");
     }
     return ;
 }