POJ 3734 Blocks 矩阵快速幂

题目链接

Description
Panda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he starts to think of a math problem of painting. Suppose there are N blocks in a line and each block can be paint red, blue, green or yellow. For some myterious reasons, Panda want both the number of red blocks and green blocks to be even numbers. Under such conditions, Panda wants to know the number of different ways to paint these blocks.
Input
The first line of the input contains an integer T(1≤T≤100), the number of test cases. Each of the next T lines contains an integer N(1≤N≤10^9) indicating the number of blocks.
Output
For each test cases, output the number of ways to paint the blocks in a single line. Since the answer may be quite large, you have to module it by 10007.
Sample Input
2
1
2
Sample Output
2
6

题目大意：
给定N个方块排成一列。现要用红黄蓝绿四种颜色的油漆对方块进行染色，每个方块只能染成一种颜色。求红色方块和绿色方块的个数同时为偶数时的染色方案个数，输出模10007后的结果。

解题思路：
矩阵快速幂
下面是参考了《挑战程序设计》这本书得出的题目分析：
让我们试着从最左边开始染色，设染到第i个方块为止，红绿都是偶数的方案数为a_i ，红绿只有一个是偶数的方案数为b_i ，红绿都是奇数的方案数为c_i
这样，染到第i+1个方块时，有以下递推式：

a _i+1 = 2*a _i + b _i
b _i+1 = 2*a _i + 2*b _i + 2*c _i
c _i+1 = b _i + 2*c _i
将上述递推式用矩阵表示如下：
$$\left[\begin{array}{c}{a}_{i+1}\\ b_{i+1}\\ c_{i+1}\end{array}\right]=\left[\begin{array}{ccc}2& 1& 0\\ 2& 2& 2\\ 0& 1& 2\end{array}\right]\left[\begin{array}{c}{a}_i\\ b_i\\ c_i\end{array}\right]$$
由题意得，a1=2，b1=2，c1=0 ，因此可得：
$$\left[\begin{array}{c}{a}_i\\ b_i\\ c_i\end{array}\right]={\left[\begin{array}{ccc}2& 1& 0\\ 2& 2& 2\\ 0& 1& 2\end{array}\right]}^{i-1}\left[\begin{array}{c}{a}_1\\ b_1\\ c_1\end{array}\right]={\left[\begin{array}{ccc}2& 1& 0\\ 2& 2& 2\\ 0& 1& 2\end{array}\right]}^{i-1}\left[\begin{array}{c}2\\ 2\\ 0\end{array}\right]$$

AC代码：

#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> mat;
const int M = 10007;
mat mul(mat a, mat b) {
	mat c(a.size(), vec(b[0].size()));//a的行数  b的列数
	for (int i = 0; i < a.size(); i++) {
		for (int k = 0; k < b.size() ; k++) {
			for (int j = 0; j < b[0].size(); j++) {
				c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % M;
			}
		}
	}
	return c;
}
mat mod_pow(mat a, ll n) {
	mat b(a.size(), vec(a[0].size()));
	for (int i = 0; i < a.size(); i++) {
		b[i][i] = 1;
	}
	while (n > 0) {
		if (n & 1) b = mul(b, a);
		a = mul(a, a);
		n >>= 1;
	}
	return b;
}
int main() {
	int t; ll n;
	scanf("%d", &t);
	while (t--) {
		scanf("%lld", &n);
		mat a(3, vec(3));
		a[0][0] = 2; a[0][1] = 1; a[0][2] = 0;
		a[1][0] = 2; a[1][1] = 2; a[1][2] = 2;
		a[2][0] = 0; a[2][1] = 1; a[2][2] = 2;
		a = mod_pow(a, n - 1);
		ll ans = 0;
		ans += 2 * (a[0][0] + a[0][1]) % M;
		printf("%lld\n", ans);
	}
}