poj 3734 Blocks (递推,矩阵快速幂)
来源:互联网 发布:set js 编辑:程序博客网 时间:2024/06/07 21:06
原来矩阵还能解决这样的题。。真是长知识了
让我们试着从左边开始染色。设染到第i个方块,红绿都是偶数的方案数是ai,红绿方块数为一奇一偶的方案数是bi,红绿方块数都为奇数的方案数是ci;
我们就可以得到这样的递推式:
a(i+1) = 2*ai + bi
b(i+1) = 2*ai + 2*bi + 2*ci
c(i+1) = bi + 2*ci
(a0 = 1, b0 = 0, c0 = 0)
所以就可以构造出矩阵了。。
代码:
#include<iostream>#include<cstring>#include<cstdio>using namespace std;typedef long long ll;const int mod = 1e4+7;struct node{ ll s[3][3];};node mul(node a, node b){ node t; memset(t.s, 0, sizeof(t.s)); for(int i = 0; i < 3; i++) for(int j = 0; j < 3; j++) for(int k = 0; k < 3; k++) t.s[i][j] = (t.s[i][j]+a.s[i][k]*b.s[k][j])%mod; return t;}node mt_pow(node p, int k){ node q; memset(q.s, 0, sizeof(q.s)); for(int i = 0; i < 3; i++) q.s[i][i] = 1; while(k) { if(k&1) q = mul(p, q); p = mul(p, p); k /= 2; } return q;}int main(void){ int n, t; cin >> t; while(t--) { scanf("%d", &n); if(!n) puts("1"); else { node base; base.s[0][0] = 2; base.s[0][1] = 1; base.s[0][2] = 0; base.s[1][0] = 2; base.s[1][1] = 2; base.s[1][2] = 2; base.s[2][0] = 0; base.s[2][1] = 1; base.s[2][2] = 2; node ans = mt_pow(base, n); printf("%d\n", ans.s[0][0]); } } return 0;}
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
212
Sample Output
26
Source
- POJ 3734 Blocks 线性递推 矩阵快速幂
- Poj 3734 Blocks【矩阵快速幂+递推】
- Poj 3734 Blocks【递推+矩阵快速幂】好题
- 【POJ 3734】Blocks(递推+矩阵快速幂)
- poj 3734 Blocks (递推,矩阵快速幂)
- Blocks - POJ 3734 矩阵乘法递推
- poj 3734 Blocks 递推+矩阵幂优化
- poj 3734 Blocks 【矩阵快速幂】
- POJ 3734 Blocks(矩阵快速幂)
- POJ 3734 Blocks(矩阵快速幂)
- 【POJ 3734 Blocks】+ 矩阵快速幂
- poj 3734 Blocks(矩阵快速幂)
- poj #3734 Blocks(矩阵快速幂)
- POJ 3734 Blocks 矩阵快速幂
- poj 3734 Blocks【矩阵快速幂染色】
- [POJ 3734] Blocks (矩阵快速幂、组合数学)
- poj 3734 Blocks(构造矩阵加快速幂)
- [POJ 3734] Blocks (矩阵快速幂、组合数学)
- 菜鸟之路——Spring MVC(一)初探
- keep-alive和websocket有什么区别
- C语言知识框架图-6大版块
- 【NOIP2001提高组T2】数的划分-DP
- [bzoj1196] 公路修建问题
- poj 3734 Blocks (递推,矩阵快速幂)
- matlab矩阵分解
- View绘制详解
- 【数位计数问题】之【按位求和】
- 通过模板快速生成一个单利(内部类写法)
- Java类与对象
- 20161105学习心得
- std vector与std list的效率比较
- 96. Unique Binary Search Trees