Cod sursa(job #1829128)

Utilizator andysoloAndrei Solo andysolo Data 14 decembrie 2016 13:58:11
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.19 kb
#include<bits/stdc++.h>
#define ub(x) (x&(-x))
using namespace std;

int N,M,x;
int AiB[100005];
int d,p,k;


int getAiB(int p);
int binc(int s) {

    int st = 1,dr = N;
    int mid = 0;
    while(st<=dr)
    {
        mid = (st+dr) >> 1;
        int act = getAiB(mid);
        if (act == s)
            return mid;
        else if (act>s)
            dr = mid - 1;
        else st = mid + 1;
    }
    return -1;
}

void addAiB(int x,int p) {
    for(int i=p; i<=N; i+=ub(i))
        AiB[i]+=x;
}

int getAiB(int p) {
    int s=0;
    for(int i=p; i>0; i-=ub(i))
        s+=AiB[i];
    return s;
}

int main() {
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);

    scanf("%d %d",&N,&M);

    for(int i=1; i<=N; i++) {
        scanf("%d",&x);
        addAiB(x,i);
    }

    for(int i=1; i<=M; i++) {
        scanf("%d",&d);
        if(d==0) {
            scanf("%d %d",&p,&k);
            addAiB(k,p);
        } else if(d==1) {
            scanf("%d %d",&p,&k);
            printf("%d\n",getAiB(k)-getAiB(p-1));
        } else if(d==2) {
            scanf("%d",&p);
            printf("%d\n",binc(p));
        }
    }

    return 0;
}