hzoi2015（ntt+组合数学）

首先，对于行和列我们可以分别考虑，且行列式等价的，那么我们可以考虑将行的方案和列的方案求个卷积。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int N=800005;
const ll E=3;
const ll mod=998244353;

ll n;

ll power_mod(ll a,ll b,ll mod)
{
	ll ans=1;
	while (b)
	{
		if (b&1) ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}
ll inv(ll x) {return power_mod(x,mod-2,mod);}

ll omega[N],nyomega[N],g[N],f[N];
ll len,ny_n;
void ntt_init()
{
	len=1;
	while (len<n+n+2) len<<=1;
	
	ll x=power_mod(E,(mod-1)/len,mod);
	for (int i=0;i<len;i++)
	{
		omega[i]= (i==0) ? 1 :omega[i-1]*x%mod;
		nyomega[i]=inv(omega[i]);
	}
	ny_n=inv(len);
}

void work(ll *a,ll *omega,ll n)
{
	ll t=1;
	while ((1<<t)<n) t++;
	for (int i=0;i<n;i++)
	{
		ll tmp=0;
		for (int k=0;k<t;k++) if (i&(1<<k)) tmp|=(1<<t-k-1);
		if (tmp>i) swap(a[tmp],a[i]);
	}
	
	for (int len=2;len<=n;len<<=1)
	{
		int m=len>>1;
		for (int i=0;i<n;i+=len)
			for (int j=0;j<m;j++) 
			{
				ll tmp=omega[n/len*j]*a[i+j+m]%mod;
				a[i+j+m]=((a[i+j]-tmp)%mod+mod)%mod;
				a[i+j]=(a[i+j]+tmp)%mod;
			}
	}
}

void dft(ll *a) {work(a,omega,len);}
void idft(ll *a)
{
	work(a,nyomega,len);
	for (int i=0;i<len;i++) a[i]=a[i]*ny_n%mod;
}

ll ny[N],jc[N];
ll C(ll n,ll m)
{
	if (m>n) return 0ll;
	return jc[n]*ny[m]%mod*ny[n-m]%mod;
}
int main()
{
	freopen("crazy_robot.in","r",stdin);
	freopen("crazy_robot.out","w",stdout);
	
	scanf("%lld",&n);
	
	jc[0]=1;for (int i=1;i<=n;i++) jc[i]=jc[i-1]*i%mod;
	ny[1]=ny[0]=1;for (int i=2;i<=n;i++) ny[i]=(mod-mod/i)*ny[mod%i]%mod;
	for (int i=2;i<=n;i++) ny[i]=ny[i-1]*ny[i]%mod;
	
	ll x,y;

	for (int i=0;i<=n;i++) 
	{
		if (!(i&1)) 
		g[i]=C(i,i/2)*inv(i/2+1)%mod*ny[i]%mod;
	}
	
	ntt_init();
	
	dft(g);
	for (int i=0;i<len;i++) f[i]=g[i]*g[i]%mod;
	idft(f);
	for (int i=0;i<=n;i++) f[i]=f[i]*jc[i]%mod;
	
	ll ans=0;
	for (int i=0;i<=n;i++) ans=(ans+f[i]*C(n,i))%mod;
	printf("%lld",ans);
	return 0;
}