Bless You Autocorrect

input/code.cpp: In member function 'void node::insert(const char*)':
input/code.cpp:15:13: warning: array subscript has type 'char' [-Wchar-subscripts]
     if(!p[*s])(p[*s]=nodes+(++np))->p[28]=this,p[*s]->l=1010101;
             ^
input/code.cpp:15:20: warning: array subscript has type 'char' [-Wchar-subscripts]
     if(!p[*s])(p[*s]=nodes+(++np))->p[28]=this,p[*s]->l=1010101;
                    ^
input/code.cpp:15:52: warning: array subscript has type 'char' [-Wchar-subscripts]
     if(!p[*s])(p[*s]=nodes+(++np))->p[28]=this,p[*s]->l=1010101;
                                                    ^
input/code.cpp:16:9: warning: array subscript has type 'char' [-Wchar-subscripts]
     p[*s]->insert(s+1);
         ^
input/code.cpp: In member function 'void node::shortcut(const char*)':
input/code.cpp:19:21: warning: array subscript has type 'char' [-Wchar-subscripts]
     node* v = p[*s++];
                     ^
input/code.cpp:20:35: warning: array subscript has type 'char' [-Wchar-sub...

#include <string>
#include <iostream>
#include <queue>
using namespace std;
int np=0;
struct node;
node* nodes;
char prefix[1010101];
struct node{
  node* p[29];
  int l;
  bool trav;
  void insert(const char* s){
    if(!*s)return;
    if(!p[*s])(p[*s]=nodes+(++np))->p[28]=this,p[*s]->l=1010101;
    p[*s]->insert(s+1);
  }
  void shortcut(const char* s){
    node* v = p[*s++];
    while(*s&&v->p[27])v=v->p[*s++];
    if(!*s&&v->p[27])return;
    node* k=v;
    const char* sv=s;
    while(*s)k=k->p[*s++];
    s=sv;
    while(*s)v->p[27]=k,v=v->p[*s++];
    k->p[27]=k;
  }
  void bfs(){
    queue<node*> q;
    q.emplace(this);
    l=0;
    while(!q.empty()){
      node* v = q.front();
      q.pop();
      for(int i=0;i<29;++i)if(v->p[i]&&v->p[i]->l>v->l+1)v->p[i]->l=v->l+1,q.push(v->p[i]);
    }
  }
  int search(const char* s){
    node* v=this;
    while(*s&&v->p[*s])v=v->p[*s++];
    int n=v->l;
    while(*s)++n,++s;
    return n;
  }
  void traverse(int j){
    if(trav)return;
    trav=true;
    cout<<this<<':'<<prefix<<": "<<l<<";";
    for(int i=0;i<27;++i){
      prefix[j]=i+'a'-1;
      if(p[i])cout<<' '<<prefix;
    }
    cout<<' '<<p[27]<<' '<<p[28]<<'\n';
    for(int i=0;i<29;++i){
      prefix[j]=i+'a'-1;
      if(p[i])p[i]->traverse(j+1);
    }
    prefix[j]=0;
  }
};
void map(std::string& s){for(auto& it : s)it-='a'-1;}
node nodes_[1010101];
int main(){
  nodes=nodes_;
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n,m;
  cin>>n>>m;
  string v;
  while(n--)cin>>v,map(v),nodes[0].insert(v.c_str()),nodes[0].shortcut(v.c_str());
  nodes[0].bfs();
  while(m--)cin>>v,map(v),cout<<nodes[0].search(v.c_str())<<'\n';
  prefix[0]='@';
  //nodes[0].traverse(1);
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED