hdu1671-Phone List 字典树

Phone List

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

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

  
  

   
   2
3
911
97625999
91125426
5
113
12340
123440
12345
98346
  
  

 

Sample Output

  
  

   
   NO

   
   
YES
   
   


   
   
题目大意：
   
   
问你一个数是不是另外一个数的前缀，是的话就输出NO，否则输出YES，我刚开始还弄反了，是一道很经典的字典树的问题。模板题：
   
   


   
   
ac代码：
   
   

   
   
#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
int root,sign;
int str[100005][10],dis[100005];
char s[15];
void insert(char *s,int v){
    int u,ans;
    u=ans=0;
    for(;*s;s++){
        if(!str[u][*s-'0']){
        str[u][*s-'0']=root++;
        ans++;
        }
        else
        if(dis[str[u][*s-'0']]!=0)  //在移动的过程中看是否有过字符串是这个串的前缀
        sign=1;
        u=str[u][*s-'0'];
    }
    if(!ans)                        //这种就是前缀后出现时，走的全是别的字符串走过的路径时
    sign=1;
    dis[u]=v;
}                                   //静态字典树模板
int main(){
    int n,i,t;
    scanf("%d",&t);
    while(t--){
    root=1;
    sign=0;
    scanf("%d",&n);
    memset(str,0,sizeof(str));
    memset(dis,0,sizeof(dis));
    for(i=1;i<=n;i++){
        cin>>s;
        if(sign)                    //如果已经确认存在前缀的话就不用继续插入了
        continue;
        insert(s,i);
    }
    if(sign)
    printf("NO\n");
    else
    printf("YES\n");
    }
    return 0;
}

   
   

   
   


   
   题目链接：点击打开链接http://acm.hdu.edu.cn/showproblem.php?pid=1671