test/data_structure/Point_Add_Range_Sum_Fenwick.test.cpp

View this file on GitHub
Last update: 2023-05-31 14:09:15+09:00
Problem: https://judge.yosupo.jp/problem/point_add_range_sum

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/point_add_range_sum"

#include "../../data_structure/fenwick_tree.hpp"
#include "../../template/template.hpp"

using namespace lib;

int main() {
    int n, q;
    std::cin >> n >> q;
    fenwick_tree<ll> fw(n);
    rep(i, 0, n) {
        ll a;
        std::cin >> a;
        fw.add(i, a);
    }
    while (q--) {
        int t;
        std::cin >> t;
        if (t == 0) {
            int p;
            ll x;
            std::cin >> p >> x;
            fw.add(p, x);
        } else {
            int l, r;
            std::cin >> l >> r;
            std::cout << fw.sum(l, r) << '\n';
        }
    }
}

#line 1 "test/data_structure/Point_Add_Range_Sum_Fenwick.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/point_add_range_sum"

#line 2 "data_structure/fenwick_tree.hpp"

#line 2 "template/template.hpp"

#include <bits/stdc++.h>

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}

namespace lib {

using namespace std;

}  // namespace lib

// using namespace lib;
#line 4 "data_structure/fenwick_tree.hpp"

namespace lib {

template <class T> struct fenwick_tree {
  private:
    int n;
    std::vector<T> data;

  public:
    fenwick_tree(int n) : n(n), data(n + 1) {}

    void add(int p, T x) {
        assert(0 <= p && p < n);
        p++;
        for (int i = p; i <= n; i += i & -i) {
            data[i] += x;
        }
    }

    T prefix_sum(int p) const {
        assert(0 <= p && p <= n);
        T ret = 0;
        for (int i = p; i > 0; i -= i & -i) {
            ret += data[i];
        }
        return ret;
    }

    T sum(int l, int r) const {
        return prefix_sum(r) - prefix_sum(l);
    }
};

}  // namespace lib
#line 5 "test/data_structure/Point_Add_Range_Sum_Fenwick.test.cpp"

using namespace lib;

int main() {
    int n, q;
    std::cin >> n >> q;
    fenwick_tree<ll> fw(n);
    rep(i, 0, n) {
        ll a;
        std::cin >> a;
        fw.add(i, a);
    }
    while (q--) {
        int t;
        std::cin >> t;
        if (t == 0) {
            int p;
            ll x;
            std::cin >> p >> x;
            fw.add(p, x);
        } else {
            int l, r;
            std::cin >> l >> r;
            std::cout << fw.sum(l, r) << '\n';
        }
    }
}