bzoj1009

  1 #include <cstdio>
  2 #include <cstring>
  3 #include <cstdlib>
  4 #include <cmath>
  5 #include <deque>
  6 #include <vector>
  7 #include <queue>
  8 #include <iostream>
  9 #include <algorithm>
 10 #include <map>
 11 #include <set>
 12 #include <ctime>
 13 using namespace std;
 14 typedef long long LL;
 15 typedef double DB;
 16 #define For(i, s, t) for(int i = (s); i <= (t); i++)
 17 #define Ford(i, s, t) for(int i = (s); i >= (t); i--)
 18 #define MIT (2147483647)
 19 #define INF (1000000001)
 20 #define MLL (1000000000000000001LL)
 21 #define sz(x) ((int) (x).size())
 22 #define clr(x, y) memset(x, y, sizeof(x))
 23 #define puf push_front
 24 #define pub push_back
 25 #define pof pop_front
 26 #define pob pop_back
 27 #define ft first
 28 #define sd second
 29 #define mk make_pair
 30 inline void SetIO(string Name) {
 31     string Input = Name+".in",
 32     Output = Name+".out";
 33     freopen(Input.c_str(), "r", stdin),
 34     freopen(Output.c_str(), "w", stdout);
 35 }
 36 
 37 const int N = 30, M = 20;
 38 int n, m, Mod;
 39 int Tot;
 40 struct Matrix {
 41     int M[N][N];
 42     
 43     Matrix() {
 44         clr(M, 0);
 45     }
 46     
 47     inline Matrix operator *(Matrix &A) {
 48         Matrix Ret;
 49         For(i, 0, Tot)
 50             For(j, 0, Tot)
 51                 For(k, 0, Tot) {
 52                     Ret.M[i][j] += M[i][k]*A.M[k][j];
 53                     Ret.M[i][j] %= Mod;
 54                 }
 55         return Ret;
 56     }
 57 } Transfer;
 58 struct Node {
 59     int Child[M], Next;
 60     bool Danger;
 61     #define Child(x, y) Tr[x].Child[y]
 62     #define Next(x) Tr[x].Next
 63     #define Danger(x) Tr[x].Danger
 64 } Tr[N];
 65 string S;
 66 queue<int> Que;
 67 
 68 inline void Input() {
 69     scanf("%d%d%d", &n, &m, &Mod);
 70     cin>>S;
 71 }
 72 
 73 inline int Find(int x, int y) {
 74     while(x && !Child(x, y)) x = Next(x);
 75     return Child(x, y);
 76 }
 77 
 78 inline void Build() {
 79     int Now = 0;
 80     For(i, 0, m-1) {
 81         int x = S[i]-‘0‘;
 82         Child(Now, x) = ++Tot;
 83         Danger(Tot) = 0;
 84         Now = Tot;
 85     }
 86     Danger(Tot) = 1;
 87     
 88     Next(0) = 0;
 89     For(i, 0, 9) Next(Child(0, i)) = 0;
 90     For(i, 0, 9)
 91         if(Child(0, i)) Que.push(Child(0, i));
 92     while(sz(Que)) {
 93         int x = Que.front();
 94         Que.pop();
 95         for(int Tab = Next(x); Tab && !Danger(x); Tab = Next(Tab))
 96             Danger(x) |= Danger(Tab);
 97         
 98         For(i, 0, 9)
 99             if(Child(x, i)) Que.push(Child(x, i));
100         
101         For(i, 0, 9)
102             if(Child(x, i)) Next(Child(x, i)) = Find(Next(x), i);
103             else Child(x, i) = Find(Next(x), i);
104     }
105     
106     For(i, 0, Tot) {
107         if(Danger(i)) continue;
108         For(j, 0, 9) {
109             if(Danger(Child(i, j))) continue;
110             Transfer.M[i][Child(i, j)]++;
111         }
112     }
113 }
114 
115 inline Matrix Power(Matrix &Basic, int Tim) {
116     Matrix Ret;
117     For(i, 0, Tot) Ret.M[i][i] = 1;
118     while(Tim) {
119         if(Tim&1) Ret = Ret*Basic;
120         Basic = Basic*Basic, Tim >>= 1;
121     }
122     return Ret;
123 }
124 
125 inline void Solve() {
126     Build();
127     
128     Matrix Ret;
129     Ret = Power(Transfer, n);
130     
131     int Ans = 0;
132     For(i, 0, Tot)
133         if(!Danger(i)) Ans += Ret.M[0][i];
134     Ans %= Mod;
135     
136     printf("%d\n", Ans);
137 }
138 
139 int main() {
140     SetIO("1009");
141     Input();
142     Solve();
143     return 0;
144 }