#include<bits/stdc++.h>
using namespace std;
long long prefix[100005];
long long pre[10005];
int main(){
long long n,k;
cin>>n>>k;
long long a[n+1];
for(long long i=1; i<=n; i++){
cin>>a[i];
pre[i]+=pre[i-1]+a[i];
prefix[i]=prefix[i-1]+pre[i];
}
long long q;
cin>>q;
while(q--){
long long x;
cin>>x;
if(x==1){
int y;
cin>>y;
continue;
}
long long l,r,m;
cin>>l>>r>>m;
long long s=0;
s+=prefix[r]-prefix[l+m-2];
s-=prefix[r-m]-prefix[l-2];
cout<<s<<endl;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
300 KB |
Output is correct |
2 |
Correct |
3 ms |
324 KB |
Output is correct |
3 |
Correct |
5 ms |
312 KB |
Output is correct |
4 |
Correct |
7 ms |
436 KB |
Output is correct |
5 |
Correct |
10 ms |
460 KB |
Output is correct |
6 |
Correct |
12 ms |
460 KB |
Output is correct |
7 |
Correct |
15 ms |
560 KB |
Output is correct |
8 |
Correct |
17 ms |
668 KB |
Output is correct |
9 |
Correct |
22 ms |
768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
47 ms |
1408 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
119 ms |
2584 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |