之前用结构体排序做的,这次用字典树做一下~
#include <stdio.h>
#include <string.h>
int sz, val[100001];
struct Trie
{
int ch[10];
}s[100001];
void init()
{
memset(s[0].ch, -1, sizeof(s[0].ch));
memset(val, 0, sizeof(val));
sz = 1;
}
int idx(char c)
{
return c - '0';
}
void insert(char *ss)
{
int len = strlen(ss);
int u = 0;
for(int i = 0; i < len; i++)
{
int c = idx(ss[i]);
if(s[u].ch[c] == -1)
{
memset(s[sz].ch, -1, sizeof(s[sz].ch));
s[u].ch[c] = sz;
sz++;
}
u = s[u].ch[c];
}
val[u] = 1;
}
int query(char *ss)
{
int len = strlen(ss);
int u = 0;
for(int i = 0; i < len; i++)
{
int c = idx(ss[i]);
if(val[u])
{
return 1;
}
u = s[u].ch[c];
if(u == -1)
{
break;
}
}
if(u == -1)
{
return 0;
}
return 1;
}
int main()
{
//freopen("test0.in","r", stdin);
//freopen("test01.out","w", stdout);
int T, n, flag;
char cc[11];
scanf("%d", &T);
while(T--)
{
flag = 1;
init();
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
scanf("%s", cc);
if(flag)
{
if(i && query(cc))
{
flag = 0;
}
insert(cc);
}
}
printf(flag?"YES\n":"NO\n");
}
return 0;
}