poj 3630 phone list

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.

trie树。

#include<cstdio>
#include<cstring>
#define M(a) memset(a,0,sizeof(a))
struct node
{
    int c[15],t;
    bool b;
}t[100010];
char s[10010][15];
int l[10010];
int main()
{
    int i,j,k,m,n,p,q,x,y,z,T;
    bool ok;
    char c;
    scanf("%d",&T);
    while (T--)
    {
        M(t);
        M(s);
        M(l);
        m=0;
        scanf("%d",&n);
        for (i=1;i<=n;i++)
          scanf("%s",s[i]+1),l[i]=strlen(s[i]+1);
        for (i=1;i<=n;i++)
        {
            p=0;
            for (j=1;j<=l[i];j++)
            {
                c=s[i][j];
                t[p].b=1;
                if (t[p].c[c-'0'])
                  p=t[p].c[c-'0'];
                else
                  p=t[p].c[c-'0']=++m;
                t[p].t++;
            }
        }
        ok=1;
        for (i=1;i<=n&&ok;i++)
        {
            p=0;
            for (j=1;j<=l[i];j++)
              p=t[p].c[s[i][j]-'0'];
            if (t[p].b) ok=0;
        }
        if (ok) printf("YES\n");
        else printf("NO\n");
    }
}