Cod sursa(job #2448454)

Utilizator mirceamaierean41Mircea Maierean mirceamaierean41 Data 16 august 2019 22:26:36
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.27 kb
#include <fstream>
#define zeros(x)((x^(x-1))&x)
#define NMAX 100005
unsigned int aib[NMAX];
void Add(int x,unsigned int val)
{
    for(int i=x; i<=NMAX; i+=zeros(i))
        aib[i]+=val;
}
unsigned int Compute(int x)
{
    unsigned int suma=0;
    for(int i=x; i; i-=zeros(i))
        suma+=aib[i];
    return suma;
}
int bsearch(int p,int u,unsigned int key)
{
    int m;
    while(p<=u)
    {
        m=(p+u)/2;
        if(Compute(m)<=key) p=m+1;
        else u=m-1;
    }
    m=(p+u)/2;
    if(Compute(m)>key) m--;
    while(Compute(m)==key&&m) m--;
    m++;
    if(Compute(m)==key) return m;
    return -1;
}
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();
    int n,m,q,x,y;
    unsigned int a;
    cin>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        cin>>a;
        Add(i,a);
    }
    for(int i=1; i<=m; ++i)
    {
        cin>>q;
        if(q==0)
        {
            cin>>x>>a;
            Add(x,a);
        }
        else if(q==1)
        {
            cin>>x>>y;
            cout<<Compute(y)-Compute(x-1)<<"\n";
        }
        else
        {
            cin>>a;
            cout<<bsearch(1,n,a)<<"\n";
        }
    }
    return 0;
}