This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FORI(i, n) for(int i = 0; i < n; i++)
#define FOR(i, n) for(int i = 1; i <= n; i++)
typedef vector < ll > vl;
typedef set < ll > setl;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define pll pair < ll , ll >
#define db double
#define nll cout << "\n"
#define nl "\n"
#define sync \
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) ;
// #define int ll
const ll INF = 1e9;
const int MAX = 1e5 + 5;
ll n, m, k;
ll t[4 * MAX], a[MAX], b[11], pref[MAX];
void solve(){
cin >> n >> k;
FOR(i, n){
cin >> a[i];
}
ll q, c;
cin >> q;
ll l, r, x;
FOR(i, n)pref[i] = pref[i - 1] + a[i];
while(q--){
cin >> c;
if(c == 2){
cin >> l >> r >> x;
ll res = 0;
for(ll i = l; i <= r; i++){
if(i <= r- x + 1)
res += max(0LL, pref[i + x - 1] - pref[i - 1]);
}
cout << res << nl;
}
else{
FOR(i, k){
cin >> b[i];
}
x = a[b[1]];
for(ll i = 1; i <= k - 1; i++)a[b[i]] = a[b[i + 1]];
a[b[k]] = x;
}
}
}
signed main(){
sync;
ll t = 1;
// cin >> t;
while(t--){
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |