Submission #72693275

---

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;
struct FenwickTree {
    int n;
    vector<long long> tree;
    FenwickTree(int size) : n(size), tree(size + 1, 0) {}
    void update(int idx, long long delta) {
        while (idx <= n) {
            tree[idx] += delta;
            idx += idx & -idx;
        }
    }
    long long query(int idx) {
        long long res = 0;
        while (idx > 0) {
            res += tree[idx];
            idx -= idx & -idx;
        }
        return res;
    }
    long long get_single(int idx) {
        return query(idx) - query(idx - 1);
    }
};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, Q;
    cin >> N >> Q;
    vector<long long> A(N + 1);
    FenwickTree ft(N);
    for (int i = 1; i <= N; ++i) {
        cin >> A[i];
        ft.update(i, A[i]);
    }
    while (Q--) {
        int op;
        cin >> op;
        if (op == 1) {
            int x;
            cin >> x;
            long long val_x = ft.get_single(x);
            long long val_x1 = ft.get_single(x + 1);
            ft.update(x, -val_x + val_x1);
            ft.update(x + 1, -val_x1 + val_x);
        } else if (op == 2) {
            int l, r;
            cin >> l >> r;
            long long sum = ft.query(r) - ft.query(l - 1);
            cout << sum << '\n';
        }
    }
    return 0;
}

Submission Info

Judge Result