AC自动机修正

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<cstring>
 #define PAU putchar(' ')
 #define ENT putchar('\n')
 using namespace std;
 const int maxn=+,sig=;
 struct ACauto{
     struct node{node*ch[sig],*fail;int cnt;char x;}AC[maxn],*root;int nodecnt;
     int id[];queue<node*>RAM;
     node*newnode(){
         node*t;
         if(!RAM.empty()) t=RAM.front();
         else t=&AC[++nodecnt];
         //t->fail=root;
         t->cnt=;
         return t;
     }
     void init(){
         for(int i=;i<sig;i++) id[i+'a']=i;
         root=&AC[];root->cnt=;root->x='#';nodecnt=;return;
     }
     void insert(char*s){
         int len=strlen(s);node*x=root;
         for(int i=;i<len;i++){
             int c=id[s[i]];
             if(!x->ch[c]) x->ch[c]=newnode();
             x=x->ch[c];x->x=s[i];
         } x->cnt++;return;
     }
     void getfail(){
         queue<node*>Q;Q.push(root);
         while(!Q.empty()){
             node*x=Q.front();Q.pop();
             for(int c=;c<sig;c++){
                 if(x->ch[c]){
                     node*p=x->fail;while(p&&!p->ch[c])p=p->fail;
                     x->ch[c]->fail=p?p->ch[c]:root;Q.push(x->ch[c]);
                 } else x->ch[c]=x==root?root:x->fail->ch[c];
             }
         } return;
     }
     int query(char*s){
         int len=strlen(s);node*x=root,*p;int sum=;
         for(int i=;i<len;i++){
             int c=id[s[i]];x=x->ch[c];
             for(node*p=x;p&&p->cnt;p=p->fail) sum++;
         } return sum;
     }
 }sol;
 inline int read(){
     int x=,sig=;char ch=getchar();
     while(!isdigit(ch)){if(ch=='-')sig=-;ch=getchar();}
     while(isdigit(ch))x=*x+ch-'',ch=getchar();
     return x*=sig;
 }
 inline void write(int x){
     if(x==){putchar('');return;}if(x<)putchar('-'),x=-x;
     int len=,buf[];while(x)buf[len++]=x%,x/=;
     for(int i=len-;i>=;i--)putchar(buf[i]+'');return;
 }
 char s[],t[];
 void init(){
     scanf("%s",s);
     scanf("%s",t);
     sol.init();
     sol.insert(s);
     sol.getfail();
     write(sol.query(t));
     return;
 }
 void work(){
     return;
 }
 void print(){
     return;
 }
 int main(){init();work();print();return ;}