Trie Tree

题目意思：hiho code

    给n个字符串单词，和一个串s单词，问以s为前缀的单词有多少，自己也算，另外，可能有多个一样的单词，要单做不同单词处理。n<=1000000。这是一道字典树的题目，用了2种方法去写，一种动态节点，一种数组模拟，结果都TLE了，原因在于采用一般的标记单词末尾节点为1的方式，这样的话，就只能先找到s的结尾单词，在往下递归找到所有的带1的标记。这样递归时间花费很大。同学介绍了个方法，让标记每个节点，记录为经过的单词数。那这样处理的话，就是直接找到s的尾输出标记就ok了。O(1)的时间呀。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#define bk break
#define ct continue
#define sf scanf
#define pf printf
#define ms memset
#define si(n) sf("%d",&n)
#define pi(n) pf("%d",n)
#define REP0(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,s,n) for(int i=s;i<=(n);i++)
#define db double
#define pb push_back
#define LL long long
#define INF 0x3fffffff
#define eps 1e-8
#define PI acos(-1)
#define maxn 10000010
using namespace std;
const int tk = 26 ,tb ='a';
int top ,len, tree[maxn][tk+1+1];
void init(){
    top=1;//top是新的点的代表
    ms(tree[0],0,sizeof(tree[0]));
    tree[0][tk]=0;
}
int search(char *s){
    for(int rt=0;rt=tree[rt][*s-tb];){
        if(*(++s)==0)return tree[rt][tk];
    }
    return 0;//返回查找失败
}
void query(char *s){
    int rt=0;
    for(; *s ;s++){
        rt = tree[rt][*s-tb];
        if(rt==0)
            return ;
    }
    len = tree[rt][tk+1];
}
void insert(char *s){
    int rt,nxt;
    for(rt=0; *s ;rt=nxt,++s){
        nxt = tree[rt][*s-tb];
        if(nxt == 0){
            tree[rt][*s-tb] = nxt = top;
            ms(tree[top],0,sizeof(tree[top]));
            tree[top][tk+1]=0;
            top++;
        }
        tree[nxt][tk+1]++;
    }
    tree[rt][tk]=1;
}
void Delete(char *s){
    int rt = 0;
    for(; *s ;++s){
        rt = tree[rt][*s-tb];
    }
    tree[rt][tk]=0;
}
int prefix(char *s){//寻找最长前缀的长度
    int rt = 0,lv;
    for(int i=0; *s ;s++,lv++){
        rt = tree[rt][*s-tb];
        if(rt==0)
            break;
    }
    return lv;
}
int main(){
    #ifdef ACBang
    freopen("in.txt","r",stdin);
    #endif
    int n,m;
    char s[30];
    while(~sf("%d",&n)){
        init();
        char c='a';
        while(n--){
            sf("%s",s);
            insert(s);
        }
//        REP0(i,top)cout<<tree[i][tk]<<" ";cout<<endl;
//        REP0(i,26)cout<<tree[3][i]<<" ";cout<<endl;
//        REP0(i,26)cout<<tree[4][i]<<" ";cout<<endl;
        sf("%d",&m);
        while(m--){
            sf("%s",s);
            len=0;
            query(s);
            pf("%d\n",len);
        }
    }
    return 0;
}

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#define rt return
#define bk break
#define ct continue
#define ms memset
#define sf scanf
#define pf printf
#define si(n) sf("%d",&n)
#define pi(n) pf("%d",n)
#define REP0(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,s,n) for(int i=s;i<=(n);i++)
#define db double
#define pb push_back
#define LL long long
#define INF 0x3fffffff
#define eps 1e-8
#define PI acos(-1)
#define maxn
using namespace std;
int n,m,len;
struct node{
    int mark;
    char word;
    node *next[26];
    node(char c){
        mark=0;
        word = c;
        ms(next,0,sizeof(next));
    }
};
void insert(node *root,char s[]){
    node *p = root;
    int i=0,val;
    while(s[i]){
        val=s[i]-'a';
        if(p->next[val]==NULL){
            p->next[val] = new node(s[i]);
        }
        p = p->next[val];
        (p->mark)++;
        i++;
    }
}
void dfs(node *root){//TTTTTLLLLEEEE
    if(root->mark)len+=root->mark;
    REP0(val,26){
        if(root->next[val]!=NULL){
            dfs(root->next[val]);
        }
    }
}
int search(node *root,char s[]){
    node *p = root;
    int val,i=0;
    while(s[i]){
        val = s[i]-'a';
        if(p->next[val]==NULL){
            rt 0;
        }
        p = p->next[val];
        i++;
    }
    rt p->mark;
}
int main(){
    #ifdef ACBang
    freopen("in.txt","r",stdin);
    #endif
    while(~sf("%d",&n)){
        char s[30];
        node *root = new node('0') ;
        while(n--){
            sf("%s",s);
            insert(root,s);
        }
        sf("%d",&m);
        while(m--){
            sf("%s",s);
            len=search(root,s);
            pf("%d\n",len);
        }
    }
    rt 0;
}