Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11498 Accepted Submission(s): 3921
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给你n个字符串,如果其中有有一个字符串是其他字符串的前缀,输出NO,否则YES。。。题不难,但字典树一定要记得释放内存,这次我可是记住了。。。#include <iostream> #include <cstdio> #include <cstring> #include <stdlib.h> using namespace std; const int N = 10010; struct node { int flag; struct node *next[12]; }; int cmp(const void *a,const void *b) { return strcmp((char *)a,(char *)b); } int n; int flag; struct node *build() { struct node *p; p=(struct node *)malloc(sizeof(struct node)); for(int i=0;i<10;i++) p->next[i]=NULL; p->flag=0; return p; } void insert(char s[],struct node *r) { int len=strlen(s); for(int i=0;i<len;i++) { int k=s[i]-'0'; if(r->next[k]==NULL) { r->next[k]=build(); } r=r->next[k]; if(r->flag>0) flag=0; } r->flag=1; } void Delete(node *p) { for(int i=0; i<10; i++) { if(p->next[i]!=NULL) Delete(p->next[i]); } free(p); } int main() { int T; scanf("%d",&T); while(T--) { node *root=build(); scanf("%d",&n); char s[N][11]; flag=1; for(int i=0;i<n;i++) { scanf("%s",s[i]); } qsort(s,n,sizeof(s[0]),cmp); for(int i=0;i<n;i++) { if(flag) insert(s[i],root); } if(!flag) printf("NO\n"); else printf("YES\n"); Delete(root); } return 0; }