// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int n, k;cin>>n>>k;
vector<int> a(n);
vector<int> prefixofa(n+1);
vector<int> prefixofprefix(n+2);
for(int i=0;i<n;i++){
cin>>a[i];
prefixofa[i+1]=prefixofa[i]+a[i];
//cout<<prefixofa[i+1]<<' ';
}
//cout<<endl;
for(int i=2;i<n+2;i++){
prefixofprefix[i]=prefixofprefix[i-1]+prefixofa[i-1];
// cout<<prefixofprefix[i]<<' ';
}
//cout<<endl;
int q;cin>>q;
while(q--){
int x;cin>>x;
if(x==1){
int h;cin>>h;
}else{
int l, r, m;cin>>l>>r>>m;
//cout<<prefixofprefix[r+1]<<" "<<prefixofprefix[l+m-1]<<" " <<prefixofprefix[r-m+1] << " " <<prefixofprefix[l-1]<<'\n';
cout<<prefixofprefix[r+1]-prefixofprefix[l+m-1]-prefixofprefix[r-m+1]+prefixofprefix[l-1]<<'\n';
}
}
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 36/36 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Accepted | 4ms | 316 KiB | ||||
| 3 | Accepted | 6ms | 316 KiB | ||||
| 4 | Accepted | 8ms | 316 KiB | ||||
| 5 | Accepted | 12ms | 548 KiB | ||||
| 6 | Accepted | 14ms | 544 KiB | ||||
| 7 | Accepted | 17ms | 564 KiB | ||||
| 8 | Accepted | 19ms | 636 KiB | ||||
| 9 | Accepted | 27ms | 704 KiB | ||||
| subtask2 | 56/56 | ||||||
| 1 | Accepted | 59ms | 1088 KiB | ||||
| 2 | Accepted | 90ms | 1396 KiB | ||||
| 3 | Accepted | 115ms | 1888 KiB | ||||
| 4 | Accepted | 202ms | 3124 KiB | ||||
| 5 | Accepted | 296ms | 4148 KiB | ||||
| 6 | Accepted | 275ms | 4048 KiB | ||||
| 7 | Accepted | 272ms | 3904 KiB | ||||
| subtask3 | 0/8 | ||||||
| 1 | Runtime error | 18ms | 1588 KiB | ||||
| 2 | Runtime error | 30ms | 2300 KiB | ||||
| 3 | Runtime error | 37ms | 2612 KiB | ||||
| 4 | Runtime error | 37ms | 2612 KiB | ||||