Cod sursa(job #2031029)

Utilizator CodrinsahCotarlan Codrin Codrinsah Data 2 octombrie 2017 17:18:33
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.07 kb
#include <fstream>
#define p2(x) ((x^(x-1))&x)
using namespace std;
ifstream fi ("aib.in");
ofstream fo ("aib.out");
int aib[100006],v[100006];
int nrel,nrop,op;
void adaug(int pozi,int el)
{
  while (pozi<=nrel)
  {
    aib[pozi]+=el;
    pozi+=p2(pozi);
  }
}
int suma(int x)
{
  if (x==0) return 0;
  return aib[x]+suma(x-p2(x));
}
int pozmin(int pozi,int suma)
{
  if (suma==0) return pozi+1;
  for (int bit=(1<<22);bit>=0;bit=(bit>>1)) //
    if (pozi+bit<=nrel and aib[pozi+bit]<=suma) return pozmin(pozi+bit-1,suma-aib[pozi+bit]);
}
int main()
{
  fi>>nrel>>nrop;
  for (int i=1;i<=nrel;i++) fi>>v[i];
  for (int i=1;i<=nrel;i++) adaug(i,v[i]);
//  for (int i=1;i<=nrel;i++) fo<<aib[i]<<' ';fo<<'\n';
  for (int i=1;i<=nrop;i++)
  {
    fi>>op;
    if (op==0)
    {
      int p,val;
      fi>>p>>val;
      adaug(p,val);
    }
    if (op==1)
    {
      int p1,p2;
      fi>>p1>>p2;
      fo<<suma(p2)-suma(p1-1)<<'\n';
    }
    if (op==2)
    {
      int sum;
      fi>>sum;
      fo<<pozmin(0,sum)<<'\n';
    }
  }
  return 0;
}