C++(clang++11) 解法, 执行用时: 103ms, 内存消耗: 2068K, 提交时间: 2021-05-07 21:15:14

#include<iostream>
#include<cstdio>
using namespace std;
#define int long long
const int N=100005;
const int M=998244353;
int n,a[N],b[N],sa=0,sb=0;
signed main(){
	cin>>n;
	for(int i=0;i<n;++i){cin>>a[i];if(i>1) sa=(sa+a[i])%M;}
	for(int i=0;i<n;++i){cin>>b[i];if(i>1) sb=(sb+b[i])%M;}
	printf("%lld %lld %lld",((sa+a[1])*(sb+b[1]))%M,((sa*b[0]%M)+(sb*a[0]%M)+(a[0]*b[0]%M))%M,(a[0]*b[1]+a[1]*b[0])%M);
	for(int i=3;i<n;++i) cout<<" 0";
return 0;
}

pypy3(pypy3.6.1) 解法, 执行用时: 316ms, 内存消耗: 47320K, 提交时间: 2021-04-09 22:05:34

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [0]*n 
c[0] = sum(a[1:])*sum(b[1:])%998244353
for j in range(2,n):
    c[1] = (c[1] + a[0]*b[j])%998244353
for k in range(2,n):
    c[1] = (c[1] + b[0]*a[k])%998244353
c[1] = (c[1] + a[0]*b[0])%998244353
c[2] = (a[0]*b[1] + a[1]*b[0])%998244353
for i in range(n):
    print(c[i],end=' ')

Python3(3.9) 解法, 执行用时: 112ms, 内存消耗: 18804K, 提交时间: 2021-04-09 20:26:49

n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = [0]*n
c[2] = a[0]*b[1]+a[1]*b[0]
c[1] = a[0]*sum(b)+sum(a)*b[0]-a[0]*b[0]-c[2]
c[0] = sum(a)*sum(b)-c[1]-c[2]
c = [str(x%998244353) for x in c]
print(' '.join(c))