Luogu P2580 于是他错误的点名开始了 （Trie树模板）

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn = 1e6+10;

int n,m,num;

struct node{
    int son[26];
    int cnt;
    bool fin;
}trie[maxn];

void insert(char *s){
    int u = 0;
    int len = strlen(s);
    for(int i = 0;i < len;i++){
        int v = s[i]-‘a‘;    
        if(!trie[u].son[v]) trie[u].son[v] = ++num;
        u = trie[u].son[v];
    }
    trie[u].fin = true;
}

int query(char *s){
    int u = 0;
    int len = strlen(s);
    for(int i = 0;i < len;i++){
        int v = s[i]-‘a‘;
        if(!trie[u].son[v]) return 2;
        u = trie[u].son[v];
    } 
    if(!trie[u].fin) return 2;
    if(!trie[u].cnt) {
        trie[u].cnt++;
        return 1;
    }
    return 3;
}
    
int main(){
    scanf("%d",&n);
    for(int i = 1;i <= n;i++){
        char name[60] ;
        scanf("%s",name);
        insert(name);
    }
    scanf("%d",&m);
    for(int i = 1;i <= m;i++){
        char name[60] ;
        scanf("%s",name);
        int flag = query(name);
        if(flag == 1) printf("OK\n");
        if(flag == 2) printf("WRONG\n");
        if(flag == 3) printf("REPEAT\n");
    }
    return 0;
}