传送门
直接把答案的
O
G
F
OGF
OGF搞出来然后交换和式变形即可:
F
=
∑
i
≥
0
f
i
x
i
F
=
∑
i
≥
0
x
i
∑
j
=
1
n
a
j
i
F
=
∑
j
=
1
n
∑
i
≥
0
(
a
j
x
)
i
F
=
∑
i
=
1
n
1
1
−
a
i
x
F
=
∑
i
=
1
n
(
1
+
a
i
x
1
−
a
i
x
)
F
=
n
+
x
∑
i
=
1
n
a
i
1
−
a
i
x
F
=
n
−
x
(
∑
i
=
1
n
ln
(
1
−
a
i
x
)
)
′
\begin{aligned}F=&\sum_{i\ge0}f_ix^i\\F=&\sum_{i\ge0}x^i\sum_{j=1}^na_j^i\\F=&\sum_{j=1}^n\sum_{i\ge0}(a_jx)^i\\F=&\sum_{i=1}^n\frac1{1-a_ix}\\F=&\sum_{i=1}^n(1+\frac{a_ix}{1-a_ix})\\F=&n+x\sum_{i=1}^n\frac{a_i}{1-a_ix}\\F=n-x(\sum_{i=1}^n\ln(1-a_ix))'&\end{aligned}
F=F=F=F=F=F=F=n−x(i=1∑nln(1−aix))′i≥0∑fixii≥0∑xij=1∑najij=1∑ni≥0∑(ajx)ii=1∑n1−aix1i=1∑n(1+1−aixaix)n+xi=1∑n1−aixai
然后分治
n
t
t
ntt
ntt+多项式取对+多项式求导即可。
这个地方貌似有一个小的常数优化:既然多项式取对最后要积一次分而取完对又要求一次导干脆我们将这两次操作取消于是我写的多项式取对跟平常的板子不太一样
代码:
#include<bits/stdc++.h>
#define ri register int
using namespace std;
const int rlen=1<<18|1;
inline char gc(){
static char buf[rlen],*ib,*ob;
(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
return ib==ob?-1:*ib++;
}
inline int read(){
int ans=0;
char ch=gc();
while(!isdigit(ch))ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return ans;
}
const int mod=998244353;
typedef long long ll;
typedef vector<int> poly;
inline int add(int a,int b){return (a+=b)<mod?a:a-mod;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)<mod?a:a-=mod;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,Mul(a,a))if(p&1)Mul(ret,a);return ret;}
int w[23],invv[23],lim,tim;
vector<int>rev[23];
inline void init_w(){
w[22]=ksm(3,(mod-1)>>23),invv[0]=1;
for(ri i=21;~i;--i)w[i]=mul(w[i+1],w[i+1]);
for(ri iv=mod+1>>1,i=1;i<23;++i)invv[i]=mul(invv[i-1],iv);
}
inline void init(const int&up){
lim=1,tim=0;
while(lim<up)lim<<=1,++tim;
if(rev[tim].size())return;
rev[tim].resize(lim);
for(ri i=0;i<lim;++i)rev[tim][i]=(rev[tim][i>>1]>>1)|((i&1)<<(tim-1));
}
inline void ntt(poly&a,int type){
for(ri i=0;i<lim;++i)if(i<rev[tim][i])swap(a[i],a[rev[tim][i]]);
for(ri i=1,t=0,a0,a1;i<lim;i<<=1,++t)for(ri j=0,len=i<<1;j<lim;j+=len)
for(ri k=0,mt=1;k<i;++k,Mul(mt,w[t]))a0=a[j+k],a1=mul(a[j+k+i],mt),a[j+k]=add(a0,a1),a[j+k+i]=dec(a0,a1);
if(~type)return;
reverse(++a.begin(),a.end());
for(ri i=0;i<lim;++i)Mul(a[i],invv[tim]);
}
inline poly operator*(poly a,poly b){
int n=a.size(),m=b.size(),t=n+m-1;
if(t<=128){
poly c(t);
for(ri i=0;i<n;++i)for(ri j=0;j<m;++j)Add(c[i+j],mul(a[i],b[j]));
return c;
}
init(t);
a.resize(lim),ntt(a,1);
b.resize(lim),ntt(b,1);
for(ri i=0;i<lim;++i)Mul(a[i],b[i]);
return ntt(a,-1),a.resize(t),a;
}
const int N=4e5+5;
int inv[N<<2],a[N],n;
#define lc (p<<1)
#define rc (p<<1|1)
#define mid (l+r>>1)
inline poly ntt_dc(int l,int r){
if(l==r){poly ret(2,1);ret[1]=mod-a[l];return ret;}
return ntt_dc(l,mid)*ntt_dc(mid+1,r);
}
inline poly poly_inv(poly a,int k){
poly b(1,ksm(a[0],mod-2)),c;
for(ri i=4,up=k<<2;i<up;i<<=1){
c=a,c.resize(i>>1),init(i);
b.resize(lim),ntt(b,1);
c.resize(lim),ntt(c,1);
for(ri j=0;j<lim;++j)Mul(b[j],dec(2,mul(b[j],c[j])));
ntt(b,-1),b.resize(i>>1);
}
return b.resize(k),b;
}
inline poly poly_integ(poly a){
a.push_back(0);
for(ri i=a.size()-1;i;--i)a[i]=mul(a[i-1],inv[i]);
return a[0]=0,a;
}
inline poly poly_deriv(poly a){
for(ri i=0,up=a.size()-1;i<up;++i)a[i]=mul(a[i+1],i+1);
return a.pop_back(),a;
}
inline poly poly_ln(poly a){poly ret=poly_inv(a,a.size()+1)*poly_deriv(a);return ret.resize(a.size()+1),ret;}
#undef lc
#undef rc
#undef mid
int main(){
init_w();
inv[1]=1;
for(ri i=2,up=1500000;i<=up;++i)inv[i]=mul(inv[mod-mod/i*i],mod-mod/i);
for(ri ans=0,tt=read();tt;--tt,ans=0){
n=read();
for(ri i=1;i<=n;++i)a[i]=read()%mod;
poly f=poly_ln(ntt_dc(1,n));
for(ri i=0;i<n;++i)ans^=mod-f[i];
cout<<ans<<'\n';
}
return 0;
}