[BZOJ2326][HNOI2011]数学作业 && 分段矩阵

这个矩阵的元素和当前的第i项的i取值有关 于是构造分段的矩阵 

用(A[i-1], i-1, 1) * 矩阵B得到下一项 详情见代码

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<vector>
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
const int MAXN = 18;
LL p, n, P[MAXN+10];
struct Matrix
{
    LL A[3][3];
    void init(int x)
    {
        memset(A, 0, sizeof(A));
        if(x == 1) 
            A[0][0] = A[1][1] = A[2][2] = 1;
    }
    Matrix operator * (const Matrix &t) {
        Matrix ans; ans.init(0);
        for(int k = 0; k < 3; k++)
            for(int i = 0; i < 3; i++)
                for(int j = 0; j < 3; j++)
                {
                    ans.A[i][j] += A[i][k] * t.A[k][j] % p;
                    ans.A[i][j] %= p;
                }
        return ans;
    }
    Matrix pow(LL k) {
        Matrix ans, t = *this;
        ans.init(1);
        while(k)
        {
            if(k & 1) ans = ans * t;
            t = t * t;
            k >>= 1;
        }
        return ans;
    }
};
void init()
{
    P[0] = 1;
    for(int i = 1; i <= 18; i++) P[i] = P[i-1] * 10;
}
Matrix solve(LL x, LL k)
{
    Matrix A;
    A.init(0);
    A.A[0][0] = k; A.A[1][0] = A.A[1][1] = A.A[2][0] = A.A[2][1] = A.A[2][2] = 1;
    return A.pow(x);
}
int main()
{
    cin >> n >> p;
    init(); Matrix A; A.init(1);
    for(int i = 1; ; i++)
    {
        LL L = P[i-1], R = min(P[i]-1, n);
        A = A * solve(R - L + 1, P[i] % p);
        if(R == n) break;
    }
    cout << A.A[2][0];
}