Submission #516283

#TimeUsernameProblemLanguageResultExecution timeMemory
516283MinhQNgoAddk (eJOI21_addk)C++17
36 / 100
2076 ms3960 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

long long ps[N];
int a[N];

int main() {
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        ps[i] = a[i] + ps[i - 1];
    }
    int q;
    cin >> q;
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int ind;
            for (int i = 1; i <= k; i++) cin >> ind;
        }
        else {
            int l, r, m;
            cin >> l >> r >> m;
            long long ans = 0;
            for (int i = l; i <= r - m + 1; i++) {
                ans += ps[i + m - 1] - ps[i - 1];
            }
            cout << ans << '\n';
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...