[BZOJ4228][生成函数][NTT]Tibbar的后花园

BZOJ4228

考虑合法的连通块，一个点的出度必须小于等于2，否则以这个点为中心，会出现一个到中心距离相等的四个点组成的图
所以一个连通块必须是链或者长度不为3的倍数的环
本题是有标号计数，考虑EGF：
$$line=\sum _{i\ge 2}\frac{x^i}{2}$$
$$circle=\sum _{i\ge 4\&\&i\%3!=0}\frac{x^i}{2i}$$
然后要求的是两个有标号对象的拼接，按照套路：
$$e^{line+circle}$$
那么写个多项式exp就完了
注意$line[1]=1$

Code：

#include<bits/stdc++.h>
#define poly vector<int>
#define ll long long
#define mod 1004535809
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
inline int add(int x,int y){x+=y;if(x>=mod) x-=mod;return x;}
inline int dec(int x,int y){x-=y;if(x<0) x+=mod;return x;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
inline void Mul(int &x,int y){x=1ll*x*y%mod;}
inline void inc(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline int ksm(int a,int b){int res=1;for(;b;b>>=1,Mul(a,a)) if(b&1) Mul(res,a);return res;}
namespace Ntt{
	const int N=1e6+5;
	int *w[22],rev[N<<2];
	inline void init(int n){for(int i=0;i<n;i++) rev[i]=(rev[i>>1]>>1)|((i&1)*(n>>1));}
	inline void init_w(){
		for(int i=1;i<=21;i++) w[i]=new int[1<<(i-1)];
		int wn=ksm(3,(mod-1)/(1<<21));
		w[21][0]=1;
		for(int i=1;i<(1<<(20));i++) w[21][i]=mul(w[21][i-1],wn);
		for(int i=20;i;i--)
			for(int j=0;j<(1<<(i-1));j++) w[i][j]=w[i+1][j<<1];
	}
	inline void ntt(poly &f,int n,int kd){
		for(int i=0;i<n;i++) if(i>rev[i]) swap(f[i],f[rev[i]]);
		for(int mid=1,l=1;mid<n;mid<<=1,l++){
			for(int i=0;i<n;i+=(mid<<1)){
				for(int j=0,a0,a1;j<mid;j++){
					a0=f[i+j],a1=mul(f[i+j+mid],w[l][j]);
					f[i+j]=add(a0,a1);f[i+j+mid]=dec(a0,a1);
				}
			}
		}
		if(kd==-1 && (reverse(f.begin()+1,f.begin()+n),1))
			for(int inv=ksm(n,mod-2),i=0;i<n;i++) Mul(f[i],inv);
	}	
	inline poly operator -(poly a,poly b){
		poly c;int lim=max(a.size(),b.size());c.resize(lim);
		for(int i=0;i<lim;i++)c[i]=dec(a[i],b[i]);return c;
	}
	inline poly operator +(poly a,poly b){
		poly c;int lim=max(a.size(),b.size());c.resize(lim);
		for(int i=0;i<lim;i++) c[i]=add(a[i],i%3?b[i]:0);return c;
	}
	inline poly operator *(poly a,poly b){
		int m=a.size()+b.size()-1,n=1;
		if(m<=128){
			poly c(m,0);
			for(int i=0;i<a.size();i++)
				for(int j=0;j<b.size();j++) inc(c[i+j],mul(a[i],b[j]));
			return c;	
		}
		while(n<m) n<<=1;
		init(n);
		a.resize(n);ntt(a,n,1);
		b.resize(n);ntt(b,n,1);
		for(int i=0;i<n;i++) Mul(a[i],b[i]);
		ntt(a,n,-1);a.resize(m);
		return a;
	}
}
using namespace Ntt;
inline poly Inv(poly a,int n){
	poly c,b(1,ksm(a[0],mod-2));
	for(int lim=4;lim<(n<<2);lim<<=1){
		init(lim);
		c=a;c.resize(lim>>1);
		c.resize(lim);ntt(c,lim,1);
		b.resize(lim);ntt(b,lim,1);
		for(int i=0;i<lim;i++) Mul(b[i],dec(2,mul(b[i],c[i])));
		ntt(b,lim,-1);b.resize(lim>>1);
	}
	b.resize(n);return b;
}

inline poly deriv(poly a){
	for(int i=0;i<a.size()-1;i++) a[i]=mul(a[i+1],i+1);
	a.pop_back();return a;
}

ll inv[N<<1];
inline poly integ(poly a){
	a.push_back(0);
	for(int 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 n){
	a=integ(deriv(a)*Inv(a,n)),a.resize(n);
	return a;
}

inline poly exp(poly a,int n){
	poly b(1,1),c;a.resize(n<<1);
	for(int lim=2;lim<(n<<1);lim<<=1){
		c=ln(b,lim);
		for(int i=0;i<lim;i++) c[i]=dec(a[i],c[i]);
		inc(c[0],1);b=b*c;
		b.resize(lim);
	}
	b.resize(n);return b;
}
ll fac[N<<1];
poly a,b,ans;
int main(){
	inv[1]=1;
	for(int i=2;i<(N<<1);i++) inv[i]=((mod-mod/i)*inv[mod%i])%mod;
	init_w();int n=read();a.resize(n+1);b.resize(n+1);
	a[1]=1;
	for(int i=2;i<=n;i++) a[i]=inv[2];
	for(int i=4;i<=n;i++) b[i]=inv[2*i];
	a=a+b;
	ans=exp(a,n+1);
	fac[1]=1;
	for(int i=2;i<=n;i++) fac[i]=mul(fac[i-1],i);
	cout<<mul(fac[n],ans[n]);
	return 0;
}