This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
using namespace std;
typedef long long ll;
#define endl '\n'
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll>a(n + 1);
for(int i = 1; i <= n; i++)
cin >> a[i];
vector<ll>pref(n + 1);
for(int i = 1; i <= n; i++)
pref[i] = pref[i - 1] + a[i];
ll q;
cin >> q;
while(q--){
ll type;
cin >> type;
if(type == 1){
ll p;
for(int i = 0; i < k; i++)
cin >> p;
}
else{
ll l, r, m;
cin >> l >> r >> m;
ll cnt = min(m, (r - l + 1) - m + 1);
// cout << cnt << endl;
ll ans = 0;
while(cnt > 0){
ans += pref[r] - pref[l - 1];
l++, r--;
cnt--;
}
cout << ans << endl;
}
}
return 0;
}
/*
3 1
3 4 5
1 2 90
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |