Description
Solution
O
(
n
3
T
2
log
k
)
O(n^3T^2\log k)
O(n3T2logk)的做法显然,
因为我们是倍增做的嘛,我们发现倍增的数组没有必要记录全部,因为经过的路径个数已知,为
2
i
2^i
2i,所以直接记录方案数即可,
这样就可以优化成
O
(
(
n
3
T
+
n
2
T
2
)
log
k
)
O((n^3T+n^2T^2)\log k)
O((n3T+n2T2)logk)了
Code
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
typedef long long LL;
const int N=55,mo=998244353;
int read(int &n)
{
int q=1;n=0;char ch=' ';
for(;ch!='-'&&(ch<'0'||ch>'9');ch=getchar());
if(ch=='-')ch=getchar(),q=-1;
for(;ch<='9'&&ch>='0';ch=getchar())n=((n<<1)+(n<<3))+ch-48;
return n=n*q;
}
int n,m,K;
LL C[N][N];
LL g[N][N],f[2][N][N][N],f1[N][N][N];
LL c[N][N][N];
LL er[N],er0[N];
int sc[N][N];
void CHENfg(int I)
{
fo(k,1,n)fo(i,1,n)fo(j,1,n)
fo(l,0,K)c[i][j][l]=(c[i][j][l]+f[I][k][j][l]*g[i][k])%mo;
fo(i,1,n)fo(j,1,n)
{
fod(k,K,0)
{
LL t=0;
fo(l,0,k)t=(t+c[i][j][l]*er[k-l]%mo*C[k][l])%mo;
f[I][i][j][k]=(t+f[0][i][j][k]+g[i][j]*er[k])%mo;
c[i][j][k]=0;
}
}
}
void CHENgg()
{
fo(k,1,n)fo(i,1,n)fo(j,1,n)c[0][i][j]=(c[0][i][j]+g[i][k]*g[k][j])%mo;
fo(i,1,n)fo(j,1,n)g[i][j]=c[0][i][j],c[0][i][j]=0;
}
int main()
{
int q,w,_;
read(n),read(m),read(_),read(K);
fo(i,1,n)fo(j,1,n)g[i][j]=read(q);
C[0][0]=1;
fo(i,1,K)
{
C[i][0]=C[i][i]=1;
fo(j,1,i-1)C[i][j]=(C[i-1][j]+C[i-1][j-1])%mo;
}
er0[0]=1;fo(i,1,K)er0[i]=(er0[i-1]<<1)%mo;
fo(i,0,K)er[i]=1;
for(--m;m;m>>=1,CHENgg())
{
if(m&1)CHENfg(1);
CHENfg(0);
fo(i,0,K)er[i]=er[i]*er0[i]%mo;
}
fo(i,1,n)fo(j,1,n)g[i][j]=(f[1][i][j][K]+mo)%mo;
fo(I,1,_)
{
read(q),read(w);
printf("%lld\n",g[q][w]);
}
return 0;
}