Cod sursa(job #3212481)

Utilizator QwertyDvorakQwerty Dvorak QwertyDvorak Data 11 martie 2024 19:43:46
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.44 kb
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define dbg(x) cout << #x << ": " << x << "\n";
#define sz(x) ((int)x.size())

using ll = long long;

const string fn = "aib";
ifstream fin(fn + ".in");
ofstream fout(fn + ".out");

int n, m;
int aib[100005];

void upd(int x, int y)
{
    for (int i = x; i <= n; i += (i & (-i)))
        aib[i] += y;
}

int qry(int x)
{

    int ans = 0;
    for (int i = x; i >= 1; i -= (i & (-i)))
        ans += aib[i];
    return ans;
}

int cb(int x)
{
    int st, dr;
    st = 1;
    dr = n;
    int mid, ans = -1;
    while (st <= dr)
    {
        mid = (st + dr) >> 1;
        int val = qry(mid);
        if (val == x)
        {
            dr = mid - 1;
            ans = mid;
        }
        else if (val > x)
            dr = mid - 1;
        else
            st = mid + 1;
    }
    return ans;
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x;
        fin >> x;
        aib[i] += x;
        int nxt = i + (i & (-i));
        if (nxt <= n)
            aib[nxt] += aib[i];
    }
    while (m--)
    {

        int op, x, y;
        fin >> op;
        if (op == 0)
        {
            fin >> x >> y;
            upd(x, y);
        }
        else if (op == 1)
        {
            fin >> x >> y;
            fout << qry(y) - qry(x - 1) << '\n';
        }
        else
        {
            fin >> x;
            fout << cb(x) << '\n';
        }
    }
    return 0;
}