TRIE判断前缀码POJ1056 IMMEDIATE DECODABILITY

http://poj.org/problem?id=1056

1 判断它是不是其他元素的前缀

2 判断它的前缀有没有

Description

An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary, that no two codes within a set of codes are the same, that each code has at least one bit and no more than ten bits, and that each set has at least two codes and no more than eight. 

Examples: Assume an alphabet that has symbols {A, B, C, D} 

The following code is immediately decodable: 
A:01 B:10 C:0010 D:0000 

but this one is not: 
A:01 B:10 C:010 D:0000 (Note that A is a prefix of C) 

Input

Write a program that accepts as input a series of groups of records from standard input. Each record in a group contains a collection of zeroes and ones representing a binary code for a different symbol. Each group is followed by a single separator record containing a single 9; the separator records are not part of the group. Each group is independent of other groups; the codes in one group are not related to codes in any other group (that is, each group is to be processed independently).

Output

For each group, your program should determine whether the codes in that group are immediately decodable, and should print a single output line giving the group number and stating whether the group is, or is not, immediately decodable.

Sample Input

01
10
0010
0000
9
01
10
010
0000
9

Sample Output

Set 1 is immediately decodable
Set 2 is not immediately decodable
 

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int maxnode = 80;
const int sigma_size=2;
struct Trie
{
    int ch[maxnode][sigma_size];
    int val[maxnode];
    int sz;
    void init()
    {
        sz=1;
        memset(ch[0],0,sizeof(ch[0]));
        val[0]=0;
    }
    bool insert(char *s)
    {
        int n=strlen(s),u=0;
        bool ok=true;
        for(int i=0;i<n;i++)
        {
            int id=s[i]-'0';
            if(ch[u][id]==0)
            {
                ch[u][id]=sz;//第u个节点的第id个儿子是sz;
                val[sz]=0;
                memset(ch[sz],0,sizeof(ch[sz]));
                sz++;
            }
            u=ch[u][id];
            if(val[u])//存在前缀
            {
                ok=false;//如果这个点已经有值，那么ok就变成false;
                break;
            }
        }
        val[u]=1;//变为1
        for(int i=0;i<sigma_size;i++)//因为只有01可能为其分支点，所以sigma_size=2;
        if(ch[u][i]!=0)//存在超集,判断这个节点之后有没有值，也就是判断这个是不是其他是前缀
        {
            ok=false;
            break;
        }
        return ok;
    }
};
Trie trie;
char word[10];
int main()
{
    trie.init();
    bool ok=true;
    int kase=0;
    while(gets(word))
    {
        if(strcmp(word,"9")==0)
        {
            if(ok) printf("Set %d is immediately decodable\n",++kase);
            else printf("Set %d is not immediately decodable\n",++kase);
            trie.init();
            ok=true;
            continue;
        }
        if(ok)
            ok=trie.insert(word);
    }
    return 0;
}