GRE Words Revenge AC自动机 二进制分组

GRE Words Revenge

题意和思路都和上一篇差不多。

有一个区别就是需要移动字符串。关于这个字符串，可以用3次reverse来转换， 前面部分翻转一下， 后面部分翻转一下， 最后整个串翻转一下就好了。

注意就是多组测试，需要初始化。

#include<bits/stdc++.h>
using namespace std;
#define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);
#define LL long long
#define ULL unsigned LL
#define fi first
#define se second
#define pb push_back
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
const int INF = 0x3f3f3f3f;
const LL mod =  (int)1e9+7;
const int N = 1e7;
struct Node{
    static const int m = 2;
    static const int KN = N;
    int next[KN][m], fair[KN], tot = 0, mark[KN], mark1[KN], root[20], cnt = 0, si[20];
    void init(){
        tot = cnt = 0;
    }
    int newtree(){
        tot++;
        fair[tot] = mark[tot] = mark1[tot] = 0;
        memset(next[tot], 0, sizeof(next[tot]));
        return tot;
    }
    void Build(int x){
        queue<int> q;
        q.push(x);
        int pos, p, v;
        while(!q.empty()){
            pos = q.front(), q.pop();
            for(int i = 0; i < m; i++){
                if(!next[pos][i]) continue;
                p = fair[pos]; v = next[pos][i];
                while(p && !next[p][i]) p = fair[p];
                if(p) fair[v] = next[p][i];
                else fair[v] = x;
                q.push(v);
                mark1[v] = mark1[fair[v]] + mark[v];
            }
        }
    }
    void Add(char s[], char ch){
        root[++cnt] = newtree(); si[cnt] = 1;
        int pos = root[cnt];
        for(int i = 0; s[i]; i++){
            if(!next[pos][s[i]-ch]) next[pos][s[i]-ch] = newtree();
            pos = next[pos][s[i]-ch];
        }
        mark[pos]++;
        while(si[cnt] == si[cnt-1]){
            Unit(root[cnt-1], root[cnt]);
            si[--cnt] *= 2;
        }
        Build(root[cnt]);
    }
    int Query(char s[], char ch){
        int pos, ret = 0;
        for(int id = 1; id <= cnt; id++){
            pos = root[id];
            for(int i = 0; s[i]; i++){
                while(pos && !next[pos][s[i]-ch]) pos = fair[pos];
                if(pos) pos = next[pos][s[i]-ch];
                else pos = root[id];
                ret += mark1[pos];
            }
        }
        return ret;
    }
    void Unit(int u, int v){
        mark[u] += mark[v];
        for(int i = 0; i < m; i++){
            if(!next[u][i] || !next[v][i]) next[u][i] += next[v][i];
            else Unit(next[u][i], next[v][i]);
        }
    }
}ac;
char str[N];
set<ULL> st;
ULL v = 0;
int main(){
    int n, m, L = 0, len, k;
    scanf("%d", &n);
    for(int cas = 1; cas <= n; cas++){
        L = 0;
        ac.init();
        st.clear();
        scanf("%d", &m);
        printf("Case #%d:
", cas);
        while(m--){
            scanf("%s", str);
            len = strlen(str+1);
            k = L % len;
            reverse(str+1, str+1+k);
            reverse(str+1+k, str+1+len);
            reverse(str+1, str+1+len);
            if(str[0] == '+'){
                v = 1;
                for(int i = 1; str[i]; i++){
                    v = v * 3 + (str[i]-'0');
                }
                if(st.count(v)) continue;
                else {
                    st.insert(v);
                    ac.Add(str+1,'0');
                }
            }
            else {
                L = ac.Query(str+1, '0');
                printf("%d
", L);
            }
        }
    }
    return 0;
}