This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
vector <ll> arr;
int main() {
ll n, k, q;
cin>>n>>k;
arr.resize(n+1);
for(int i=1;i<=n;i++)
cin>>arr[i];
cin>>q;
for(ll j=0;j<q;j++) {
ll requestType;
cin>>requestType;
if(requestType == 2) {
ll sum = 0, mainsum = 0, l, r, m;
cin>>l>>r>>m;
for(ll i=l;i<l+m;i++)
sum += arr[i];
mainsum += sum;
for(ll i=l+m;i<=r;i++) {
sum += arr[i]-arr[i-m];
mainsum += sum;
}
cout<<mainsum<<'\n';
} else {
// we could use fanwick three
for(int i=0;i<k;i++)
{
ll tmp;
cin>>tmp;
}
continue;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |