Codeforces Round 641 F2. Slime and Sequences （生成函数）（拉格朗日反演）

传送门

• 注意到好的序列到一个排列是一个双射，在序列上的数 $a_{p_i}$ 等于 $i$ 前方的小于号个数加一，其中小于号指的是相邻两个数的大小关系，下面我们对这个排列进行计数

• $f_{i,j}$ 表示长度为 $i$ 至少 $j$ 个 $<$ 的个数，恰为斯特林数 $S_{i,i-j}$，每一组内钦定递增
  $g_{i,j}$ 表示正好 $j$ 个 $<$ 的个数（可以 $O(n^2)$ 简单 $dp$）

$$g_{i,j}=\sum _{k\ge j}(-1{)}^{k-j}(\genfrac{}{}{0ex}{}{k}{j})f_{i,j}$$

• 考虑每个数的贡献，钦定它前面有 $i$ 个 $<$
  $$\begin{gathered} an{s}_i=\sum _{j=i}^n{g}_{j,i}\ast \left(\genfrac{}{}{0ex}{}{n}{j}\right)(n-j)! \\ =\sum _{j=i}^n\sum _{k=i}^n{S}_{j,j-k}(-1{)}^{k-i}(\genfrac{}{}{0ex}{}{k}{i})\frac{n!}{j!} \\ =n!\sum _{k=i}^n(-1{)}^{k-i}\left(\genfrac{}{}{0ex}{}{k}{i}\right)\sum _{j=k}^n[x^j](e^x-1{)}^{j-k} \end{gathered}$$

• 考虑快速求出 $$\begin{gathered} f_k=\sum _{j=k}^n[x^j](e^x-1{)}^{j-k} \\ =[x^k]\sum _{j=1}^{n-k}(\frac{e^x-1}{x}{)}^j \\ =[x^k]\frac{F^{n-k+1}-F}{F-1} \end{gathered}$$

• 考虑对每个 $k$ 求出（ $F=\frac{e^x-1}{x}$ ，$G=e^x-1$）
  $$\begin{gathered} [x^k]\frac{F^{n-k+1}}{1-F}=[x^{n+1}]\frac{G^{n-k+1}}{1-F} \\ =[x^{n+1}{y}^{n-k+1}]\sum _{i\ge 0}\frac{(yG{)}^i}{1-F} \\ =[x^{n+1}{y}^{n-k+1}]\frac{1}{1-yG}\frac{1}{1-F} \end{gathered}$$
  构造 $\varphi (x)$ 使得 $F=\varphi (G)$，则 $G=xF,\frac{G}{\varphi (G)}=x$
  聪明的你们肯定看出构造的用意了，令 $T(x)=\frac{x}{\varphi (x)}$，拉个朗日反演
  令 $H(x)=H(T(G))=\frac{1}{1-yx}\frac{1}{1-\varphi (x)}$
  $$\begin{gathered} [x^{n+1}][y^{n-k+1}]H(G)=[x^n][y^{n-k+1}]\frac{1}{n+1}\frac{\text{d}H}{\text{d}x}(\frac{x}{T}{)}^{n+1} \\ =\frac{1}{n+1}[y^{n-k+1}][x^n](\frac{-((1-xy)(1-\varphi (x)){)}^{\prime }}{(1-xy{)}^2(1-\varphi (x){)}^2}\varphi (x{)}^{n+1}) \\ =\frac{1}{n+1}[y^{n-k+1}][x^n](\frac{y(1-\varphi (x))+\varphi (x{)}^{\prime }(1-xy)}{(1-xy{)}^2(1-\varphi (x){)}^2})\varphi (x{)}^{n+1} \\ =\frac{1}{n+1}[y^{n-k+1}][x^n](\frac{y}{(1-xy{)}^2(1-\varphi (x))}+\frac{\varphi (x{)}^{\prime }}{(1-xy)(1-\varphi (x){)}^2}\varphi (x{)}^{n+1}) \end{gathered}$$

= 1 n + 1 [ y n − k + 1 ] [ x n ] ϕ ( x ) n + 1 ( 1 ( 1 − ϕ ( x ) ) ∑ t ≥ 0 x t y t + 1 ( t + 1 ) + ϕ ( x ) ′ ( 1 − ϕ ( x ) ) 2 ∑ t ≥ 0 x t y t ) = 1 n + 1 [ x n ] ϕ ( x ) n + 1 { 1 ( 1 − ϕ ( x ) ) ( n − k + 1 ) x n − k + ϕ ( x ) ′ ( 1 − ϕ ( x ) ) 2 x n − k + 1 } = 1 n + 1 ( [ x k ] ( n − k + 1 ) ϕ ( x ) n + 1 1 − ϕ ( x ) + [ x k − 1 ] ϕ ( x ) ′ ϕ ( x ) n + 1 ( 1 − ϕ ( x ) ) 2 ) =\frac{1}{n+1}[y^{n-k+1}][x^n]\phi(x)^{n+1}(\frac{1}{(1-\phi(x))}\sum_{t\ge 0}x^ty^{t+1}(t+1)+\frac{\phi(x)'}{(1-\phi(x))^2}\sum_{t\ge 0}x^ty^t)\\=\frac{1}{n+1}[x^n]\phi(x)^{n+1}\{\frac{1}{(1-\phi(x))}(n-k+1)x^{n-k}+\frac{\phi(x)'}{(1-\phi(x))^2}x^{n-k+1}\}\\=\frac{1}{n+1}([x^k]\frac{(n-k+1)\phi(x)^{n+1}}{1-\phi(x)}+[x^{k-1}]\frac{\phi(x)'\phi(x)^{n+1}}{(1-\phi(x))^2}) =n+11​[yn−k+1][xn]ϕ(x)n+1((1−ϕ(x))1​t≥0∑​xtyt+1(t+1)+(1−ϕ(x))2ϕ(x)′​t≥0∑​xtyt)=n+11​[xn]ϕ(x)n+1{(1−ϕ(x))1​(n−k+1)xn−k+(1−ϕ(x))2ϕ(x)′​xn−k+1}=n+11​([xk]1−ϕ(x)(n−k+1)ϕ(x)n+1​+[xk−1](1−ϕ(x))2ϕ(x)′ϕ(x)n+1​)

• $\varphi (x)=\frac{x}{\ln (x+1)}$，$O(n\log n)$

#include<bits/stdc++.h>
#define pb push_back
#define cs const
#define poly vector<int>
using namespace std;
cs int Mod = 998244353;
int add(int a, int b){ return a + b >= Mod ? a + b - Mod : a + b; }
int dec(int a, int b){ return a - b < 0 ? a - b + Mod : a - b; }
int mul(int a, int b){ return 1ll * a * b % Mod; }
int ksm(int a, int b){ int as=1; for(;b;b>>=1,a=mul(a,a)) if(b&1) as=mul(as,a); return as; }
void Add(int &a, int b){ a = add(a, b); }
void Dec(int &a, int b){ a = dec(a, b); }
void Mul(int &a, int b){ a = mul(a, b); }
cs int K = 18, N = 1 << K | 5;
int n, fc[N], ifc[N], iv[N];
int *w[K+1], rv[N], bit, up;
void output(poly a){ for(int i=0; i<a.size(); i++) cout<<a[i]<<" "; puts(""); }
void fc_init(int n){
	fc[0]=fc[1]=ifc[0]=ifc[1]=1;
	for(int i=2; i<=n; i++) fc[i]=mul(fc[i-1],i);
	for(int i=2; i<=n; i++) ifc[i]=mul(ifc[i-1],iv[i]);
}
void NTT_init(){
	for(int i=1; i<=K; i++) w[i]=new int[1<<(i-1)];
	int wn=ksm(3,(Mod-1)/(1<<K)); w[K][0]=1;
	for(int i=1; i<(1<<(K-1)); i++) w[K][i]=mul(w[K][i-1],wn);
	for(int i=K-1;i;i--) for(int j=0;j<(1<<(i-1));j++) w[i][j]=w[i+1][j<<1]; 
	iv[0]=iv[1]=1; for(int i=2; i<=(1<<K); i++) iv[i]=mul(Mod-Mod/i,iv[Mod%i]);
} 
void init(int deg){
	up=1; bit=0; while(up<deg) up<<=1,++bit; 
	for(int i=0; i<up; i++) rv[i]=(rv[i>>1]>>1)|((i&1)<<(bit-1));
}
poly operator - (poly a, poly b){
	if(a.size()<b.size()) a.resize(b.size());
	for(int i=0; i<(int)b.size(); i++) Dec(a[i],b[i]); return a;
}
poly divx(poly a){
	for(int i=0; i<(int)a.size(); i++) a[i]=a[i+1];
	return a.pop_back(), a;
}
void NTT(poly &a, int typ=1){
	for(int i=0; i<up; i++) if(i<rv[i]) swap(a[i],a[rv[i]]);
	for(int i=1,l=1;i<up;i<<=1,++l)
	for(int j=0; j<up; j+=(i<<1))
	for(int k=0; k<i; k++){
		int x=a[k+j], y=mul(w[l][k],a[k+j+i]);
		a[k+j]=add(x,y); a[k+j+i]=dec(x,y);
	} if(typ==-1){
		reverse(a.begin()+1,a.end());
		for(int i=0,iv=ksm(up,Mod-2); i<up; i++) Mul(a[i],iv);
	}
}
poly operator * (poly a, poly b){
	int dg=a.size()+b.size()-1; 
	if(a.size()<=32||b.size()<=32){
		poly c(dg,0);
		for(int i=0; i<(int)a.size(); i++)
		for(int j=0; j<(int)b.size(); j++)
		Add(c[i+j],mul(a[i],b[j])); return c;
	} init(dg); a.resize(up); b.resize(up); NTT(a); NTT(b);
	for(int i=0; i<up; i++) Mul(a[i],b[i]); 
	NTT(a,-1); a.resize(dg); return a;
}
poly inv(poly a, int deg){
	poly b(1,ksm(a[0],Mod-2)),c;
	for(int lim=2; (lim>>1)<deg; lim<<=1){
		c.resize(lim); init(lim<<1);
		for(int i=0; i<lim; i++) c[i]=i<(int)a.size()?a[i]:0;
		c.resize(up); b.resize(up); NTT(c); NTT(b);
		for(int i=0; i<up; i++) Mul(b[i],dec(2,mul(b[i],c[i])));
		NTT(b,-1); b.resize(lim); 
	} b.resize(deg); return b;
}
poly deriv(poly a){
	for(int i=0; i+1<(int)a.size(); i++) a[i]=mul(i+1,a[i+1]);
	a.pop_back(); return a;
}
poly integ(poly a){
	a.pb(0);
	for(int i=a.size()-1;i;i--) a[i]=mul(iv[i],a[i-1]);
	a[0]=0; return a;
}
poly ln(poly a, int dg){
	if(dg==-1) dg=a.size();
	a=integ(deriv(a)*inv(a,dg)); a.resize(dg); return a;
}
poly Exp(poly a, int dg){
	if(dg==-1) dg = a.size(); poly b(1,1), c;
	for(int lim=2; lim<(dg<<1); lim<<=1){
		c=ln(b,lim); Dec(c[0],1);
		for(int i=0; i<lim; i++) c[i]=dec(i<(int)a.size()?a[i]:0,c[i]);
		b=b*c; b.resize(lim);
	} b.resize(dg); return b;
}
poly polypw(poly a, int k, int dg){ 
	a = ln(a,dg); 
	for(int i=0; i<(int)a.size(); i++) Mul(a[i],k);
	return Exp(a,dg);
}
int main(){
	#ifdef FSYolanda
	freopen("1.in","r",stdin);
	#endif
	scanf("%d",&n); NTT_init(); fc_init(n+5);
	poly phi(2,1); phi = ln(phi,n+3); phi = inv(divx(phi),n+3);
	poly t = poly(1,1) - phi; 
	t = inv(divx(t),n+3); poly tt = t * t; tt.resize(n+3);
	poly mt = polypw(phi,n+1,n+3), dt = deriv(phi);
	t = mt * t; tt = mt * tt; t.resize(n+3); tt.resize(n+3);
	tt = tt * dt; tt.resize(n+3);
	poly em(n+3,0);
	for(int i=0; i<=n+2; i++) em[i]=ifc[i+1];
	em=em*inv(divx(poly(1,1)-em),n+3);
	poly f(n+1,0);
	for(int i=0,iv=ksm(n+1,Mod-2); i<n; i++){
		f[i] = mul(iv,add(mul(t[i+1],n-i+1), tt[i+1]));
		f[i] = dec(em[i+1],f[i]); Mul(f[i],fc[i]);
	} poly g(n,0);
	for(int i=0; i<n; i++) g[i]=(i&1)?dec(0,ifc[i]):ifc[i];
	reverse(g.begin(),g.end()); g = g * f;
	for(int i=0; i<n; i++) cout<<mul(ifc[i],mul(fc[n],g[i+n-1]))<<" ";
	return 0;	
}