Cod sursa(job #2503476)

Utilizator poparobertpoparobert poparobert Data 3 decembrie 2019 11:10:13
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.32 kb
#include <fstream>
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
int n,m,aux,v[100001],a,b;
int oof(int x)
{
    return (x^(x-1))&x;
}
void add(int x,int val)
{
    for(int i=x;i<=n;i+=oof(i))
        v[i]+=val;
}
int sum(int a)
{
    int rez=0;
    for(int i=a;i>=1;i-=oof(i))
        rez+=v[i];
    return rez;
}
int binsch(int a)
{
    int in=1,sf=n,poz=0,md,x;
    while(poz==0)
    {
        md=(in+sf)/2;
        x=sum(md);
        if(x==a)
            poz=md;
        else if(x>a)
            sf=md-1;
        else
            in=md+1;
        if(sf-in<2)
        {
            x=sum(in);
            if(x==a)
                poz=in;
            x=sum(sf);
            if(x==a)
                poz=sf;
            if(poz==0)
                poz=-1;
        }
    }
    return poz;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>aux;
        add(i,aux);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>aux;
        if(aux==0)
        {
            cin>>a>>b;
            add(a,b);
        }
        else if(aux==1)
        {
            cin>>a>>b;
            cout<<sum(b)-sum(a-1)<<'\n';
        }
        else
        {
            cin>>a;
            cout<<binsch(a)<<'\n';
        }
    }
    return 0;
}