Cod sursa(job #2967159)

Utilizator mihaicrisanMihai Crisan mihaicrisan Data 19 ianuarie 2023 09:30:59
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.39 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin ("aib.in");
ofstream fout("aib.out");

const int NMAX = 100005;

int n, m;
int op, a, b;
int v[NMAX], aib[NMAX];

int get_sum(int i) {
    int sum = 0;
    while (i) {
        sum += aib[i];
        i -= i & -i;
    }
    return sum;
}

void update(int i, int val) {
    while (i <= n) {
        aib[i] += val;
        i += i & -i;
    }
}

void create_aib() {
    ///aib initializat initial cu 0
    ///O(n*log(n))
    for (int i = 1; i <= n; i++)
        update(i, v[i]);
}

int pos(int val) {
    int k = 0, pas = 1;
    for (; pas < n; pas <<= 1);
    for (; pas; pas >>= 1) {
        if (k + pas <= n) {
            if (val >= aib[k + pas]) {
                k += pas;
                val -= aib[k];
                if (!val)
                    return k;
            }
        }
    }
    return -1;
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> v[i];

    create_aib();

    while(m--) {
        fin >> op;
        if (op == 0) {
            fin >> a >> b;
            v[a] += b;
            update(a, b);
        }
        else if (op == 1) {
            fin >> a >> b;
            fout << get_sum(b) - get_sum(a-1) << '\n';
        }
        else {
            fin >> a;
            fout << pos(a) << '\n';
        }
    }

    return 0;
}