Submission #1172743

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172743		dbekarys	Addk (eJOI21_addk)	C++20	0 / 100	2095 ms	1876 KiB

Main

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e5 + 7;
int a[N], t[N * 4];

void build(int x, int l, int r) {
    if (l == r) {
        t[x] = a[l];
        return;
    }
    int m = (l + r) / 2;
    build(x + x, l, m);
    build(x + x + 1, m + 1, r);
    t[x] = t[x + x] + t[x + x + 1];
}

int get(int x, int l, int r, int ll, int rr) {
    if (l > rr || r < ll) return 0;
    if (ll <= l && r <= rr) return t[x];
    int m = (l + r) / 2;
    return get(x + x, l, m, ll, rr) + get(x + x + 1, m + 1, r, ll, rr);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    build(1, 1, n);
    
    int q;
    cin >> q;
    while (q--) {
        int t;
        cin >> t;
        if (t == 2) {
            int l, r, m;
            cin >> l >> r >> m;
            int sum = 0;
            for (int j = l; j <= r - m + 1; j++) {
                sum += get(1, 1, n, j, j + m - 1);
            }
            cout << sum << endl;
        } else {
            int val;
            cin >> val;
            // Placeholder for additional functionality if needed.
        }
    }
}

• Subtask 1: 0 / 36
• Subtask 2: 0 / 56
• Subtask 3: 0 / 8