给N个字符串,找0~N中的一个字符串是否是其他的前缀。如果是则输出NO。反之输出YES。Trie在查找的时候需要判断节点的信息是否为1,最后一个节点不需要判断
// File Name: hdu1671.cpp
// Author: Toy
// Created Time: 2013年05月07日 星期二 20时47分30秒
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <utility>
#include <bitset>
#define L(x) x << 1
#define R(x) x << 1 | 1
using namespace std;
const int sigma_size = 10;
const int maxnode = 10000 * 10 + 10;
int Case, num, tmp[10005];
struct Trie {
int ch[maxnode][sigma_size];
int val[maxnode];
int sz;
void clear () { sz = 1; memset ( ch[0], 0, sizeof ( ch[0] ) ); }
int idx ( char c ) { return c - '0'; }
void insert ( string s, int v ) {
int u = 0, n = s.length ( );
for ( int i = 0; i < n; ++i ) {
int c = idx ( s[i] );
if ( !ch[u][c] ) {
memset ( ch[sz], 0, sizeof ( ch[sz] ) );
val[sz] = 0;
ch[u][c] = sz++;
}
u = ch[u][c];
}
val[u] = v;
}
void find ( string s, int cnt ) {
int u = 0, n = s.length ();
for ( int i = 0; i < n; ++i ) {
if ( s[i] == '\0' ) break;
int c = idx ( s[i] );
if ( !ch[u][c] ) break;
u = ch[u][c];
if ( val[u] == 1 && i != n - 1 )
tmp[cnt]++;
}
//if ( val[u] != 0 ) tmp[cnt]++;
}
}trie;
int main ( ) {
cin >> Case;
while ( Case-- ) {
trie.clear();
string s[10005];
cin >> num;
for ( int i = 1; i <= num; ++i ) {
cin >> s[i];
trie.insert ( s[i], 1 );
}
memset ( tmp, 0, sizeof ( tmp ) );
for ( int i = 1; i <= num; ++i )
trie.find ( s[i], i );
bool flag = 0;
for ( int i = 1; i <= num; ++i )
if ( tmp[i] == 1 ) flag = 1;
if ( flag ) cout << "NO" << endl;
else cout << "YES" << endl;
}
return 0;
}