#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define ins insert
#define pb push_back
#define F first
#define S second
const int N = 1e6+4, M = 5e5 + 7;
const int mod = 1e9 + 7;
int a[N], pf[N], pf1[N], sf[N];
void solve(){
int n, k, q;
cin>>n>>k;
int a[n + 1];
for(int i = 1; i <= n; i++){
cin>>a[i];
pf[i] = pf[i - 1] + a[i];
pf1[i] = pf1[i - 1] + a[i] * i;
}
for(int i = n; i >= 1; i--){
sf[i] = sf[i + 1] + a[i] * (n - i + 1);
}
cin>>q;
while(q--){
int f;
cin>>f;
if(f == 1){
vector<int>v, v1;
for(int i = 0; i < k; i++){
int x;
cin>>x;
v.pb(x);
v1.pb(a[x]);
}
for(int i = 0; i < k; i++){
a[v[i]] = v1[(i + 1) % k];
}
}
else{
int sum = 0, l, r, m, l1, r1;
cin>>l>>r>>m;
int len = r - l + 1;
int mid = min(m, (r - l + 1) - m + 1);
if(mid * 2 <= len){
sum += (pf[r - mid] - pf[l + mid - 1]) * mid;
sum += (pf1[l + mid - 1] - pf1[l - 1]) - (pf[l + mid - 1] - pf[l - 1]) * (l - 1);
sum += (sf[r - mid + 1] - sf[r + 1]) - (pf[r] - pf[r - mid]) * (n - r);
}
else{
for(int i = l; i <= r; i++){
sum += a[i] * min({i - l + 1, r - i + 1, mid});
}
}
cout<<sum<<'\n';
}
}
}
main(){
ios_base :: sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
//cin>>t;
for(int i = 1; i <= t; i++){
//cout<<"Case "<<i<<": ";
solve();
}
}
Compilation message (stderr)
Main.cpp:59:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
59 | main(){
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |