Cod sursa(job #2829285)

Utilizator LuxinMatMatasaru Luxin Gabriel LuxinMat Data 8 ianuarie 2022 14:19:47
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.23 kb
#include<fstream>
using namespace std;

ifstream cin("aib.in");
ofstream cout("aib.out");

const int N = 100000;

int v[1 + N];
int n, m;

void update(int nod, int val)
{
    for(int i=nod; i<=n; i+=(i & (-i)))
        v[i] += val;
}

int query(int nod)
{
    int s = 0;
    for(int i = nod; i>0; i-=(i & (-i)))
        s += v[i];
    return s;
}

int cb(int nr)
{
    int r, pas, sum;
    r = 0;
    pas = 1 << 17;
    sum = 0;
    while(pas > 0)
    {
        if(r+pas <= n && sum + v[r+pas] <= nr)
        {
            sum += v[r+pas];
            r += pas;

            if(sum == nr)
                return r;
        }
        pas = pas >> 1;
    }
    return -1;
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        int nr;
        cin>>nr;
        update(i, nr);
    }
    for(int i=1; i<=m; i++)
    {
        int p, a, b;
        cin>>p;
        if(p == 0)
        {
            cin>>a>>b;
            update(a, b);
        }
        else if(p == 1)
        {
            cin>>a>>b;
            cout<<query(b) - query(a-1)<<'\n';
        }
        else if(p == 2)
        {
            cin>>a;
            cout<<cb(a)<<'\n';
        }
    }
    return 0;
}