代码

#include <bits/stdc++.h>
#define maxn 300005
const int mod=998244353;
#define inv2 499122177
#define LL long long
using namespace std;
namespace IO {
	inline char nc(){
		static char buf[500005],*p1=buf,*p2=buf;
		return p1==p2&&(p2=(p1=buf)+fread(buf,1,500000,stdin),p1==p2)?EOF:*p1++;
	}
	char out[500005],*pout=out,*eout=out+500000;
	inline void flush() {return ; fwrite(out,1,pout-out,stdout),pout=out; }
	inline void pc(char c) { pout==eout&&(fwrite(out,1,500000,stdout),pout=out); (*pout++)=c; }
	template<typename T> inline void put(T x,char suf) {
		printf("%d",x);putchar(suf);
	}
	template<typename T> inline T read(){
		T sum=0;scanf("%d",&sum);return sum;
	}
}
#define Rint IO::read<int>()
#define Rll IO::read<long long>()
using IO::put;
int add(int x,int y) { x+=y; (x>=mod)&&(x-=mod); return x; }
int mul(int x,int y) { return 1ll*x*y%mod; }
namespace Math {
	LL w;
	struct number{ LL a,b; };
	number operator * (const number &x,const number &y){ return (number){(x.a*y.a%mod+w*x.b%mod*y.b%mod)%mod,(x.a*y.b%mod+y.a*x.b%mod)%mod}; }
	inline LL power(number base,LL x){
		number res=(number){1,0};
		for(;x;base=base*base,x>>=1) if(x&1) res=res*base;
		return res.a;
	}
	inline bool check(LL x){return power((number){x,0},(mod-1)>>1)==1;}
	inline int work(LL n){
		srand((unsigned)time(NULL));
		if(n==0) return 0; LL a=rand()%mod;
		while(!a||check((a*a+mod-n)%mod)) a=rand()%mod;
		w=(a*a+mod-n)%mod; return power((number){a,1},(mod+1)>>1);
	}
}

namespace Math{
	const LL M=((1ll<<61)-1)/mod+1;
	inline LL Mod(LL t){
		return t-=((t>>29)*M>>32)*mod;
	}}
