Cod sursa(job #754215)

Utilizator IrikosIrikos Irikos Data 1 iunie 2012 03:05:40
Problema Trie Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 2.93 kb
/*    TRIE - LFA*/

#include <cstdio>
#include <cstring> 

#define STR (*s - 'a')

using namespace std;


struct Trie
{
       int nrCuv, nrFii;               // nr de cuvinte care se termina in nodul curent           // nr de cuvinte care au cuvantul pana la nodul curent drept prefix
       Trie *fiu[26];           // pt fiecare litera a alfabetului
       Trie()
       {
             nrCuv = nrFii = 0;
             memset(fiu, 0, sizeof(fiu));
       }
};

Trie *T = new Trie;


void insert(Trie *cuvant, char *s)
{
     if(*s == '\n')
     {
            cuvant->nrCuv ++;
            return;
     }
     if(cuvant->fiu[STR] == 0)
     {
            cuvant->fiu[STR] = new Trie;
            cuvant->nrFii++;
     }
     insert(cuvant->fiu[STR], s + 1);
} 

int del(Trie *cuvant, char *s)
{
    if(*s == '\n')
          cuvant->nrCuv--;
    else if( del(cuvant->fiu[STR], s + 1))
         {
             cuvant->fiu[STR] = 0;
             cuvant->nrFii --;     
         }
         if((cuvant->nrCuv == 0) && (cuvant->nrFii == 0) && (cuvant != T))  // daca nu are cuvinte care se termina in el, nu mai are nici fii si nu e nici radacina
         {
             delete cuvant;
             return 1;
         }
    return 0;
}

int cuv(Trie *cuvant, char *s)
{
    if(*s == '\n') return cuvant->nrCuv;
    
    if(cuvant->fiu[STR])
         return cuv(cuvant->fiu[STR], s + 1);
    return 0;
}

int pref(Trie *cuvant, char *s, int k)
{
    if(*s == '\n' || cuvant->fiu[STR] == 0) return k;
    return pref( cuvant->fiu[STR], s+1, k+1 );
}


int main() 
{
char line[ 32 ];
 
freopen( "trie.txt", "r", stdin );
freopen( "trieOut.txt", "w", stdout );
 
fgets( line, 32, stdin );
 
while( !feof( stdin ) ) 
{
 switch( line[0] ) 
 {
  case '0': insert( T, line + 2 ); break;
  case '1': del( T, line + 2 ); break;
  case '2': printf( "%d\n", cuv( T, line + 2 ) ); break;
  case '3': printf( "%d\n", pref( T, line + 2, 0 ) ); break;
 } 
fgets( line, 32, stdin );
}
return 0;
}


/*

int main()
{
    FILE *f=fopen("trie.txt","rt");
    FILE *g=fopen("trieOut.txt","wt");
    int op;
    char cuvi[20];
    while(!feof(f))
    {
    fscanf(f,"%i%s",&op,cuvi);
    switch(op)
    {
    case 0:insert(T,cuvi);break;
    case 1:del(T,cuvi);break;
    case 2:fprintf(g,"%i\n",cuv(T,cuvi));break;
    case 3:fprintf(g,"%i\n",pref(T,cuvi,0));
    }
    }
fclose(f);
fclose(g);
return 0;
}
*/
/*
int main()
{
    int i;
    char s[32];
    FILE *in = fopen("trie.txt", "r");
    FILE *out = fopen("trieOut.txt", "w");
    while(fscanf(in,"%d %s",&i,s) != EOF)
    {
     if(i == 0)
                     insert(T,0);
     if(i == 1)
                     del(T,0);
     if(i == 2)
                     printf( "%d\n", cuv( T, s+2 ) ); 
     if(i == 3)
                     printf( "%d\n", pref( T, s+2, 0 ) );
    }
    fclose(in);
    fclose(out);
    return 1;
}
*/