Submission #632467

#TimeUsernameProblemLanguageResultExecution timeMemory
632467pragmatistAddk (eJOI21_addk)C++17
36 / 100
2099 ms1788 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]; ll p[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]; p[i] = p[i - 1] + a[i]; } cin >> q; while(q--) { char tp; cin >> tp; if(tp == '1') { vector<int> v(k); for(auto &x : v) cin >> x; int o = a[v[0]]; for(int i = 0; i < k - 1; ++i) a[v[i]] = a[v[i + 1]]; a[v.back()] = o; for(int i = 1; i <= n; ++i) { p[i] = p[i - 1] + a[i]; } } else { int l, r, m; cin >> l >> r >> m; ll ans = 0; for(int i = l + m - 1; i <= r; ++i) ans += p[i]; for(int i = l - 1; i <= r - m; ++i) ans -= p[i]; cout << ans << nl; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...