Cod sursa(job #3239765)

Utilizator Spikyscutaru matei Spiky Data 7 august 2024 14:54:05
Problema Arbori indexati binar Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

long long n, m, x, y, c, aib[100002], C,ok;

#define zeros(x)((x^(x-1))&x)

void update(int a, int q)
{
    for(int i=a;i<=n;i+=zeros(i))
        aib[i]+=q;
}

int sum(int x)
{
    int s=0;
    for(int i=x;i>0;i-=zeros(i))

        s+=aib[i];
    return s;
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=n;i++)
    {
        cin>>x;
        update(i,x);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>c;
        if(c==0)
        {
            cin>>x>>y;
            update(x,y);
        }
        else if(c==1)
        {
            cin>>x>>y;
            cout<<sum(y)-sum(x-1)<<endl;
        }
        else{
            cin>>x;
            ok=0;
            for(int i=1;i<=n;i++)
                if(sum(i)==x)
                {
                    cout<<i<<endl;
                    ok=1;
                    break;
                }
            if(ok==0)
                cout<<-1<<endl;
        }
    }
}