Phone List题解（字典树）

最新推荐文章于 2024-10-15 16:11:10 发布

afsfsfssf

最新推荐文章于 2024-10-15 16:11:10 发布

阅读量754

点赞数

分类专栏： ACM题解报告

本文链接：https://blog.csdn.net/u013766716/article/details/41804041

版权

ACM题解报告专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Phone List 字典树题解

【科普】什么是BestCoder？如何参加？

Phone List

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11266 Accepted Submission(s): 3863

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.

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

Sample Output

Source

2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up（3）

题解：

hdu1251字典树的变形，直接套模板吧。

注意动态开辟内存会出超内存，所以要free掉！

// 12 7
// by qiu
// funtion trie
#include <cstdio>
#include <cstdlib>
#include <malloc.h>
#include <cstring>
typedef struct node{
    int val;
    struct node *next[10];
}tree;
tree *build(){
            tree *root=(tree*)malloc(sizeof(node));
            root->val=1;
            for(int i=0; i<10; i++)
                     root->next[i]=NULL;
           return root;
}
void insert_tree(tree *root, char *s){
              int i=0;
              while(s[i]){
                    int k=s[i]-'0';
                    if(!root->next[k])
                              root->next[k]=build();
                    else
                              root->next[k]->val++;

                    root=root->next[k];
                    i++;

              }
}
int search_tree(tree *root, char *s){
           int cnt=0, i=0;
          while(s[i]){
                    int k=s[i]-'0';
                    if(!root->next[k])
                               return 0;
                    cnt=root->next[k]->val;
                    root=root->next[k];
                    i++;
            }
            return cnt;
}
void Delete(tree *T){
            if(T==NULL)
                    return;
          for(int i=0; i<10; i++)
                    if(T->next[i]!=NULL)
                            Delete(T->next[i]);
          free(T);
          return ;

}
int main(){
            int t, n, i;
            char s[10010][11];
            scanf("%d", &t);
            while(t--){
          scanf("%d", &n);
           tree *Root=build();
          for(i=0; i<n; i++){
                    scanf("%s", s[i]);
                    insert_tree(Root, s[i]);
           }
            for(i=0; i<n; i++){
            if(search_tree(Root, s[i])>1)
                    break;

           }
          if(i>=n)
                    printf("YES\n");
          else
                    printf("NO\n");
                    Delete(Root);

    }
   return 0;
}