AC自动机修正

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstring>
#define PAU putchar(' ')
#define ENT putchar('
')
using namespace std;
const int maxn=1000000+10,sig=2;
struct ACauto{
    struct node{node*ch[sig],*fail;int cnt;char x;}AC[maxn],*root;int nodecnt;
    int id[156];queue<node*>RAM;
    node*newnode(){
        node*t;
        if(!RAM.empty()) t=RAM.front();
        else t=&AC[++nodecnt];
        //t->fail=root;
        t->cnt=0;
        return t;
    }
    void init(){
        for(int i=0;i<sig;i++) id[i+'a']=i;
        root=&AC[0];root->cnt=0;root->x='#';nodecnt=0;return;
    }
    void insert(char*s){
        int len=strlen(s);node*x=root;
        for(int i=0;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=0;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=0;
        for(int i=0;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=0,sig=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')sig=-1;ch=getchar();}
    while(isdigit(ch))x=10*x+ch-'0',ch=getchar();
    return x*=sig;
}
inline void write(int x){
    if(x==0){putchar('0');return;}if(x<0)putchar('-'),x=-x;
    int len=0,buf[15];while(x)buf[len++]=x%10,x/=10;
    for(int i=len-1;i>=0;i--)putchar(buf[i]+'0');return;
}
char s[1000010],t[1000010];
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 0;}