using Math::Mod;
int Wl,Wl2,w[maxn],lg[maxn],inv[maxn];
inline int Pow(int b, int k) { int r=1; for(;k;k>>=1,b=1ll*b*b%mod) if(k&1) r=1ll*r*b%mod; return r; }
inline void init(int n) {
	for(Wl=1;n>=Wl<<1;Wl<<=1) ;
	int pw=Pow(3,(mod-1)/(Wl2=Wl<<1));
	w[Wl]=inv[0]=inv[1]=1;
	for(int i=Wl+1;i<=Wl2;i++) w[i]=w[i-1]*1ll*pw%mod;
	for(int i=Wl-1;i>=1;i--) w[i]=w[i<<1];
	for(int i=2;i<=Wl2;i++) inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod,lg[i]=lg[i>>1]+1;
}
inline int upd(int x) { return x+=x>>31&mod; }
inline void NTT(int *A, int n, int tp) {
	static int r[maxn]={};
	static unsigned LL ar[maxn]={};
	if(tp^1) reverse(A+1,A+n);
	for(int i=0;i<n;i++) r[i]=(r[i>>1]>>1|(i&1)<<lg[n]-1),ar[i]=upd(A[r[i]]);
	for(int L=1;L<n;L<<=1) for(int s=0,L2=L<<1;s<n;s+=L2)
	for(int k=s,x=L,t;x<L2;x++,k++) t=ar[k+L]*w[x]%mod,ar[k+L]=ar[k]+mod-t,ar[k]+=t;
	if(tp^1) for(int i=0;i<n;i++) ar[i]=ar[i]*inv[n]%mod;
	for(int i=0;i<n;i++) A[i]=Mod(ar[i]);
}
#define Poly vector<int>
#define Rev(A) reverse(A.begin(),A.end())
inline Poly Add(Poly A,Poly B) {
	if(A.size()<B.size()) A.resize(B.size()); else if(A.size()>B.size()) B.resize(A.size());
	Poly C; C.resize(A.size()); for(int i=0;i<(int)A.size();i++) C[i]=add(A[i],B[i]); return C;
}inline Poly Sub(Poly A,Poly B) { for(int i=0;i<(int)B.size();i++) B[i]=(B[i]==0)?0:(mod-B[i]); return Add(A,B); }
inline Poly Der(Poly A) { int n=A.size(); for(int i=1;i<n;i++) A[i-1]=1ll*i*A[i]%mod; A[n-1]=0; return A; }
inline Poly Int(Poly A) { int n=A.size(); for(int i=n-1;i>0;i--) A[i]=1ll*A[i-1]*inv[i]%mod; A[0]=0; return A; }
inline Poly Mul(Poly A,Poly B,int l=-1) {
	int n=A.size(),m=B.size(),N=(l==-1)?(n+m-1):l,M=1<<lg[N]+1;
	A.resize(M<<2); B.resize(M<<2);
	NTT(A.data(),M,1); NTT(B.data(),M,1);
	for(int i=0;i<M;i++) A[i]=1ll*A[i]*B[i]%mod;
	NTT(A.data(),M,-1); A.resize(N); return A;
}
inline Poly Inv(Poly A) {
	static int t[maxn]; int n=A.size();
	A.resize(n<<1); Poly B; B.resize(n<<2);
	B[B[1]=0]=Pow(A[0],mod-2);
	for (int k=2,L=4;k<(n<<1);k<<=1,L<<=1) {
		for(int i=0;i<L;i++) t[i]=i<k?A[i]:B[i]=0;
		NTT(t,L,1),NTT(B.data(),L,1);
		for(int i=0;i<L;i++) B[i]=B[i]*(2-1ll*t[i]*B[i]%mod)%mod;
		NTT(B.data(),L,-1); for(int i=min(n,k);i<L;i++) B[i]=0;
	} B.resize(n); return B;
}
inline Poly Ln(Poly A) {
	static int t[maxn]; int n=A.size(); Poly B=Inv(A);
	int L=1<<lg[2*n-2]+1; B.resize(n<<2);
	for(int i=0;i<L;i++) t[i]=i<n-1?A[i+1]*(i+1ll)%mod:B[i]=0;
	NTT(t,L,1),NTT(B.data(),L,1);
	for(int i=0;i<L;i++) t[i]=1ll*t[i]*B[i]%mod;
	NTT(t,L,-1); B[0]=0;
	for(int i=0;i<L;i++) B[i]=i<n?1ll*t[i-1]*inv[i]%mod:0;
	B.resize(n); return B;
}
inline Poly Exp(Poly A) {
	int n=A.size();
	Poly B,C; B.resize(2); B[B[1]=0]=1;
	for(int k=2,L=4;k<(n<<1);k<<=1,L<<=1) {
		C=Ln(B); B.resize(L); C.resize(L);
		for(int i=0;i<L;i++) C[i]=i<k?((i==0)+A[i]-C[i])%mod:B[i]=0;
		NTT(C.data(),L,1), NTT(B.data(),L,1);
		for(int i=0;i<L;i++) B[i]=1ll*B[i]*C[i]%mod;
		NTT(B.data(),L,-1); for(int i=min(n,k);i<L;i++) B[i]=0;
	} B.resize(n); return B;
}
inline Poly Sqrt(Poly A) {
	int n=A.size();A.resize(n<<2);
	Poly B,C;B.push_back(Math::work(A[0]));
	for(int l=2;l<(n<<1);l<<=1) {
		B.resize(l); C.resize(l); for(int i=0;i<l;i++) C[i]=A[i];
		B=Add(B,Mul(C,Inv(B),l)); for(int i=0;i<l;i++) B[i]=1ll*B[i]*inv2%mod;
	} B.resize(n); if((B[0]<<1)>mod) for(int i=0;i<n;i++) B[i]=(B[i]==0)?0:(mod-B[i]);
	return B;
}
inline Poly _pow(Poly A,int k) {
	int x=A[0],n=A.size(); for(int i=0,iv=Pow(x,mod-2);i<n;i++) A[i]=1ll*A[i]*iv%mod;
	A=Ln(A); for(int i=0;i<n;i++) A[i]=1ll*A[i]*k%mod;
	A=Exp(A); for(int i=0,iv=Pow(x,k);i<n;i++)A[i]=1ll*A[i]*iv%mod;
	return A;
}
inline int Init(int n) { int m; for(m=1;m<=n;m<<=1); init(m); return m; }
int n,m; Poly A,B;
int main(){
	n=Rint+1; m=Rint+1; A.resize(n);B.resize(m); for(int i=0;i<n;i++) A[i]=Rint;for(int i=0;i<m;i++) B[i]=Rint;
	Init(n+m); A=Mul(A,B);
	for(int i=0;i<n+m-1;i++) put(A[i],' '); IO::flush();
}

评测结果