Cod sursa(job #1138796)

Utilizator UAIC_Balan_Negrus_HreapcaUAIC Balan Negrus Hreapca UAIC_Balan_Negrus_Hreapca Data 10 martie 2014 16:35:49
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2.85 kb
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "aib";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

class Aib
{
    public:
        Aib(int N)
        {
            _N = N;
            _data.resize(N + 1, 0);
        }
        void update(int x, int val)
        {
            for(int i = x; i <= _N; i+= zeros(i))
            {
                _data[i] += val;
            }
        }
        int query(int x)
        {
            int res = 0;
            for(int i = x; i > 0; i-= zeros(i))
            {
                res += _data[i];
            }
            return res;
        }
        int find(int x)
        {
            int step = 1;
            while(step < _N)
                step <<= 1;
            int res = 0;
            for(;step; step >>= 1)
            {
                if(res + step > _N)
                    continue;
                if(x >= _data[res + step])
                {
                    x -= _data[res + step];
                    res += step;
                    if(x == 0)
                    {
                        return res;
                    }
                }
            }
            return -1;
        }   
        static int zeros(int x)
        {
            return (x & ((x - 1) ^ x));
        }
    protected:
    private:
        int _N;
        vector<int> _data;
};

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin >> N >> M;
    Aib aib(N);
    for(int i = 1; i <= N; i++)
    {
        int x;
        fin >> x;
        aib.update(i, x);
    }
    for(int i = 0; i < M; i++)
    {
        int op, x, y;
        fin >> op >> x;
        if(op == 0)
        {
            fin >> y;
            aib.update(x, y);
        }
        else if(op == 1)
        {
            fin >> y;
            int q1 = aib.query(x - 1);
            int q2 = aib.query(y);
            fout << q2 - q1 << "\n";
        }
        else if(op == 2)
        {
            fout << aib.find(x) << "\n";
        }
    }

#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}