Cod sursa(job #3150987)

Utilizator stefR2020StefanRadulescu stefR2020 Data 19 septembrie 2023 12:06:23
Problema Arbori indexati binar Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.37 kb
#include <fstream>
#include <vector>

using namespace std;

vector <int> v( 1000000 , 0);
int n,m;

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

void update(int i,int val)
{
    while(i<=n)
    {
        v[i]+=val;
        i+= ( i & (-i) );
    }
}
int prequerry(int i)
{
    int sum=0;
    while(i>0)
    {
        sum+=v[i];
        i-= ( i & (-i) );
    }
    return sum;
}

int querry(int i,int j)
{
    return prequerry(j)-prequerry(i-1);
}

int main()
{
    int a,b,c;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a;
        update(i,a);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b;
        if(a==0)
        {
            cin>>c;
            update(b,c);
        }
        else if(a==1)
        {
            cin>>c;
            cout<<querry(b,c)<<'\n';
        }
        else
        {
            int ok=0;
            for(int i=1;i<=n;i++)
            {
                if(prequerry(i) == b)
                {
                    cout<<i<<'\n';
                    ok=1;
                    break;
                }
                else if(prequerry(i) > b)
                {
                    cout<<-1<<'\n';
                    ok=1;
                    break;
                }
            }
            if(ok==0)
                cout<<-1<<'\n';
        }
    }
    return 0;
}