Submission #72714717

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define N (int)2e5 + 10

int tree[N];
inline int lowbit(int x)
{
    return x & (-x);
}
void add(int x, int delta)
{
    for (int i = x; i < N; i += lowbit(i))
    {
        tree[i] += delta;
    }
}
long long query(int x)
{
    long long sum = 0;
    for (int i = x; i > 0; i -= lowbit(i))
    {
        sum += tree[i];
    }
    return sum;
}
int main()
{
    int n, q;
    cin >> n >> q;
    vector<int> num(n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        int ai;
        cin >> ai;
        num[i] = ai;
        add(i, ai);
    }

    for (int i = 0; i < q; i++)
    {
        int op;
        cin >> op;
        if (op == 1)
        {
            int x;
            cin >> x;
            add(x, num[x + 1] - num[x]);
            add(x + 1, num[x] - num[x + 1]);
            int temp = num[x];
            num[x] = num[x + 1];
            num[x + 1] = temp;
        }
        else
        {
            int l, r;
            cin >> l >> r;
            cout << query(r) - query(l - 1) << '\n';
        }
    }
    return 0;
}

Submission Info

Judge Result