Cod sursa(job #2719122)

Utilizator QwertyDvorakQwerty Dvorak QwertyDvorak Data 9 martie 2021 16:42:10
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.34 kb
#include <bits/stdc++.h>
using namespace std;

const string FILENAME = "aib";

ifstream fin(FILENAME + ".in");
ofstream fout(FILENAME + ".out");

int n, m;
int a[100001];


void update(int p, int  x)
{
    for(; p <= n; p += (p & (-p)))
        a[p] += x;
}
int query(int p)
{
    int ans = 0;
    for(; p >= 1; p -= (p &(-p)))
        ans += a[p];
    return ans;
}

int binSearch(int x)
{
    int st, dr, mid, ans = -1,val;
    st = 1; dr = n;
    while(st <= dr)
    {
        mid = (st + dr) >> 1;
        val = query(mid);
        if(val == x){
            dr = mid - 1;
            ans = mid;
        }
        else if(val > x)
            dr = mid - 1;
        else st = mid + 1;
    }
    return ans;
}

int main()
{
    int op, x, y;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> x;
        a[i] += x;
        if(i + (i & (-i)) <= n)
        a[i + (i & (-i))] += a[i];
    }
    while(m--)
    {
        fin >> op;
        if(op == 0)
        {
            fin >> x >> y;
            update(x, y);
        }
        else if(op == 1){
            fin >> x >> y;
            fout << query(y) - query(x - 1) << "\n";
        }
        else {
            fin >> x;
            fout <<binSearch(x) << "\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}