Submission #483531

#TimeUsernameProblemLanguageResultExecution timeMemory
483531otogagnidzeAddk (eJOI21_addk)C++14
92 / 100
234 ms6612 KiB
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, k;
    cin >> n >> k;
    long long a[n + 1], b[n + 1], b2[n + 1];
    b[0] = 0; b2[0] = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        b[i] = b[i - 1] + a[i];
        b2[i] = b2[i - 1] + b[i];
    }
    int q;
    cin >> q;
    while(q--){
        int h, l, r, m;
        cin >> h;
        if(h == 2){
            cin >> l >> r >> m;
            long long ans = b2[r] - b2[r - m] - b2[l + m - 2];
            if(l - 2 > 0)
                ans += b2[l - 2];
            cout << ans << endl;
        }
        else{
            int d;
            for(int i = 1; i <= k; i++)
                cin >> d;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...