Cod sursa(job #1867086)

Utilizator radu.leonardoThe Doctor radu.leonardo Data 3 februarie 2017 18:44:01
Problema Datorii Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.58 kb
#include <fstream>
#define NMAX 15001
#define buff_size (1<<17)
char outBuff[buff_size];
int outPtr;
char buff[buff_size];
int pos=0;
using namespace std;

FILE*f=freopen("datorii.in","r",stdin);
FILE*g=freopen("datorii.out","w",stdout);
int n,m,t[2 * NMAX],q,a,b,sum;
inline void read(int &nr)
{
    while(!isdigit(buff[pos])) if(++pos == buff_size) fread(buff,  1,buff_size, stdin), pos = 0;
    nr = 0;
    while(isdigit(buff[pos]))
    {
        nr = (nr<<1)+(nr<<3)+ buff[pos] - 48;
        if(++pos == buff_size) fread(buff, 1, buff_size, stdin), pos = 0;
    }
}
inline void putChar(const char &C) {
    outBuff[outPtr++] = C;
    if (outPtr == buff_size) {
        fwrite(outBuff, 1, buff_size, stdout);
        outPtr = 0;
    }
}

inline  void write(int X) {
    static char digs[10];
    int n = 0, q;
    do {
        q = X / 10;
        digs[n++] = X - (q << 1) - (q << 3) + 48;

        X = q;
    } while (X);
    while (n--) {
        putChar(digs[n]);
    }

}

int main()
{
    read(n);read(m);
    for (int i = 0; i < n; ++i) read(t[n+i]);
    for (int i = n - 1; i > 0; --i) t[i] = t[i<<1] + t[i<<1|1];

    while(m--)
    {
        read(q);read(a);read(b);a--;

        if(q==1)
        {sum=0;
                         for (a+= n, b += n; a < b; a >>= 1, b >>= 1)
                {   if (a&1) sum += t[a++];
                    if (b&1) sum += t[--b];
                }

        write(sum);putChar('\n');

        }

        else for (t[a += n] -= b; a> 1; a >>= 1)t[a>>1] -= b;

    }
fwrite(outBuff, 1, outPtr, stdout);

}