HDU 5950题解(矩阵快速幂)

HDU 5950

• 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5950
• 根据题目大意可得如下的递推公式，其中a和b分别由外部输入，对于给定$n$，求$f(n)$
  $$\{\begin{array}{ll}f(1)=a& (n=1)\\ f(2)=b& (n=2)\\ f(n)=f(n-1)+2f(n-2)+n^4& (n\ge 3)\end{array}$$
• 通过上面的递推式可以知道$f(n+1)$和$f(n)$，$f(n-1)$，$n^4$，$n^3$，$n^2$，$n$，$1$有关
  所以可以得到如下的关系
  { ​ f ( n ) ​ ​ f ( ​ n ​ − ​ 1 ​ ) ​ ​ n ​ 4 ​ ​ n ​ 3 ​ ​ n ​ 2 ​ ​ n ​ ​ 1 ​ } { ​ 1 ​ ​ 1 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ 2 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ 1 ​ ​ 0 ​ ​ 1 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ 4 ​ ​ 0 ​ ​ 4 ​ ​ 1 ​ ​ 0 ​ ​ 0 ​ ​ 0 ​ 6 ​ ​ 0 ​ ​ 6 ​ ​ 3 ​ ​ 1 ​ ​ 0 ​ ​ 0 ​ 4 ​ ​ 0 ​ ​ 4 ​ ​ 3 ​ ​ 2 ​ ​ 1 ​ ​ 0 ​ 1 ​ ​ 0 ​ ​ 1 ​ ​ 1 ​ ​ 1 ​ ​ 1 ​ ​ 1 } ​ = ​ { ​ f ( ​ n ​ + ​ 1 ​ ) ​ ​ f ( n ) ​ ​ ( n ​ + ​ 1 ) 4 ​ ​ ( n ​ + ​ 1 ) 3 ​ ​ ( n ​ + ​ 1 ) 2 ​ ​ n ​ + ​ 1 ​ ​​ 1 ​ } \small \begin{Bmatrix} \!f(n)\! & \!f(\!n\!-\!1\!)\! & \!n\!^4\! & \!n\!^3\! & \!n\!^2 \!& \!n\! & \!1\! \end{Bmatrix} \begin{Bmatrix} \!1\! & \!1\! & \!0\! & \!0\! & \!0\! & \!0\! & \!0 \\ \!2\! & \!0\! & \!0\! & \!0\! & \!0\! & \!0\! & \!0 \\ \!1\! & \!0\! & \!1\! & \!0\! & \!0\! & \!0\! & \!0 \\ \!4\! & \!0\! & \!4\! & \!1\! & \!0\! & \!0\! & \!0 \\ \!6\! & \!0\! & \!6\! & \!3\! & \!1\! & \!0\! & \!0 \\ \!4\! & \!0\! & \!4\! & \!3\! & \!2\! & \!1\! & \!0 \\ \!1\! & \!0\! & \!1\! & \!1\! & \!1\! & \!1\! & \!1 \end{Bmatrix} \!=\! \begin{Bmatrix} \!f(\!n\!+\!1\!)\! & \!f(n)\! & \!(n\!+\!1)^4\! & \!(n\!+\!1)^3\! & \!(n\!+\!1)^2\! & \!n\!+\!1\! & \!\!1\! \end{Bmatrix} \small {f(n)​f(n−1)​n4​n3​n2​n​1​}⎩⎪⎪⎪⎪⎪⎪⎨⎪⎪⎪⎪⎪⎪⎧​1214641​1000000​0014641​0001331​0000121​0000011​0000001​⎭⎪⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎪⎫​={f(n+1)​f(n)​(n+1)4​(n+1)3​(n+1)2​n+1​1​}
• 初始向量如下
  $$\left\{\begin{array}{ccccccc}f(2)& f(1)& 16& 8& 4& 2& 1\end{array}\right\}$$
• 代码

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>

const int MATRIX_SIZE = 7;
const std::int64_t MOD = 2147493647;

struct Matrix {
    std::int64_t data[MATRIX_SIZE][MATRIX_SIZE];

    Matrix() {
        std::memset(data, 0, sizeof(data));
        for (int i = 0; i < MATRIX_SIZE; ++i) {
            data[i][i] = 1L;
        }
    }

    explicit Matrix(const std::int64_t data[][MATRIX_SIZE]) {
        std::memcpy(this->data, data, sizeof(this->data));
    }

    Matrix operator * (const Matrix &matrix) {
        Matrix result;
        std::memset(result.data, 0, sizeof(result.data));
        for (int i = 0; i < MATRIX_SIZE; ++i) {
            for (int j = 0; j < MATRIX_SIZE; ++j) {
                for (int k = 0; k < MATRIX_SIZE; ++k) {
                    result.data[i][j] = result.data[i][j] + ((data[i][k] % MOD) * (matrix.data[k][j] % MOD) % MOD);
                    result.data[i][j] %= MOD;
                }
            }
        }
        return result;
    }
};

struct Vector {
    std::int64_t data[MATRIX_SIZE];

    Vector() {
        std::memset(data, 0, sizeof(data));
    }

    explicit Vector(std::int64_t data[MATRIX_SIZE]) {
        std::memcpy(this->data, data, sizeof(this->data));
    }

    Vector operator * (const Matrix &matrix) {
        Vector result;
        for (int i = 0; i < MATRIX_SIZE; ++i) {
            for (int j = 0; j < MATRIX_SIZE; ++j) {
                result.data[i] += ((data[j] % MOD) * (matrix.data[j][i] % MOD) % MOD);
                result.data[i] %= MOD;
            }
        }
        return result;
    }
};

const std::int64_t matrix_array[][MATRIX_SIZE] {
    1, 1, 0, 0, 0, 0, 0,
    2, 0, 0, 0, 0, 0, 0,
    1, 0, 1, 0, 0, 0, 0,
    4, 0, 4, 1, 0, 0, 0,
    6, 0, 6, 3, 1, 0, 0,
    4, 0, 4, 3, 2, 1, 0,
    1, 0, 1, 1, 1, 1, 1
};

const Matrix mat(matrix_array);

Matrix quick_multiply(Matrix matrix, int n) {
    Matrix result;
    if (n <= 0) {
        return result;
    }
    while (n) {
        if (n & 0x1) {
            result = matrix * result;
        }
        matrix = matrix * matrix;
        n >>= 1;
    }
    return result;
}

int main() {
    int count = 0;
    // std::freopen("build/data.txt", "r", stdin);
    std::int64_t a, b, n;
    std::cin >> count;
    std::int64_t temp[MATRIX_SIZE] = {
        0, 0, 16, 8, 4, 2, 1
    };
    while (count--) {
        std::cin >> n >> temp[1] >> temp[0];
        if (n == 1) {
        	std::cout << temp[1] % MOD << std::endl;
        } else if (n == 2) {
        	std::cout << temp[0] % MOD << std::endl;
        } else {
	        Vector result(temp);
	        result = result * quick_multiply(mat, n - 2);
	        std::cout << result.data[0] << std::endl;
        }
    }
    return 0;
}