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.

/*要用数组存储*/

#include<iostream>
#include<cstring>
using namespace std;
struct node
{
    int flag;
    int next[10];
}tri[56000];
int create(char phone[],int &now);
int main()
{
    int t,n,flag,now;
    char phone[15];
    cin>>t;
    while(t--)
    {
        cin>>n;
        flag=0;
        now=1;
        while(n--)
        {
            cin>>phone;
            if(flag==0)
            {
                flag=create(phone,now);
            }
        }
        if(flag)
        cout<<"NO"<<endl;
        else
        cout<<"YES"<<endl;
        memset(tri,0,sizeof(node)*now);
    }
}
int create(char phone[],int &now)
{
    int loc=0;
    char *q=phone;
    while(*q)
    {
        if(tri[loc].next[*q-'0']==0)
        {
            tri[loc].next[*q-'0']=now;
            ++now;
        }
        loc=tri[loc].next[*q-'0'];
        ++q;
        if(tri[loc].flag)
        return 1;
    }
    tri[loc].flag=1;
    int i;
    for(i=0;i<10;++i)
    if(tri[loc].next[i])
    return 1;
    return 0;
}