询问有n个节点,h高度的AVL有多少种,mod 3*2^18+1 N<=65535
可以定义f[i][j]为高为i,点数为j的方案,显然这个可以由i-1和i-2的f转移过来,而且注意到转移其实就是个卷积,因此可以用多项式乘法加速,但是由于要取模,因此直接用FFT精度会不够,所以可以用mod的原根来代替FFT的单位复根,即alfa^(mo-1) = 1 (mod mo) 且其次方遍历了1~mo-1,就是NTT,且此题的(mo-1)=3*2^18>2^16>N,因此在N范围内,原根的幂次也都各不相同,满足使用NTT的条件。
比较详细介绍的博客:http://blog.miskcoo.com/2015/04/polynomial-multiplication-and-fast-fourier-transform#i-15
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
const int alfa=10;
const int mo=786433;
const int N=(1<<16); //maxn<=(1<<16)-1;
const int pi=mo-1;
const int maxN=(1<<18);
typedef long long Complex;
using namespace std;
long long A[maxN],B[maxN],C[maxN];
long long po[mo+10],inv[mo+10];
long long f[20][maxN];
int n,h;
void NTT(Complex P[], int n, int oper)
{
for (int i = 1, j = 0; i < n - 1; i++) {
for (int s = n; j ^= s >>= 1, ~j & s;);
if (i < j) {
swap(P[i], P[j]);
}
}
Complex unit_p0;
for (int d = 0; (1 << d) < n; d++) {
int m = 1 << d, m2 = m * 2;
// double p0 = pi / m * oper; 2*pi / m2
// sincos(p0, unit_p0.y, unit_p0.x);
long long p0=po[pi/m2];
if (oper==1) unit_p0=p0;
else unit_p0=inv[p0];
for (int i = 0; i < n; i += m2) {
Complex unit = 1;
for (int j = 0; j < m; j++) {
Complex &P1 = P[i + j + m], &P2 = P[i + j];
Complex t = unit * P1 % mo;
P1 = (P2 - t + mo) % mo;
P2 = (P2 + t) % mo;
unit = unit * unit_p0 % mo;
}
}
}
}
void origin()
{
po[0]=1;
for (int i=1;i<=mo-1;i++) {
po[i]=(po[i-1]*alfa)%mo;
}
inv[1]=1;
for (int i=2;i<=mo-1;i++) {
long long s=mo/i;
long long r=mo%i;
inv[i]=s*s%mo*inv[r]%mo*inv[r]%mo*i%mo;
}
}
void updata(long long a[],long long b[],long long c[])
{
for (int i=0;i<N;i++) {
A[i]=a[i];
B[i]=b[i];
}
NTT(A,N,1),NTT(B,N,1);
for (int i=0;i<N;i++) C[i]=(A[i]*B[i])%mo;
NTT(C,N,-1);
for (int i=1;i<N;i++)
c[i]=(c[i]+C[i-1]*inv[N])%mo;
}
int main()
{
origin();
scanf("%d%d",&n,&h);
f[0][1]=1;
f[1][1]=0,f[1][2]=2,f[1][3]=1;
for (int i=2;i<=h;i++) {
updata(f[i-2],f[i-1],f[i]);
updata(f[i-1],f[i-2],f[i]);
updata(f[i-1],f[i-1],f[i]);
}
printf("%d\n",(int)(f[h][n]%mo));
return 0;
}