/*
http://poj.org/problem?id=3630
Phone List
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 19441 Accepted: 6122
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.
Sample Input
2
3
911
97625999
91125426
5
113
12340
123440
12345
98346
Sample Output
NO
YES
Source
Nordic 2007
解析:
题意:给出一组号码判断是否有号码出现在另一个号码里
思路:
构造tire树,并标记一下每组单词的结尾节点信息。
边构造tire树,边判断本段号码是否已经含有另个号码
17636K 469MS C++ 896B
*/
#include<stdio.h>
#include<string.h>
#include <iostream>
using namespace std;
const int maxn=400000+10;
int cnt,tr[maxn][11];
int node[maxn];
void init()
{
cnt=1;
memset(tr[0],0,sizeof(tr));
}
int insert(char s[])
{
int u=0;
int len=strlen(s);
for(int i=0;i<len;i++)
{ int c=s[i]-'0';
if(tr[u][c]==0)
{
memset(tr[cnt],0,sizeof(tr[cnt]));
node[cnt]=0;
tr[u][c]=cnt++;
}
u=tr[u][c];
if(node[u]==1)//里面已经含有别的号码,也就是说已经隐含了前缀
return 1;
if(i==len-1)
{
for(int j=0;j<10;j++)
{
if(tr[u][j])//自己本身跟某个号码重复
return 1;
}
}
}
node[u]=1;
return 0;
}
int main()
{
int i,j,T,n,flag;
scanf("%d",&T);
while(T--)
{ flag=0;
scanf("%d",&n);
init();
char s[10010];
while(n--)
{scanf("%s",s);
if(!flag)
flag=insert(s);
}
printf("%s\n",flag==0 ? "YES":"NO");
}
return 0;
}