#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n,k;
cin >> n >> k;
vector <long long> v(n+1);
vector <long long> pre(n+1);
pre[0] = 0;
for(int i = 1;i <= n;i++){
cin >> v[i];
pre[i] = pre[i-1] + v[i];
}
int q;
cin >> q;
for(int i = 0;i < q;i++){
int qu,l,r,m;
cin >> qu;
if(qu == 2){
cin >> l >> r >> m;
int rr = r;
int ll = l-1;
long long sum = 0;
for(int j = 0; j < min(m,(r-l)+2-m);j++){
sum += pre[rr] - pre[ll];
ll++;
rr--;
}
cout << sum << "\n";
}else{
int x;
cin >> x;
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
348 KB |
Output is correct |
5 |
Correct |
3 ms |
348 KB |
Output is correct |
6 |
Correct |
5 ms |
600 KB |
Output is correct |
7 |
Correct |
6 ms |
604 KB |
Output is correct |
8 |
Correct |
9 ms |
604 KB |
Output is correct |
9 |
Correct |
15 ms |
604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
52 ms |
852 KB |
Output is correct |
2 |
Correct |
111 ms |
1364 KB |
Output is correct |
3 |
Correct |
196 ms |
1476 KB |
Output is correct |
4 |
Correct |
635 ms |
2664 KB |
Output is correct |
5 |
Correct |
1008 ms |
4080 KB |
Output is correct |
6 |
Correct |
908 ms |
5664 KB |
Output is correct |
7 |
Correct |
779 ms |
5636 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
30 ms |
1116 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |