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 <bits/stdc++.h>
using namespace std;
void solve() {
int n,m;
cin >> n >> m;
int dp[n+1], arr[n];
dp[0]=0;
for(int i=0; i<n; i++) {
cin >> arr[i];
dp[i+1]=dp[i]+arr[i];
}
int q;
cin >> q;
while(q--) {
int tmp,l,r,m;
cin >> tmp;
if(tmp==1) {
int x; cin >> x;
continue;
}
cin >> l >> r >> m;
long long ans=0;
for(int i=0; i<m; i++) {
ans+=dp[r-i]-dp[l+i-1];
}
cout << ans << endl;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
while(t--)
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |