代码

#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cmath>

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; void read(auto &val) {
		val = 0; do char_read = getchar(); while(!isdigit(char_read));
		do val = val * 10 + char_read - '0'; while(isdigit(char_read = getchar()));
    }
    char obuf[SZ], *p = obuf;
    inline void putchar(char char_write) { *p++ = char_write; }
    void write(auto val) { if(val >= 10) write(val / 10); putchar(val % 10 + '0'); }
    inline void write(auto 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 double PI = acos(-1);

struct CMPLX {
	double a, b; // a + bi
	CMPLX operator + (CMPLX z)  const { return (CMPLX){ a + z.a, b + z.b}; }
	CMPLX operator - (CMPLX z)  const { return (CMPLX){ a - z.a, b - z.b}; }
	CMPLX operator * (CMPLX z)  const { return (CMPLX){ a * z.a - b * z.b, a * z.b + b * z.a}; }
};

CMPLX fft_sup[N];
inline void fft(auto a[], int n, CMPLX w) {
	auto b = fft_sup, j = a, _j = a; int i, k, _k; auto _w = w;
	for(i = 1; i < n; i <<= 1, w = w * w, std :: swap(a, b))
		for(k = 0, j = a, _j = a + (n >> 1), _w = (CMPLX){ 1, 0 }; k != n; k += i, _w = _w * w)
			for(_k = k, k += i; _k != k; ++j, ++_j, ++_k)
//				b[_k] = *j + *_j,
//				b[_k + i] = (*j - *_j) * _w;
				b[_k].a = j->a + _j->a,
				b[_k].b = j->b + _j->b,
				b[_k + i] = (*j - *_j) * _w;
	if(b != fft_sup) std :: copy(a, a + n, b);
}
inline void poly_mul(auto a[], auto b[], int n) {
	fft(a, n, (CMPLX){ cos(PI / n * 2), +sin(PI / n * 2) });
	fft(b, n, (CMPLX){ cos(PI / n * 2), +sin(PI / n * 2) });
	for(int i = 0; i < n; ++i) a[i] = a[i] * b[i];
	fft(a, n, (CMPLX){ cos(PI / n * 2), -sin(PI / n * 2) });
	double inv_n = 1.0 / n; for(int i = 0; i < n; ++i) a[i].a = a[i].a * inv_n;
}

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

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

评测结果