Cod sursa(job #2040822)

Utilizator osiaccrCristian Osiac osiaccr Data 16 octombrie 2017 16:36:53
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.42 kb
#include <fstream>
#define DEF 100001

using namespace std;

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

int n, m, v[DEF];

void update (int p, int x) {
    for (; p <= n; p += (p & -p)) {
        v[p] += x;
    }
}

unsigned int querry (int p) {
    int r = 0;
    for (; p; p -= (p & -p)) {
        r += v[p];
    }
    return r;
}

unsigned int querry_i (int a, int b) {
    if (a == 1)
        return querry (b);
    else {
        return querry (b) - querry (a - 1);
    }
}

unsigned caut_b (int x) {
    int mid, st = 1, dr = n;
    while (st <= dr) {
        mid =  (st + dr) / 2;
        unsigned int t = querry (mid);
        if (t >= x)
            dr = mid - 1;
        else
            st = mid + 1;
    }
    if (querry (st) == x)
        return st;
    else
        return 0;
}

int main () {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x;
        fin >> x;
        update (i, x);
    }

    for (int i = 1; i <= m; i++) {
        int x, y, z;
        fin >> x >> y;
        if (x == 0) {
            fin >> z;
            update (y, z);
        }
        if (x == 1) {
            fin >> z;
            fout << querry_i (y, z) << "\n";
        }
        if (x == 2) {
            z = caut_b (y);
            if (z)
                fout << z << "\n";
            else
                fout << "-1\n";
        }
    }

    return 0;
}