传送门
解析:
定义一种多项式操作:系数翻转。
令 F ( x ) F(x) F(x)最高次为 n n n,系数翻转后的多项式 F R ( x ) = x n F ( 1 x ) F_R(x)=x^nF(\frac{1}x) FR(x)=xnF(x1)。
开始推式子:
F
(
x
)
=
Q
(
x
)
G
(
x
)
+
R
(
x
)
F
(
1
x
)
=
Q
(
1
x
)
G
(
1
x
)
+
R
(
1
x
)
x
n
F
(
1
x
)
=
x
n
−
m
Q
(
1
x
)
x
m
G
(
1
x
)
+
x
n
−
m
+
1
x
m
−
1
R
(
1
x
)
F
R
(
x
)
=
Q
R
(
x
)
G
R
(
x
)
+
x
n
−
m
+
1
R
R
(
x
)
F
R
(
x
)
≡
Q
R
(
x
)
G
R
(
x
)
(
m
o
d
x
n
−
m
+
1
)
Q
R
(
x
)
≡
G
R
(
x
)
F
R
−
1
(
x
)
(
m
o
d
x
n
−
m
+
1
)
\begin{aligned} F(x)&=&&Q(x)G(x)+R(x)\\ F(\frac{1}x)&=&&Q(\frac{1}{x})G(\frac{1}{x})+R(\frac{1}x)\\ x^ nF(\frac{1}x)&=&&x^{n-m}Q(\frac{1}x)x^mG(\frac{1}x)+x^{n-m+1}x^{m-1}R(\frac{1}x)\\ F_R(x)&=&&Q_R(x)G_R(x)+x^{n-m+1}R_R(x)\\ F_R(x)&\equiv&&Q_R(x)G_R(x)\pmod {x^{n-m+1}}\\ Q_R(x)&\equiv &&G_R(x)F_R^{-1}(x)\pmod{x^{n-m+1}}\\ \end{aligned}
F(x)F(x1)xnF(x1)FR(x)FR(x)QR(x)====≡≡Q(x)G(x)+R(x)Q(x1)G(x1)+R(x1)xn−mQ(x1)xmG(x1)+xn−m+1xm−1R(x1)QR(x)GR(x)+xn−m+1RR(x)QR(x)GR(x)(modxn−m+1)GR(x)FR−1(x)(modxn−m+1)
于是求出 Q Q Q后用减法就可以得到 R R R了。
代码:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define gc get_char
#define cs const
#define cerr fout
namespace IO{
inline char get_char(){
static cs int Rlen=1<<20|1;
static char buf[Rlen],*p1,*p2;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
inline int getint(){
re char c;
while(!isdigit(c=gc()));re int num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
}
using namespace IO;
cs int mod=998244353;
inline int add(cs int &a,cs int &b){return a+b>=mod?a+b-mod:a+b;}
inline int dec(cs int &a,cs int &b){return a<b?a-b+mod:a-b;}
inline int mul(cs int &a,cs int &b){return (ll)a*b%mod;}
inline int quickpow(int a,int b,int res=1){
while(b){
if(b&1)res=mul(res,a);
a=mul(a,a);
b>>=1;
}
return res;
}
cs int N=1<<20|1;
int r[N];
inline void NTT(int *A,int len,int typ){
for(int re i=0;i<len;++i)if(i<r[i])swap(A[i],A[r[i]]);
for(int re i=1;i<len;i<<=1){
int wn=quickpow(typ==-1?(mod+1)/3:3,(mod-1)/i/2);
for(int re j=0;j<len;j+=i<<1)
for(int re k=0,x,y,w=1;k<i;++k,w=mul(w,wn)){
x=A[j+k],y=mul(w,A[j+k+i]);
A[j+k]=add(x,y);
A[j+k+i]=dec(x,y);
}
}
if(typ==-1)for(int re i=0,inv=quickpow(len,mod-2);i<len;++i)A[i]=mul(A[i],inv);
}
inline void Inv(int deg,int *a,int *b){
static int c[N];
if(deg==1){b[0]=quickpow(a[0],mod-2);return ;}
Inv((deg+1)>>1,a,b);
int re len=1;
while(len<(deg<<1))len<<=1;
for(int re i=0;i<len;++i)r[i]=(r[i>>1]>>1)|((i&1)*(len>>1));
memcpy(c,a,sizeof(int)*deg);
memset(c+deg,0,sizeof(int)*(len-deg));
NTT(c,len,1),NTT(b,len,1);
for(int re i=0;i<len;++i)b[i]=mul(b[i],dec(2,mul(b[i],c[i])));
NTT(b,len,-1);
memset(b+deg,0,sizeof(int)*(len-deg));
}
inline void mul(int *A,int *B,int deg){
static int a[N],b[N];
int re len=1;
while(len<(deg<<1))len<<=1;
for(int re i=0;i<len;++i)r[i]=r[i>>1]>>1|((i&1)*(len>>1));
memcpy(a,A,sizeof(int)*deg),memcpy(b,B,sizeof(int)*deg);
memset(a+deg,0,sizeof(int)*(len-deg)),memset(b+deg,0,sizeof(int)*deg);
NTT(a,len,1),NTT(b,len,1);
for(int re i=0;i<len;++i)a[i]=mul(a[i],b[i]);
NTT(a,len,-1);
memcpy(A,a,sizeof(int)*deg);
}
int n,m,F[N],G[N],Gr[N],R[N],Q[N];
signed main(){
n=getint()+1,m=getint()+1;
for(int re i=0;i<n;++i)Q[n-1-i]=F[i]=getint();
for(int re i=0;i<m;++i)Gr[m-1-i]=G[i]=getint();
Inv(n-m+1,Gr,R);
mul(Q,R,n-m+1);
reverse(Q,Q+n-m+1);
for(int re i=0;i<n-m+1;++i)cout<<Q[i]<<" ";cout<<"\n";
for(int re i=n-m+1;i<=n;++i)Q[i]=0;
mul(Q,G,n<<1);
for(int re i=0;i<m-1;++i)cout<<dec(F[i],Q[i])<<" ";
return 0;
}