Cod sursa(job #3151148)

Utilizator adelinapetreAdelina Petre adelinapetre Data 19 septembrie 2023 21:08:34
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.31 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("aib.in");
ofstream cout ("aib.out");
vector<int> bit(100005, 0);
int v[100005];
int n;
void update(int i, int val)
{
    while(i<=n)
    {
        bit[i]+=val;
        i+=i&(-i);
    }
}
int prefix(int i)
{
    int sum=0;
    while(i>0)
    {
        sum+=bit[i];
        i-=i&(-i);
    }
    return sum;
}
int rangesum(int i, int j)
{
    return prefix(j)-prefix(i-1);
}
int cb(int x, int st, int dr)
{
    int mid,s;
    while(st<dr)
    {
        mid=(st+dr)/2;
        s=prefix(mid);
        if(s>=x)
            dr=mid;
        else
            st=mid+1;
    }
    return st;
}
int main()
{
    int m,val,i,a,b,sol=-1;
    cin>>n>>m;
    for(i=1; i<=n; i++)
    {
        cin>>v[i];
        update(i,v[i]);
    }
    for(i=1; i<=m; i++)
    {
        cin>>val;
        if(val==0)
        {
            cin>>a>>b;
            update(a, b);
        }
        else if(val==1)
        {
            cin>>a>>b;
            cout<<rangesum(a,b) << '\n';
        }
        else
        {
            cin>>a;
            sol=cb(a,1,n);
            if(rangesum(1,sol)!=a)
                cout<<-1;
            else
                cout<<sol;
            cout<<'\n';
        }
    }
    return 0;
}