洛谷P2375 [NOI2014]动物园

---恢复内容开始---

洛谷P2375 [NOI2014]动物园
KMP

#include <bits/stdc++.h>
#define LL long long
#define GG int
#define For(i, j, k) for(register int i=j; i<=k; i++)
#define Dow(i, j, k) for(register int i=j; i>=k; i--)
using namespace std;
inline GG read() {
    GG x = 0, f = 1;
    char ch = getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') f = -1; ch = getchar(); }
    while(ch>='0'&&ch<='9') { x = x*10+ch-48; ch = getchar(); }
    return x * f;
}

const int N = 1000011, mod = 1e9+7; 
int Q, len,ans; 
int nxt[N], num[N], cnt[N];  
char s[N]; 

inline void kmp() {
    nxt[1] = nxt[0] = 0; cnt[1] = 1; 
    int x = 0; 
    For(i, 2, len) {
        while(x && s[i]!=s[x+1]) 
            x = nxt[x]; 
        if(s[i]==s[x+1]) ++x; 
        nxt[i] = x; 
        cnt[i] = cnt[nxt[i]]+1; 
    }
}

inline int work(int u, int alpha) {
    if(u>alpha) return nxt[u] = work(nxt[u], alpha); 
    return u;
}

int main() {
    Q=read(); 
    while(Q--) {
        ans = 1; 
        scanf("%s", s+1); 
        len = strlen(s+1); 
        kmp();  
        Dow(i, len, 1) 
            num[i] = work(i, i/2);
        For(i, 1, len) 
            ans = 1ll*ans*(cnt[nxt[i]]+1) %mod; 
        printf("%d
", ans); 
    }
}

---恢复内容结束---