字典树

const int maxn = 1e5 + 7;
const int SIZE = 10;// 字符数量,如小写字母改为26,记得修改getid

struct Dictionary_tree{
    int cnt;
    int next[maxn][SIZE];
    int val[maxn];

    void init(){
        cnt = 0;
        memset(next[cnt],-1,sizeof(next[cnt]));
        val[0] = 0;
    }

    void add(){
        cnt++;
        memset(next[cnt],-1,sizeof(next[cnt]));
        val[cnt] = 0;
    }
    int getid(char c){
        return c - '0';
    }
    int build(char *s,int v){
        int now = 0;
        for(int i=0;s[i];i++){
            int id = getid(s[i]);
            if(next[now][id] == -1){
                add();
                next[now][id] = cnt;
            }
            now = next[now][id];
            if(val[now] == 1) return 1;
        }
        val[now] = v;
        return 0;
    }

    int query(char *s){
        int now = 0;
        for(int i=0;s[i];i++){
            int id = getid(s[i]);
            if(next[now][id] == -1) return -1;
            now = next[now][id];
        }
        return val[now];
    }
}tre;