杭电 1671——Phone List

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

//

# include<stdio.h>

# include<string.h>

# include<stdlib.h>

struct node {

       struct node *child[10];

       int n;//n=0时，该点未走过；n=1时，表示走过，但不是终结点；n=2表示终结点

};

struct node *root,r[110000];//r[]存储静态地址

int L,flag;

struct node *Newnode()

{

       struct node *p;

       int i;

       p=&r[L];L++;

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

           p->child[i]=NULL;

       p->n=0;

       return p;

}

void Insert(char s[])

{

       int i,len;

       struct node *p,*q;

       len=strlen(s);

       if(len==0)

              return ;

       p=root;

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

       {

              if(p->child[s[i]-'0']==NULL)

              {

                     q=Newnode();

                     if(i==len-1)//终结点置为2

                            q->n=2;

                     else

                            q->n=1;

                     p->child[s[i]-'0']=q;

                     p=q;

              }

              else

              {

                     p=p->child[s[i]-'0'];

                     if(p->n==2)//经过终结点

                     {

                            flag=1;

                            return ;

                     }

              }

       }

       for(i=0;i<10;i++)//如果未走到终结点，表示该串为前面某一串的前缀

              if(p->child[i]!=NULL)

              {

                     flag=1;

                     return ;

              }

       return ;

}

int main()

{

       int t,num;

       char s[12];

       scanf("%d",&t);

       while(t--)

       {

              scanf("%d",&num);

              flag=0;

              L=0;

              root=Newnode();

              while(num--)

              {

                     scanf("%s",s);

                     if(flag)

                            continue;

                     Insert(s);

              }

              if(flag)

                     printf("NO\n");

              else

                     printf("YES\n");

       }

       return 0;

}