Cod sursa(job #3286084)

Utilizator CimpoesuFabianCimpoesu Fabian George CimpoesuFabian Data 13 martie 2025 18:36:09
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.28 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");

int n, m, aib[100005], t;

void Update(int p, int x)
{
    while (p <= n)
    {
        aib[p] += x;
        p += (p & -p);
    }
}

int Query(int p)
{
    int s = 0;
    while (p >= 1)
    {
        s += aib[p];
        p -= (p & -p);
    }
    return s;
}

int CautBin(int x)
{
    int st = 1, dr = n, mij, poz = -1, suma;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        suma = Query(mij);
        if (suma < x)
            st = mij + 1;
        else if (suma > x)
            dr = mij - 1;
        else
        {
            poz = mij;
            dr = mij - 1;
        }
    }
    return poz;
}

int main()
{
    int i, j, x, y;
    fin >> n >> m;
    for (i = 1 ; i <= n ; i++)
    {
        fin >> x;
        Update(i, x);
    }
    for (i = 1 ; i <= m ; i++)
    {
        fin >> t;
        if (t == 0)
        {
            fin >> x >> y;
            Update(x, y);
        }
        else if (t == 1)
        {
            fin >> x >> y;
            fout << Query(y) - Query(x - 1) << "\n";
        }
        else
        {
            fin >> x;
            fout << CautBin(x) << "\n";
        }
    }
    return 0;
}