Cod sursa(job #3288753)

Utilizator bogdan1479Luca Bogdan Alexandru bogdan1479 Data 24 martie 2025 09:52:27
Problema Datorii Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.84 kb
#include <fstream>

using namespace std;

const int NMAX = 1e5 + 1;

class InParser
{
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        ++sp;
        if(sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n)
    {
        char c;
        while(!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if(c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else
        {
            n = c - '0';
        }
        while(isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

InParser fin("datorii.in");
ofstream fout("datorii.out");

int n, aib[NMAX];

void add(int poz, int val)
{
    while(poz <= n)
    {
        aib[poz] += val;
        poz += poz & (-poz);
    }
}

int sum(int poz)
{
    int s = 0;
    while(poz)
    {
        s += aib[poz];
        poz &= (poz - 1);
    }
    return s;
}

int cb(int val)
{
    int i, step;
    for(step = 1; step < n; step <<= 1);
    for(i = 0; step; step >>= 1)
    {
        int poz = i + step;
        if(poz <= n && aib[poz] <= val)
        {
            val -= aib[poz];
            i = poz;
            if(!val) return i;
        }
    }
    return -1;
}

int main()
{
    int m, op, x, y;
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        fin >> x;
        add(i, x);
    }
    while(m--)
    {
        fin >> op >> x >> y;
        if(op) fout << sum(y) - sum(x - 1) << '\n';
        else add(x, -y);
    }
    return 0;
}