제출 #632468

#제출 시각아이디문제언어결과실행 시간메모리
632468pragmatistAddk (eJOI21_addk)C++17
92 / 100
53 ms6076 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], z[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]; z[i] = z[i - 1] + p[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; } else { int l, r, m; cin >> l >> r >> m; ll ans = z[r] - z[l + m - 2]; ans -= (z[r - m] - (l - 2 < 0 ? 0 : z[l - 2])); cout << ans << nl; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...