[矩阵快速幂 数学] UR #16 A.破坏发射台

其实那个不考虑对角是可以手推的

考虑对角只能dp了

详见官方题解以及百度文库：多边形染色公式

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long ll;

const ll P=998244353;

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

const int N=55;

ll n,m;

int sx[N],sy[N],cnt;
ll ans;

struct Matrix{  
    int n; ll a[15][15];  
    Matrix(int in=0,int f=0){  
        n=in; for (int i=0;i<=n;i++) for (int j=0;j<=n;j++) a[i][j]=0;  
        if (f==1) for (int i=0;i<=n;i++) a[i][i]=1;   
    }
    ll *operator [](int x){  
        return a[x];  
    }  
    void print(){
    	for (int i=0;i<=n;i++,dprintf("\n")) for (int j=0;j<=n;j++,dprintf(" ")) dprintf("%lld",a[i][j]); dprintf("\n");
	}
    friend Matrix operator * (Matrix &A,Matrix &B) {  
        int n=A.n; Matrix ret(n);  
        for (int i=0;i<=n;i++)     
            for (int j=0;j<=n;j++)  
                for (int k=0;k<=n;k++)  
                    (ret[i][j]+=A[i][k]*B[k][j]%P)%=P;  
        return ret;  
    }  
    friend Matrix Pow(Matrix A,int b){  
        Matrix ret(A.n,1);  
        for (;b;b>>=1,A=A*A)
            if (b&1)  
                ret=ret*A;  
        return ret;  
    }  
}A;  

inline ll calc(int x,int y){
	if (x==0)
		return y>=1?m-2:max(m-3,0LL);
	return x!=y;
}



int main(){
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	scanf("%lld%lld",&n,&m);
	if (n&1)
		return printf("%lld\n",((Pow(m-1,n)%P+(m-1)*((n&1)?-1:1))+P)%P),0;
	A=Matrix(8);
	for (int i=0;i<=8;i++)
	{
		int x1=i/3,x2=i%3;
		if (x1 && x1==x2) continue;
		for (int j=0;j<=8;j++){
			int y1=j/3,y2=j%3;
			A[i][j]=calc(x1,y1)*calc(x2,y2)%P;
			if (i==0) 
				A[i][j]=(A[i][j]-min(calc(x1,y1),calc(x2,y2))+P)%P;
		}
	}
	(++A[0][0])%=P;
//	A.print();
	A=Pow(A,(n/2)-1);
//	A.print();
	ans=(A[0][5]+A[2][5]+A[3][5]+A[5][5])%P*(m*(m-1)%P)%P;
	printf("%lld\n",ans);
	return 0;
}