Cod sursa(job #2433551)

Utilizator rd211Dinucu David rd211 Data 27 iunie 2019 22:19:27
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.76 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
vector<int> v(100010);
int n,m;
void buildV()
{
    for(int i = 1; i<=n; i++)
    {
        int index2 = i+(i&(-i));
        if(index2<=n)
            v[index2]+=v[i];
    }
}

void addV(int x,int pos)
{
    int index2 = pos;
    while(index2<=n)
    {
        v[index2]+=x;
        index2 = index2+(index2&(-index2));
    }

}
int sum(int pos)
{
    int index2 = pos,res=0;
    while(index2>0)
    {
        res+=v[index2];
        index2=index2-(index2&(-index2));
    }
    return res;
}
int sumRange(int s,int f)
{
    return (sum(f)-sum(s-1));
}
void citesteV()
{
    for(int i = 1; i<=n; i++)
        fin>>v[i];
}
int minimK(int val)
{
    int power2;
    for(power2=1;power2<n;power2<<=1);
    for(int i = 0;power2;power2>>=1)
    {
        if(i+power2<=n)
        {
            if(val>=v[i+power2])
            {
                i+=power2,val-=v[i];
                if(!val)
                    return i;
            }
        }
    }
    return -1;
}

void citesteQ()
{
    int q,x,p;
    while(m--)
    {
        fin>>q>>x;
        if(q==0)
        {
            fin>>p;
            addV(p,x);
        }
        else if(q==1)
        {
            fin>>p;
            fout<<sumRange(x,p)<<'\n';
        }
        else
        {
            fout<<minimK(x)<<'\n';
        }
    }
}
int main()
{
    fin>>n>>m;
    citesteV();
    buildV();
    //for(int i = 1;i<=n;i++)
    //    cout<<loga[i]<<" ";
    //cout<<endl;
    //for(int i = 0;i<=power2.size();i++)
    //    cout<<power2[i]<<" ";
    //cout<<endl;
    citesteQ();

    return 0;
}