Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7358 Accepted Submission(s): 2534
Problem 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:
1. Emergency 911
2. Alice 97 625 999
3. 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.
1. Emergency 911
2. Alice 97 625 999
3. 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
Recommend
lcy
题意是说给你一些数,每个数不超过十位,让你找有没有其中一个数是另外一个数的前缀,如果有输出NO,否则输出YES。
字典树的应用。
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct Trie
{
int v;
Trie *next[10];
} Trie;
Trie *root;
void createTrie(char *str)
{
int len=strlen(str);
Trie *p=root,*q;
for(int i=0; i<len; i++)
{
int id=str[i]-'0';
if(p->next[id]==NULL)
{
q=(Trie *)malloc(sizeof(Trie));
q->v=1;
for(int j=0; j<10; j++)
q->next[j]=NULL;
p->next[id]=q;
p=p->next[id];
}
else
{
p->next[id]->v++;
p=p->next[id];
}
}
p->v=-1;
}
int findTrie(char *str)
{
int len=strlen(str);
Trie *p=root;
for(int i=0; i<len; i++)
{
int id=str[i]-'0';
p=p->next[id];
if(p==NULL)
return 0;
if(p->v==-1)
return -1;
}
return -1;
}
int deal(Trie* T)
{//这是把T清空,一开始没加这个,结果MLE.
int i;
if(T==NULL)
return 0;
for(i=0;i<10;i++)
{
if(T->next[i]!=NULL)
deal(T->next[i]);
}
free(T);
return 0;
}
int main()
{
char str[15];
int i,t,n;
scanf("%d",&t);
while(t--)
{
root = (Trie *) malloc (sizeof(Trie));
for(i=0; i<10; i++)
root->next[i]=NULL;
memset(str,0,sizeof(str));
scanf("%d",&n);
int flag=0;
for(i=0;i<n;i++)
{
scanf("%s",str);
if(findTrie(str)==-1)
flag=1;
if(flag)
continue;
else
createTrie(str);
}
if(flag)
printf("NO\n");
else
printf("YES\n");
deal(root);
}
return 0;
}