题意:
厌倦了三平铺游戏最后,迈克尔转向一个更具挑战性的游戏,四平铺:
4×N(1≤N≤109)的矩形用2×1的骨牌可以用多少种方式平铺?对于非常大的答案,输出M模(0 < M≤105)(output the answer modules M.)
画一下的话可以知道
Fn = Fn-1+4Fn-2+2Fn-3+3Fn-4+2Fn-5+3Fn-6…
(除了n-1和n-2,奇数是2倍,偶数是3倍,一直循环下去)
然后化简一下可以知道
Fn = Fn-1+5Fn-2+Fn-3-Fn-4
然后把这个状态转移方程化成矩阵,用快速幂可以求得。
(注意,最终答案要(res+m)%m),直接输出res会WA,我也不知道为什么,中途明明已经%m了,难道答案可能为负?,但是题目是说了n>=1的,难道后台数据是错的?)
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) ((x)<<1)
#define r(x) ((x)<<1|1)
#define lowbit(x) ((x)&(-(x)))
#define abs(x) ((x)>=0?(x):(-(x)))
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
int n, m;
struct mat4 {
int data[4][4];
friend mat4 operator*(const mat4& a, const mat4 &b) {
mat4 temp;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
for (int k = 0; k < 4; k++) {
temp.data[i][j] += a.data[i][k] * b.data[k][j];
temp.data[i][j] %= m;
}
return temp;
}
void init() {
for (int i = 0; i < 4; i++)
data[i][i] = 1;
}
mat4() {ms(data, 0);}
};
mat4 mPow(const mat4& a, int x) {
mat4 tt = a, ans;
ans.init();
while (x) {
if (x & 1) ans = ans * tt;
tt = tt * tt;
x = x>>1;
}
return ans;
}
int dp[111];
mat4 stand, ji,res;
int main() {
ios::sync_with_stdio(false);
stand.data[0][0] = 1;
stand.data[0][1] = 5;
stand.data[0][2] = 1;
stand.data[0][3] = -1;
stand.data[1][0] = 1;
stand.data[2][1] = 1;
stand.data[3][2] = 1;
ji.data[0][0] = 11;
ji.data[1][0] = 5;
ji.data[2][0] = 1;
ji.data[3][0] = 1;
while (cin >> n >> m,n!=0) {
res = mPow(stand, n)*ji;
//cout << res.data[3][0]<< endl;
cout << (res.data[3][0] + m)%m<< endl;
}
return 0;
}