Phone List

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

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

字典树递归算法：

 #include <iostream>

 #include <stdio.h>

 #include <algorithm>

 #include <string.h>

 #include <math.h>

 #include <vector>

 #include <stack>

 #include <map>

 using namespace std;

 #define ll long long int

 #define INF 5100000

 typedef struct node

 {

     struct node *next[];

     int n;

     bool end;

 } trie;

 trie *inti()

 {

     trie *t;

     t=(trie *)malloc(sizeof(trie));

     t->end=;

     t->n=;

     for(int i=; i<; i++) t->next[i]=NULL;

     return t;

 }

 int insert(trie *t,char a[])

 {

     if(t->end)return ;

     if(*a=='\0')

     {

         if(t->n)return ;

         t->end=;

         return ;

     }

     t->n++;

     if(!t->next[*a-''])t->next[*a-'']=inti();

     return insert(t->next[*a-''],a+);

 }

 void del(trie* t)

 {

     int i;

     for(i=; i<; ++i)

     {

         if(t->next[i] != NULL)

         {

             del(t->next[i]);

         }

     }

     free(t);

 }

 int main()

 {

     int n,m;

     int i,j;

     cin>>n;

     char a[];

     for(i=; i<n; i++)

     {

         trie *t;

         t=inti();

         cin>>m;

         int fla=;

         for(j=; j<m; j++)

         {

            scanf("%s",a);

             if(!fla&&!insert(t,a))

             fla=;

         }

         if(!fla)

         cout<<"YES"<<endl;

         else cout<<"NO"<<endl;

         del(t);

     }

 }

巴特西

hdu1671字典树

Phone List

最新文章

热门文章