【BZOJ3670】【NOI2014】动物园 [KMP][倍增]

 1 #include<iostream>    
 2 #include<string>    
 3 #include<algorithm>    
 4 #include<cstdio>    
 5 #include<cstring>    
 6 #include<cstdlib>    
 7 #include<cmath>
 8 #include<bitset>
 9 using namespace std;  
10 typedef long long s64;
11   
12 const int ONE=1000005;
13 const int MOD=1000000007;
14   
15 int T;
16 int n;
17 char a[ONE];
18 int fail[ONE];
19 int LOG[ONE],f[21][ONE],Dep[ONE];
20 int Ans;
21   
22 int get()
23 {    
24         int res=1,Q=1;char c;    
25         while( (c=getchar())<48 || c>57 ) 
26         if(c==‘-‘)Q=-1; 
27         res=c-48;     
28         while( (c=getchar())>=48 && c<=57 )    
29         res=res*10+c-48;    
30         return res*Q;    
31 }
32   
33 void Deal_KMP(char a[])
34 {
35         int j=0;
36         Dep[1]=1;
37         for(int i=2;i<=n;i++)
38         {
39             while(a[j+1] != a[i] && j) j=fail[j];
40             if(a[j+1] == a[i]) j++;
41             fail[i] = j;
42             f[0][i] = j;  Dep[i] = Dep[j]+1;
43         }
44 }
45   
46 void Dfs()
47 {
48         for(int u=1;u<=n;u++)
49         for(int i=0;i<=LOG[Dep[u]];i++)
50         f[i+1][u] = f[i][f[i][u]];
51 }
52   
53 int Deal_Ans(int x,int Limit)
54 {
55         for(int i=LOG[Dep[x]];i>=0;i--)
56         if(f[i][x] > Limit) x = f[i][x];
57         return Dep[f[0][x]]; 
58 }
59   
60 int main() 
61 {
62         T=get();
63         for(int i=2;i<=ONE-1;i++) LOG[i]=LOG[i>>1]+1;
64         while(T--)
65         {
66             scanf("%s",a+1);    n=strlen(a+1);
67             Deal_KMP(a);        Dfs();
68               
69             Ans=1;
70             for(int i=1;i<=n;i++)
71             {
72                 Ans = (s64)Ans * ( Deal_Ans(i,i>>1)+1 ) % MOD;
73             }
74                   
75             printf("%d\n",Ans);
76         }
77 }