Cod sursa(job #2409036)

Utilizator butasebiButa Gabriel-Sebastian butasebi Data 18 aprilie 2019 16:59:42
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.42 kb
#include <bits/stdc++.h>
using namespace std;
int n, m, st, dr, val, i, x, q, sum, a, b, aib[400005];
bool ok;
int LastBit(int x)
{
    return x & (- x);
}
void update(int poz, int x)
{
    for(int i = poz; i <= n; i = i + LastBit(i))
        aib[i] = aib[i] + x;
}
int query(int poz)
{
    int sum = 0;
    for(int i = poz; i > 0; i = i - LastBit(i))
        sum = sum + aib[i];
    return sum;
}
int main()
{
    ifstream f("aib.in");
    ofstream g("aib.out");
    f >> n >> m;
    for(i = 1; i <= n; i ++)
    {
        f >> x;
        update(i, x);
    }
    for(i = 1; i <= m; i ++)
    {
        f >> q;
        if(q == 0)
        {
            f >> a >> b;
            update(a, b);
        }
        if(q == 1)
        {
            f >> a >> b;
            g << query(b) - query(a - 1) << "\n";
        }
        if(q == 2)
        {
            f >> sum;
            ok = false;
            st = 1;
            dr = n;
            while(st <= dr)
            {
                int mij = (st + dr) / 2;
                val = query(mij);
                if(val == sum)
                {
                    g << mij << "\n";
                    ok = true;
                    break;
                }
                else if(val < sum)st = mij + 1;
                else dr = mij - 1;
            }
            if(ok == false)g << "-1" << "\n";
        }
    }
    return 0;
}