代码

#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cstring>

namespace fastIO {
    const int SZ = 1 << 25;
    char ibuf[SZ], *p0 = ibuf, *p1 = ibuf;
    inline char getchar(void) { return p0 == p1 && (p1 = (p0 = ibuf) + fread(ibuf, 1, SZ, stdin), p0 == p1) ? EOF : *p0++; }
    char char_read; template<typename tpnm> void read(tpnm &val) {
		val = 0; do char_read = getchar(); while(!isdigit(char_read));
		do val = val * 10 + char_read - '0'; while(isdigit(char_read = getchar())); return;
    }
    char obuf[SZ], *p = obuf;
    inline void putchar(char char_write) { *p++ = char_write; return; }
    template<typename tpnm> void write(tpnm val) { if(val >= 10) write(val / 10); putchar(val % 10 + '0'); return; }
    template<typename tpnm> inline void write(tpnm a[], int sz) { for(int i = 0; i < sz; ++i) write(a[i]), putchar(' '); putchar('\n'); }
    void output(void) { fwrite(obuf, p - obuf, 1, stdout);}
};

const int N = 1 << 21;
const int p = 998244353;
const int g = 698244353;
const int h = 596890285;

inline int pow_modp(int a, int b) { int x = 1; for(; b; a = (long long)a * a % p, b >>= 1) if(b & 1) x = (long long)x * a % p; return x; }

int ntt_sup[N];
inline void  ntt(auto a[], int n) {
	auto b = ntt_sup; int _n = n >> 1;
	for(int i = 1, w = pow_modp(g, (p - 1) / n); i < n; i <<= 1, w = (long long)w * w % p, std :: swap(a, b))
		for(int j = 0, *k = a, *_k = a + _n, _w = 1; j != n; j += i << 1, _w = (long long)_w * w % p)
			for(int _j = j; _j != j + i; ++_j, ++k, ++_k)
				b[_j] = *k + *_k < 0 ? *k + *_k + p : *k + *_k - p, b[_j + i] = (long long)(*k - *_k) * _w % p;
	if(b != ntt_sup) std :: copy(a, a + n, b);
}
inline void intt(auto a[], int n) {
	auto b = ntt_sup; int _n = n >> 1;
	for(int i = 1, w = pow_modp(h, (p - 1) / n); i < n; i <<= 1, w = (long long)w * w % p, std :: swap(a, b))
		for(int j = 0, *k = a, *_k = a + _n, _w = 1; j != n; j += i << 1, _w = (long long)_w * w % p)
			for(int _j = j; _j != j + i; ++_j, ++k, ++_k)
				b[_j] = *k + *_k < 0 ? *k + *_k + p : *k + *_k - p, b[_j + i] = (long long)(*k - *_k) * _w % p;
	if(b != ntt_sup) std :: copy(a, a + n, b);
}
inline void poly_mul(auto a[], auto b[], int n) {
	ntt(a, n), ntt(b, n); for(int i = 0; i < n; ++i) a[i] = (long long)a[i] * b[i] % p; intt(a, n);
	int inv_n = pow_modp(n, p - 2); for(int i = 0; i < n; ++i) a[i] = (long long)a[i] * inv_n % p;
}

int n, n_a, n_b;
int a[N], b[N];

int main(void) {
	fastIO :: read(n_a), fastIO :: read(n_b); for(n = 1; n <= n_a + n_b; n <<= 1);
	for(int i = 0; i <= n_a; ++i) fastIO :: read(a[i]);
	for(int i = 0; i <= n_b; ++i) fastIO :: read(b[i]);
	poly_mul(a, b, n);
	for(int i = 0; i <= n_a + n_b; ++i) a[i] = a[i] < 0 ? a[i] + p : a[i];
	fastIO :: write(a, n_a + n_b + 1), fastIO :: output();
	return 0;
}

评测结果