Submission #632440

#TimeUsernameProblemLanguageResultExecution timeMemory
632440pragmatistAddk (eJOI21_addk)C++17
36 / 100
2075 ms1396 KiB
#include<bits/stdc++.h>
 
#define ll long long
#define nl "\n"
 
using namespace std;
 
const int N = (int)1e5 + 7;
 
int n, k, q, a[N];
 
int main() {
	ios_base::sync_with_stdio(NULL);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> k;
	for(int i = 1; i <= n; ++i) cin >> a[i];
	cin >> q;
	while(q--) {
		char tp;
		cin >> tp;
		if(tp == '1') {
			vector<int> v(k);
			for(auto &x : v) cin >> x;
			continue;
			int o = a[v[0]];
			for(int i = 0; i < k - 1; ++i) a[v[i]] = a[v[i + 1]];
			a[v.back()] = o;
		} else {
			int l, r, m;
			cin >> l >> r >> m;
			ll sum = 0, ans = 0;
			for(int i = l; i <= l + m - 1; ++i) sum += a[i];
			ans += sum;
			for(int i = l + m; i <= r; ++i) {
				sum += a[i];
				sum -= a[i - m];
				ans += sum;
			}    
			cout << ans << nl;
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...