Submission #74961992

---

Source Code Expand

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

typedef long long ll;
const int N = 2e5 + 10;
int n, q;
ll tree[N];

int lowbit(int x) { return x & (-x); }

void update(int x, ll d)
{
    while (x <= n)
    {
        tree[x] += d;
        x += lowbit(x);
    }
}

ll sum(int x)
{
    ll ans = 0;
    while (x > 0)
    {
        ans += tree[x];
        x -= lowbit(x);
    }
    return ans;
}

void solve()
{
    cin >> n >> q;
    ll num = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> num;
        update(i, num);
        update(i + 1, -num);
    }
    int op;
    int l, r, p;
    ll x;
    while (q--)
    {   
        cin >> op;
        if (op == 1)
        {
            cin >> l >> r >> x;
            update(l, x);
            update(r + 1, -x);
        }
        else
        {
            cin >> p;
            cout << sum(p) << '\n';
        }
    }

}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    // int t;
    // cin >> t;
    // while (t--) solve();

    solve();
    
    return 0;
}

Submission Info

Judge Result