Cod sursa(job #1971057)

Utilizator Vlad_lsc2008Lungu Vlad Vlad_lsc2008 Data 19 aprilie 2017 19:54:07
Problema Arbori indexati binar Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.09 kb
#include <iostream>
#include <cstdio>
using namespace std;

int n,m;
int aib[100005];

inline int zeros(int x)
{
    return ((x-1)^x)&x;
}

inline void update(int poz, int val)
{
    for(int i=poz;i<=n;i+=zeros(i))
        aib[i]+=val;
}

inline int calc(int poz)
{
    int rez=0;
    for(int i=poz;i>=1;i-=zeros(i))
        rez+=aib[i];
    return rez;
}

inline int getpos(int val)
{
    int p,poz;
    for(p=1;p<=n;p<<=1);
    for(poz=0;p>0;p>>=1)
    {
        if(poz+p <= n)
            if(calc(poz+p)<=val) poz+=p;
    }
    if(calc(poz) !=val) return -1;
    return poz;
}

int main()
{
    int i,nr,a,b,t;
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&nr);
        update(i,nr);
    }
    for(;m;m--)
    {
        scanf("%d%d",&t,&a);
        if(t!=2) scanf("%d",&b);
        if(t==0) update(a,b);
        if(t==1) printf("%d\n",calc(b)-calc(a-1));
        if(t==2) printf("%d\n",getpos(a));
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}