#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n , k;
cin >> n >> k;
vector<int> A(n+5);
for(int i=1 ; i<=n ; i++){
cin >> A[i];
}
int q;
cin >> q;
for(int i=0 ; i<q ; i++){
int t;
cin >> t;
if(t == 2){
int l , r , m;
cin >> l >> r >> m;
long long sum = 0 , sum1 = 0 , sonuncu;
for(int i=l ; i<=(l+m-1) ; i++){
sum += A[i];
}
int ind = l;
sonuncu = A[ind];
sum1 = sum;
for(int i=(l+m) ; i<=r ; i++){
sum1 = sum1 - sonuncu + A[i];
sum += sum1;
sonuncu = A[++ind];
}
cout << sum << '\n';
}
else{
int val;
cin >> val;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
3 ms |
340 KB |
Output is correct |
4 |
Correct |
6 ms |
340 KB |
Output is correct |
5 |
Correct |
10 ms |
340 KB |
Output is correct |
6 |
Correct |
16 ms |
492 KB |
Output is correct |
7 |
Correct |
20 ms |
460 KB |
Output is correct |
8 |
Correct |
27 ms |
468 KB |
Output is correct |
9 |
Correct |
51 ms |
724 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
204 ms |
624 KB |
Output is correct |
2 |
Correct |
439 ms |
1660 KB |
Output is correct |
3 |
Correct |
778 ms |
1960 KB |
Output is correct |
4 |
Execution timed out |
2081 ms |
3076 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
181 ms |
560 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |