Cod sursa(job #609968)

Utilizator proflaurianPanaete Adrian proflaurian Data 24 august 2011 09:29:58
Problema Trie Scor 55
Compilator cpp Status done
Runda Arhiva educationala Marime 1.42 kb
#include<cstdio>
#include<cstring>
struct trie
{
    int S,C;
    trie *N[26];
    trie()
    {
        C=S=0;
        for(int i=0;i<26;i++)N[i]=0;
    }
};
trie *R,*Q,*X,*ST[30];
int x,i,j,LG;
char L[30];
int main()
{
    freopen("trie.in","r",stdin);
    freopen("trie.out","w",stdout);
    R=new trie;R->S++;
    for(;;)
    {
        if(scanf("%d",&x)==-1)break;
        scanf("%s",L);LG=strlen(L);
        if(x==3)
        {
            for(i=0,Q=R;i<LG;i++)
            {
                if(!Q->N[L[i]-'a'])break;
                Q=Q->N[L[i]-'a'];
            }
            printf("%d\n",i);
            continue;
        }
        if(x==2)
        {
            for(i=0,Q=R;i<LG;i++)
            {
                if(!Q->N[L[i]-'a'])break;
                Q=Q->N[L[i]-'a'];
            }
            i==LG?printf("%d\n",Q->C):printf("0\n");
            continue;
        }
        for(Q=R,i=0;i<LG;i++)
        {
            ST[i]=Q;
            if(!Q->N[L[i]-'a'])Q->N[L[i]-'a']=new trie;
            Q=Q->N[L[i]-'a'];
        }
        ST[LG]=Q;
        if(!x)
        {
            for(i=0;i<LG;i++)ST[i]->S++;
            ST[LG]->C++;
            continue;
        }
        for(i=0;i<LG;i++)ST[i]->S--;
        ST[LG]->C--;
        for(i=LG-1,j=LG;;i--,j--)
        {
            if(ST[j]->C+ST[j]->S)break;
            X=ST[j];ST[j]=0;delete X;
        }
    }
    return 0;
}