[矩阵快速幂优化DP] 51Nod 1311 转换机

最新推荐文章于 2021-03-25 22:45:05 发布

里阿奴摩西

最新推荐文章于 2021-03-25 22:45:05 发布

阅读量563

点赞数

分类专栏： DP 矩阵

本文链接：https://blog.csdn.net/u014609452/article/details/51823084

版权

DP 同时被 2 个专栏收录

150 篇文章 1 订阅

订阅专栏

矩阵

14 篇文章 0 订阅

订阅专栏

本文详细介绍了如何利用矩阵快速幂优化动态规划算法来解决51Nod在线判题平台上的1311号题目。通过这种方法，可以高效地求解复杂的状态转移问题，降低时间复杂度，提高程序运行效率。

摘要由CSDN通过智能技术生成

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(ll &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline int read(char *s)
{
	char c=nc(); int len=0;
	for (;!(c>='a' && c<='c');c=nc()); 
	for (;c>='a' && c<='c';s[++len]=c,c=nc()); s[len+1]=0; return len; 
}

const int P=1000000007;
const int N=105;
const int L=15; 

struct Matrix{
	int n; ll a[N][N];
	Matrix(int _n=0){
		n=_n; for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) a[i][j]=0;
	}
	ll *operator [](int x){
		return a[x];
	}
	friend Matrix operator *(Matrix &A,Matrix &B){
		int n=A.n;
		Matrix ret(n);
		for (int k=1;k<=n;k++)
			for  (int i=1;i<=n;i++)
				for (int j=1;j<=n;j++)
					(ret[i][j]+=A[i][k]*B[k][j])%=P;
		return ret;
	}
}I,A;

int len; ll ans,step;
char S[L],T[L];
int sum[3];
int cnt,hash[L][L];

inline Matrix Pow(Matrix a,ll b){
	Matrix ret=I;
	for (;b;b>>=1,a=a*a)
		if (b&1)
			ret=ret*a;
	return ret;
}

int main()
{
	ll isum=0,bsum=0; ll m,c0,c1,c2; ll a,b,c;
	freopen("goldendragonfish.in","r",stdin);
	freopen("goldendragonfish.out","w",stdout);
	len=read(S); read(T);
	read(c0); read(c1); read(c2);  read(m);
	for (int i=1;i<=len;i++)
	{
		if (S[i]==T[i]) a=0,b=0;
		if (S[i]=='a' && T[i]=='b') a=c0,b=1;
		if (S[i]=='b' && T[i]=='c') a=c1,b=1;
		if (S[i]=='c' && T[i]=='a') a=c2,b=1;
		if (S[i]=='a' && T[i]=='c') a=c0+c1,b=2;
		if (S[i]=='b' && T[i]=='a') a=c1+c2,b=2;
		if (S[i]=='c' && T[i]=='b') a=c2+c0,b=2;
		isum+=a; bsum+=b; sum[b]++;
	}
	if (m<isum) return printf("0\n"),0;
	step=bsum+(m-isum)/(c0+c1+c2)*3;
	for (int i=0;i<=len;i++)
		for (int j=0;i+j<=len;j++)
			hash[i][j]=++cnt;
	A=I=Matrix(cnt+1);
	for (int i=1;i<=cnt+1;i++) I[i][i]=1;
	for (int i=0;i<=len;i++)
		for (int j=0;i+j<=len;j++)
		{
			a=i,b=j,c=len-i-j;
			if (a)
				A[hash[a-1][b]][hash[a][b]]=a;
			if (b)
				A[hash[a+1][b-1]][hash[a][b]]=b;
			if (c)
				A[hash[a][b+1]][hash[a][b]]=c;
		}
	A[cnt+1][hash[len][0]]=A[cnt+1][cnt+1]=1;
	A=Pow(A,step+1);
	ans=A[cnt+1][hash[sum[0]][sum[1]]];
	printf("%lld\n",ans);
	return 0;
}