题目链接:https://nanti.jisuanke.com/t/41355
解题思路:
使用矩阵快速幂,但是这样算下来可能会超时,所以我们使用一个哈希表来记录每次的数值以达到一个记忆化搜索的效果。
AC代码:
#include <iostream>
#include <cstdio>
#include <unordered_map>
#include <cstring>
using namespace std;
typedef long long LL;
const int mod = 998244353;
struct mat {
LL g[4][4];
};
int q; LL n;
unordered_map<LL, LL> m;
mat a;
LL ans, Ans;
inline mat mul_mat(mat x, mat y) {
mat res;
memset(res.g, 0, sizeof res.g);
for(int i = 1; i <= 2; i ++)
for(int j = 1; j <= 2; j ++)
for(int k = 1; k <= 2; k ++) {
res.g[i][j] += x.g[i][k] * y.g[k][j];
res.g[i][j] %= mod;
}
return res;
}
inline void pow(LL b) {
mat res;
memset(res.g, 0, sizeof(res.g));
for(int i = 1; i <= 2; i ++) res.g[i][i] = 1;
while(b) {
if(b & 1) res = mul_mat(res, a);
a = mul_mat(a, a);
b >>= 1;
}
a = res;
}
int main(void) {
// freopen("in.txt", "r", stdin);
scanf("%d%lld", &q, &n);
while(q --) {
a.g[1][1] = 3, a.g[1][2] = 2, a.g[2][1] = 1, a.g[2][2] = 0;
if(m.count(n)) ans = m[n];
else pow(n - 1), ans = a.g[1][1], m[n] = ans;
n = (ans * ans) ^ n;
Ans ^= ans;
}
printf("%lld\n", Ans);
// fclose(stdin);
return 0;
}