Submission #72725753

---

Source Code Expand

#include <iostream>
#define int long long
#define lowbit(x) ((x) & -x)
using namespace std;
int n, q;
int tr[200005];
void add(int p, int val)
{
    for (; p <= n; p += lowbit(p))
        tr[p] += val;
}
int query(int p)
{
    int res = 0;
    for (; p; p -= lowbit(p))
        res += tr[p];
    return res;
}
void solve()
{
    int opt;
    cin >> opt;
    if (opt == 1)
    {
        int x;
        cin >> x;
        int t1 = query(x) - query(x - 1), t2 = query(x + 1) - query(x);
        add(x, t2 - t1);
        add(x + 1, t1 - t2);
    }
    else
    {
        int l, r;
        cin >> l >> r;
        cout << query(r) - query(l - 1) << '\n';
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        add(i, x);
    }
    while (q--)
        solve();
}

Submission Info

Judge Result