Cod sursa(job #2627520)

Utilizator testxana jianu testx Data 11 iunie 2020 08:02:43
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.35 kb
#include<cstdio>
#define zz(x) ( (x ^ (x - 1)) & x )
const int N=100001,M=20000000;
int n,m,y,z,i,j,s,c[N],a[N],x,o=-1,l;
char r[M];
inline int A()
{
  	int s=0;
  	for(;r[o]<'0'||r[o]>'9';o++);
  	for(;r[o]>='0'&&r[o]<='9';o++)
  		s=s*10+r[o]-'0';
  	return s;
}
inline void S(int x)
{
    if(x<0)
        x=-x,r[l++]='-';
    int i,d=x>999999999?10:x>99999999?9:x>9999999?8:x>999999?7:x>99999?6:x>9999?5:x>999?4:x>99?3:x>9?2:1;
    for(i=d-1;i>=0;x/=10,i--)
        r[l+i]=x%10+48;
    r[l+d]=10,l+=d+1;
}
inline int R(int y,int z)
{
    int s=0,t=0;
    for(;z;s+=c[z],z-=zz(z));
    for(y--;y;t+=c[y],y-=(zz(y)));
    return s-t;
}
inline int Q(int s,int p)
{
	int i;
    for(i=0;s;s>>=1)
    	if(i+s<=n)
        	if(c[i+s]<p)
            	i+=s,p-=c[i];
        	else if(c[i+s]==p)
            	return i+s;
    return -1;
}
int main()
{
    freopen("aib.in","r",stdin),freopen("aib.out","w",stdout),fread(r,1,M,stdin),n=A(),m=A();
    for(s=1;s<=n;s<<=1);
    for(s>>=1,i=1;i<=n;i++)
        a[i]=A(),a[i]+=a[i-1],j=i-(i&(-i)),c[i]=a[i]-a[j];
    while(m--)
	{
        x=A(),y=A();
        if(x==2)
            S(Q(s,y));
        else
		{
            z=A();
            if(!x)
                for(;y<=n;c[y]+=z,y+=(y&(-y)));
            else
                S(R(y,z));
        }
    }
    fwrite(r,1,l,stdout);
}