Trie树模板 POJ1056

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <stack>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <ctime>
using namespace std;

#define EdsonLin

#ifdef EdsonLin
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug(...)
#endif //EdsonLin

typedef long long ll;
typedef double db;
const int inf = 0x3f3f3f;
const int MAXN = 1e3;
const int MAXNN = 2e6+100;
//const int MAXM = 1e6;
//const int MAXM = 3e4+100;
const int MOD = 1000000007;
const db eps = 1e-3;
#define PB push_back

int readint(){int x;scanf("%d",&x);return x;}
inline int code(char x){return x-‘0‘;};

struct Tire{
    int ch[MAXN][26];
    int val[MAXN];
    int sz;
    bool sg;
   /* Tire(){
        sz = 1;
        sg = true;
        sizeof(ch[0],0,sizeof(ch[0][0]));
    }*/
    void Insert(string &s){
        int n = s.length();
        int u = 0;
        for(int i=0;i<n;i++){
            int c = code(s[i]);
            if(!ch[u][c]){
                memset(ch[sz],0,sizeof(ch[sz]));
                val[u] = 0;
                ch[u][c] = sz++;
            }else if(val[ch[u][c]]==1){
                sg = false;
            }
            u = ch[u][c];
        }
        val[u] = 1;
    }
    void init(){
        sz = 1;
        sg = true;
        memset(ch[0],0,sizeof(ch[0]));
        val[0] = 0;
    }
}solver;


using namespace std;

int main()
{
    string s[MAXN],ts;
    int mc = 0,x;
    while(cin>>ts){
        solver.init();
        x = 0;
        while(ts.compare("9")!=0){
            s[x++] = ts;
            cin>>ts;
        }
        sort(s,s+x);
        for(int i=0;i<x;i++)
            solver.Insert(s[i]);
        if(!solver.sg){
            printf("Set %d is not immediately decodable\n",++mc);
            continue;
        }else{
            printf("Set %d is immediately decodable\n",++mc);
        }
    }
    //cout << "Hello world!" << endl;
    return 0;
}