ZOJ 1808 Immediately Decodable

字典树较简单题，无需维护标记，注意细节即可。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define N 100027

struct node
{
    node *next[];
}*root;
char ss[][];

node *create()
{
    node *p;
    p = (node *)malloc(sizeof(node));
    for(int i=;i<;i++)
        p->next[i] = NULL;
    return p;
}

void release(node *p)
{
    for(int i=;i<;i++)
    {
        if(p->next[i] != NULL)
            release(p->next[i]);
    }
    free(p);
}

void insert(char *ss)
{
    node *p = root;
    int i = ,k;
    while(ss[i])
    {
        k = ss[i++] - '';
        if(p->next[k] == NULL)
            p->next[k] = create();
        p = p->next[k];
    }
}

bool search(char *ss)
{
    node *p = root;
    int i = ,k;
    while(ss[i])
    {
        k = ss[i++] - '';
        p = p->next[k];
    }
    if(p->next[] != NULL || p->next[] != NULL)
        return false;
    return true;
}

int main()
{
    int cs = ,k,i,j,flag;
    root = create();
    i = k = ;
    while(scanf("%s",ss[i])!=EOF)
    {
        if(ss[i][] == '')
        {
            if(k == )  //如果此时没有建树
            {
                printf("Set %d is immediately decodable\n",cs++);
                continue;
            }
            flag = ;
            for(j=;j<i;j++)
            {
                if(!search(ss[j]))
                {
                    flag = ;
                    break;
                }
            }
            if(flag)
                printf("Set %d is immediately decodable\n",cs++);
            else
                printf("Set %d is not immediately decodable\n",cs++);
            i = k = ;
            release(root);
            root = create();
        }
        else
        {
            insert(ss[i]);
            k = ;
            i++;
        }
    }
    release(root);
    return ;
}