Cod sursa(job #3218810)

Utilizator Mihai_OctMihai Octavian Mihai_Oct Data 28 martie 2024 11:53:03
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, q, i, op, a, b, aib[100002];

static inline int Ub(int a) {
    return (a & -a);
}

static inline void Add(int poz, int val) {
    for(int i = poz; i <= n; i += Ub(i)) aib[i] += val;
}

static inline int Sum(int poz) {
    int sum = 0;
    for(int i = poz; i >= 1; i -= Ub(i)) sum += aib[i];
    return sum;
}

static inline int Cb(int val) {
    int st = 1, dr = n;
    int poz = 0;
    while(st <= dr) {
        int mij = st + (dr - st) / 2;
        int s = Sum(mij);

        if(s >= val) {
            poz = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return poz;
}

int main() {
    fin >> n >> q;
    for(i = 1; i <= n; i++) {
        fin >> a;
        Add(i, a);
    }

    for(i = 1; i <= q; i++) {
        fin >> op;
        if(op == 0) {
            fin >> a >> b;
            Add(a, b);
        }
        else if(op == 1) {
            fin >> a >> b;
            fout << Sum(b) - Sum(a - 1) << "\n";
        }
        else {
            fin >> a;
            int poz = Cb(a);

            if(Sum(poz) == a) fout << poz << "\n";
            else fout << "-1\n";
        }
    }

    return 0;
}