#include <bits/stdc++.h>
#define int long long
#define pll pair<int,int>
#define endl "\n"
using namespace std;
const int MOD2=998244353;
const int MOD1=1e9+7;
const int N=2e5+7;
const long long inf=1e18;
vector<int>g[N];
signed main()
{
ios_base::sync_with_stdio(0),
cin.tie(0);
int n,k;
cin>> n>>k;
int a[n];
for(int i=0;i<n;i++){
cin>> a[i];
}
int q;
cin>> q;
while(q--){
int t;
cin>> t;
if(t==2){
int l,r,m;
cin>> l>>r>>m;
l--,r--;
int sz=r-l+1;
if(sz/2<m) m=sz%m+1;
int ki=0,ans=0;
for(int i=l;i<l+sz/2+sz%2;i++){
if(ki<m) ki++;
ans+=(a[i]+a[n-i-1])*ki;
}
cout<< ans<<endl;
}
else {
int p[k];
for(int i=0;i<k;i++){
cin>> p[i];
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |