【BZOJ3684】大朋友和多叉树（拉格朗日反演）

传送门

---

题解：

很显然地，我们考虑生成函数，由于必须儿子不能为空，所以显然$0$个点的方案数我们需要设置为$0$。设$F(x)$为合法的树的生成函数，则有：

$$F(x)=x+\sum _{i\in D}{F}^i(x)$$

设$G(x)=1-{\sum }_{i\in D}{x}^i$，则显然$G(F(x))=x$，即$G,F$互为复合逆。

发现我们并不需要求整个$F$，只需要求第$S$项的系数，考虑拉格朗日反演：

$$[x^s]F(x)=\frac{1}{s}[x^{-1}](\frac{1}{G(x)}{)}^s=\frac{1}{s}[x^{s-1}](\frac{x}{G(x)}{)}^s$$

多项式快速幂即可。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

using std::cerr;
using std::cout;

cs int mod=950009857;

inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){static ll r;r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
	for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
	return res;
}
inline void Inc(int &a,int b){(a+=b)>=mod&&(a-=mod);}
inline void Dec(int &a,int b){(a-=b)<0&&(a+=mod);}
inline void Mul(int &a,int b){a=mul(a,b);}


typedef std::vector<int> Poly;

cs int bit=21,SIZE=1<<20|1;

int r[SIZE],*w[bit+1];
int fac[SIZE],ifac[SIZE],inv[SIZE];
inline void init_NTT(){
	for(int re i=1;i<=bit;++i)w[i]=new int[1<<i-1];
	int wn=power(7,mod-1>>bit);w[bit][0]=1;
	for(int re i=1;i<(1<<bit-1);++i)w[bit][i]=mul(w[bit][i-1],wn);
	for(int re i=bit-1;i;--i)
	for(int re j=0;j<(1<<i-1);++j)w[i][j]=w[i+1][j<<1];
	inv[1]=fac[0]=fac[1]=ifac[0]=ifac[1]=1;
	for(int re i=2;i<SIZE;++i){
		fac[i]=mul(fac[i-1],i);
		inv[i]=mul(inv[mod%i],mod-mod/i);
		ifac[i]=mul(ifac[i-1],inv[i]);
	}
}

inline void NTT(Poly &A,int len,int typ){
	for(int re i=0;i<len;++i)if(i<r[i])std::swap(A[i],A[r[i]]);
	for(int re i=1,d=1;i<len;i<<=1,++d)
	for(int re j=0;j<len;j+=i<<1)
	for(int re k=0;k<i;++k){
		int &t1=A[j+k],&t2=A[j+k+i],t=mul(t2,w[d][k]);
		t2=dec(t1,t),Inc(t1,t);
	}
	if(typ==-1){
		std::reverse(A.begin()+1,A.begin()+len);
		for(int re i=0,inv=power(len,mod-2);i<len;++i)Mul(A[i],inv);
	}
}
inline void init_rev(int l){
	for(int re i=0;i<l;++i)r[i]=r[i>>1]>>1|((i&1)?l>>1:0);
}

inline Poly operator*(Poly a,Poly b){
	int deg=a.size()+b.size()-1,l=1;
	while(l<deg)l<<=1;init_rev(l);
	a.resize(l),NTT(a,l,1);
	b.resize(l),NTT(b,l,1);
	for(int re i=0;i<l;++i)Mul(a[i],b[i]);
	NTT(a,l,-1),a.resize(deg);
	return a;
}

inline Poly Inv(cs Poly &a,int lim){
	int n=a.size();Poly c,b(1,power(a[0],mod-2));
	for(int re l=4;(l>>2)<lim;l<<=1){
		init_rev(l);
		c.resize(l>>1);for(int re i=0;i<(l>>1);++i)c[i]=i<n?a[i]:0;
		c.resize(l),NTT(c,l,1);
		b.resize(l),NTT(b,l,1);
		for(int re i=0;i<l;++i)Mul(b[i],dec(2,mul(b[i],c[i])));
		NTT(b,l,-1),b.resize(l>>1);
	}b.resize(lim);
	return b;
}
inline Poly Inv(cs Poly &a){return Inv(a,a.size());}

inline Poly Deriv(Poly a){
	for(int re i=0;i+1<a.size();++i)a[i]=mul(a[i+1],i+1);
	a.pop_back();return a;
}

inline Poly Integ(Poly a){a.push_back(0);
	for(int re i=a.size()-1;i;--i)a[i]=mul(a[i-1],inv[i]);
	a[0]=0;return a;
}

inline Poly Ln(Poly a,int lim){
	a=Integ(Deriv(a)*Inv(a,lim));
	a.resize(lim);
	return a;
}
inline Poly Ln(cs Poly &a){return Ln(a,a.size());}

inline Poly Exp(cs Poly &a,int lim){
	int n=a.size();Poly c,b(1,1);
	for(int re l=2;(l>>1)<lim;l<<=1){
		c=Ln(b,l);
		for(int re i=0;i<l;++i)c[i]=dec(i<n?a[i]:0,c[i]);
		Inc(c[0],1);
		b=b*c;b.resize(l);
	}b.resize(lim);
	return b;
}
inline Poly Exp(cs Poly &a){return Exp(a,a.size());}

inline Poly Ksm(Poly a,int k){
	a=Ln(a);
	for(int re i=0;i<a.size();++i)Mul(a[i],k);
	a=Exp(a);
	return a;
}

Poly G;

signed main(){
#ifdef zxyoi
	freopen("BigBrother.in","r",stdin);
#endif
	init_NTT();
	int s,m;scanf("%d%d",&s,&m);
	G.resize(s+1);G[0]=1;
	for(int i=1,d;i<=m;++i)scanf("%d",&d),G[d-1]=mod-1;
	G=Ksm(Inv(G),s);
	cout<<mul(G[s-1],power(s,mod-2))<<"\n";
	return 0;
}