hdu 1671 Phone List Trie 基础模板

Phone List

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

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

 

Source

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

 

Recommend

lcy

// Trie 基础模板
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <stack>
#include <iostream>
#define Max 100000
#define sigma_size 10
using namespace std;
int ch[Max][sigma_size];
bool val[Max];
int cnt;
char str[10002];
int idx(char c)
{
    return  c-'0';
}
bool insert(char *s)
{
    int i,n=strlen(s);
    int c,u=0;
    for(i=0;i<n;i++)
    {
        c=idx(s[i]);
        if(!ch[u][c])
        {
          memset(ch[cnt],0,sizeof(ch[cnt]));
          val[cnt]=false;
          ch[u][c]=cnt++;

        }
        if(val[u]) return false;
        u=ch[u][c];
    }
    val[u]=true;
    for(i=0;i<sigma_size;i++) //做题时开始忘记这、错了下
    if(ch[u][i]) return false;
    return true;
}
int main()
{
    int T;
    int n,i;
    scanf("%d",&T);
    bool flag;
    while(T--)
    {
        flag=true;
        val[0]=0;
        memset(ch[0],0,sizeof(ch[0]));
        cnt=1;
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
            scanf("%s",str);
            if(!insert(str))
             flag=false;
        }
        if(flag)
           printf("YES\n");
        else
           printf("NO\n");
    }
    return 0;
}