# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1221679 | Robert_junior | Addk (eJOI21_addk) | C++20 | 0 ms | 0 KiB |
#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;
void solve(){
int n, k, q;
cin>>n>>k;
int a[n + 1];
for(int i = 1; i <= n; i++){
cin>>a[i];
}
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){
for(int i = l + mid; i <= r - mid; i++){
sum += a[i] * mid;
}
for(int i = l; i < l + mid; i++){
sum += a[i] * (i - l + 1);
}
for(int i = r - mid + 1; i <= r; i++){
sum += a[i] * (r - i + 1);
}
}
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();
}
}