#include<iostream>
using namespace std;
const int kind =10;
bool loop;
struct tree
{
	int num;
	bool flag;             
	tree *next[kind];     
	tree()
	{
		int i;num=0;flag=false;  
		for(i=0;i<kind;i++)
		   next[i]=NULL;
	}
};
void insert(tree *&root,char word[])
{
	tree *location=root;
	int i=0,branch=0;
	if(location==NULL)
	{
		location=new tree();	root=location;
	}
	while(word[i])
	{
		branch=word[i]-'0';
		if(location->next[branch]==NULL)
	    	location->next[branch]=new tree();
		i++;
		location=location->next[branch];
		if(location->flag==true)
		{	
			location->num++; 
			if(location->num>=2)
				loop=false;
		}
	}
		location->flag=true;
		location->num++;
		for(i=0;i<kind;i++)
		{	if(location->next[i]!=NULL)
			{
				location->flag=true;
				location->num++;	
			    if(location->num>=2)
			     loop=false;
			}
		}
}
int main()
{
	int t,n,i;
	char str[15];
	cin>>t;
	while(t--)
	{
		tree  *root=NULL;
		cin>>n;
		loop=true;
		for(i=0;i<n;i++)
		{
		cin>>str;
		insert(root,str);
		}
		if(loop==true)
			cout<<"YES"<<endl;
		else
			cout<<"NO"<<endl;
	}
	return 0;
}

• Re:晕了 TRIE树超了，模拟过了 (77) jxnuxiaoyong 2010-01-15 17:28:24
  • Re:很明显应该用静态数组的Trie (87) StudyRush 2010-01-15 19:34:44
    • Re:很明显应该用静态数组的Trie (17) zihuacs 2010-05-30 11:36:00
• Re:晕了 在我家的破电脑上动态都能过，这测评机。。。 (14) qyjubriskxp 2010-06-10 01:48:48