哪位oier看看为什么re。题目链接http://www.kidsccshow.com/problem.php?id=1722
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef int ll;
const long long maxn=10003;
int main(){
ll t;
cin >> t;
for(ll z = 0;z < t;z++){
ll n, m, a[maxn], b[maxn], op[maxn], l[maxn], r[maxn];
cin >> n;
for(ll i = 1;i <= n;i++) cin >> a[i];
for(ll i = 1;i <= n;i++) cin >> b[i];
cin >> m;
for(ll i = 0;i < m;i++){
cin >> op[i] >> l[i] >> r[i];
}
for(ll i = 0;i < m;i++){
if(op[i] == 1){
for(ll j = l[i];j <= r[i];j++){
a[j] += b[j];
}
}
else if(op[i] == 2){
for(ll j = l[i];j <= r[i];j++){
b[j] += a[j];
}
}
else{
int sum = 0, out;
for(ll j = l[i];j <= r[i];j++){
sum += a[j]*b[j];
}
sum = sum % maxn;
cout << sum << endl;
}
}
}
return 0;
}