Cod sursa(job #2747404)

Utilizator flibiaVisanu Cristian flibia Data 29 aprilie 2021 01:20:25
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 4.46 kb
// g++ -std=c++17 -DLOCAL a.cpp -o ex && ./ex >tst.out 2>&1
#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
    return '"' + s + '"';
}
 
string to_string(const char* s) {
    return to_string((string) s);
}
 
string to_string(bool b) {
    return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
    bool first = true;
    string res = "{";
    for (int i = 0; i < static_cast<int>(v.size()); i++) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(v[i]);
    }
    res += "}";
    return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
    string res = "";
    for (size_t i = 0; i < N; i++) {
        res += static_cast<char>('0' + v[i]);
    }
    return res;
}
 
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << "   "; }
void debug_out_nl() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}

template <typename Head, typename... Tail>
void debug_out_nl(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out_nl(T...);
}
 
#ifdef LOCAL
#define dbg(...) cerr << "#" << #__VA_ARGS__ << ":", debug_out(__VA_ARGS__)
#define nl(...) cerr << "#" << #__VA_ARGS__ << ":", debug_out_nl(__VA_ARGS__)
#else
#define dbg(...) 69
#define nl(...) 42
#endif

#define ll long long
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll random(ll st, ll dr) {
    assert(st <= dr);
    return st + rng() % (dr - st + 1);
}

const int MOD = 1e9 + 7;
const int N = 2e5 + 10;

template<typename T> 
struct BIT {
    int N;
    vector<T> data;

    BIT(int _N) : N(_N), data(_N + 1, 0) {}

    void update(int id, T val) {
        for (; id <= N; id += (id & -id)) {
            data[id] += val;
        }
    }

    T query(int id) {
        T ans = 0;
        for (; id > 0; id -= (id & -id)) {
            ans += data[id];
        }

        return ans;
    }

    T rangeQuery(int l, int r) {
        assert(l <= r);
        assert(l > 0 && r <= N);

        return query(r) - query(l - 1);
    }
};

void solve(int test, istream &cin, ostream &cout) {
    int n, m;
    cin >> n >> m;
    BIT<int> v(n);

    for (int i = 1, x; i <= n; i++) {
        cin >> x;
        v.update(i, x);
    }

    for (int op, a, b; m--; ) {
        cin >> op;
        if (op == 0) {
            cin >> a >> b;
            v.update(a, b);
        } else if (op == 1) {
            cin >> a >> b;
            cout << v.rangeQuery(a, b) << '\n';
        } else {
            cin >> a;

            int st = 1, dr = n;
            while (st <= dr) {
                int mid = (st + dr) / 2;

                if (v.rangeQuery(1, mid) >= a) {
                    dr = mid - 1;
                } else {
                    st = mid + 1;
                }
            }

            if (v.rangeQuery(1, min(n, st)) == a) {
                cout << st << '\n';
            } else {
                cout << "-1\n";
            }
        }
    }

    // cerr << "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms" << '\n';
}

int main() {
    ifstream cin("aib.in");
    ofstream cout("aib.out");
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    bool multiTest = false;

    int t;    
    if (multiTest) {
        cin >> t;
    } else {
        t = 1;
    }

    for (int test = 1; test <= t; test++) {
        solve(test, cin, cout);
    }

    return 0;
}