HLG-1375(矩阵乘法+快速幂)

最新推荐文章于 2022-02-28 22:36:43 发布

w-y-p

最新推荐文章于 2022-02-28 22:36:43 发布

阅读量498

点赞数

分类专栏：矩阵

本文链接：https://blog.csdn.net/u014492306/article/details/40350881

版权

矩阵专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个算法问题，即计算从起点出发，在限定步数内返回起点的所有可能路径数量。通过构建矩阵并运用快速幂运算的方法，高效地解决了该问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The Active Leyni

Time Limit: 1000 MS

Memory Limit: 65536 K

Total Submit: 54(25 users)

Total Accepted: 32(22 users)

Rating:

Special Judge: No

Description

There is a map of the town where Leynilives.

The vertex S indicates the home of Leyniand the vertexes A, B, C indicate the homes of his friends. They are connectedto each other as the map presents.

Leyni is too active that he can’t stayidle. It will count one step every time when he walks from one place toanother. He starts from his home S and won’t stop.

He wonders the number of ways in which hecan go from his home S to itself in exactly n steps. Thenumber may be quite large, you should output it modulo 1000000007.

Input

There are multiple test cases. Thefirst line of input is an integer T indicating the number of test cases. Then T test cases follow.

For each test case:

Line 1. This line contains an integer n (1 ≤ n ≤ 10⁹) indicating the required steps.

Output

For each test case:

Line 1. Output the number of waysmodulo 1000000007.

Sample Input

Sample Output

Hint

In the first sample, the possible pathsare:

S=>A=>S

S=>B=>S

S=>C=>S

题意：从s出发，求走n步回到s的路径数。

设s[i][S]为走i步到S的路径数，则

由动态规划思想推得：

s[i][S]=s[i-1][A]+s[i-1][B]+s[i-1][C]，即3*s[i-1][A]；

s[i][A]=s[i-1][B]+s[i-1][C]+s[i-1][S]，即2*s[i-1][A]+s[i-1][S]；

同理B，C；

由此可通过矩阵乘的快速幂运算快速求得，

构造矩阵

0 3 X 0(S) 0

1 2 1(A) 0

#include<iostream>
using namespace std;
#define s 1000000007
void mul(long int a[2][2],long int b[2][2])
{
	long int c[2][2];
			for(int i=0;i<2;i++)
				for(int j=0;j<2;j++)
				{
					c[i][j]=0;
					for(int k=0;k<2;k++)
						c[i][j]=(c[i][j]+a[i][k]*b[k][j])%s;
				}
				for(int x=0;x<2;x++)
					for(int y=0;y<2;y++)
						b[x][y]=c[x][y];
}
void f(int x,long int a[2][2],long int b[2][2])
{
	while(x)
	{
		if(x&1)
			mul(a,b);
		mul(a,a);
		x>>=1;
	}
}
int main()
{
	int n;
	long int x;
	cin>>n;
	while(n--)
	{
		long int a[2][2]={0,3,1,2};
		long int b[2][2]={0,0,1,0};
		cin>>x;
		f(x-1,a,b);
		cout<<b[0][0]<<endl;
	}
	return 0;
}