tests/Point_Add_Range_Sum.test.cpp

View this file on GitHub
Last update: 2025-12-09 07:33:19+07: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 "../misc/macros.h"
#include "../ds/Fenwick.h"

void solve() {
  int n, q;
  cin >> n >> q;
  Fenwick<i64> fw(n);
  for (int i = 1; i <= n; ++i) {
    i64 x;
    cin >> x;
    fw.add(i, x);
  }
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      int p, x;
      cin >> p >> x;
      ++p;
      fw.add(p, x);
    } else {
      int l, r;
      cin >> l >> r;
      ++l;
      cout << fw.sum(l, r) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  // cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}

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

#line 1 "misc/macros.h"
// #pragma GCC optimize("Ofast,unroll-loops")       // unroll long, simple loops
// #pragma GCC target("avx2,fma")                   // vectorizing code
// #pragma GCC target("lzcnt,popcnt,abm,bmi,bmi2")  // for fast bitset operation

#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;  // ordered_set, gp_hash_table
// using namespace __gnu_cxx; // rope

// for templates to work
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using pii = pair<i32, i32>;
using vi = vector<i32>;

// fast map
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {  // customize hash function for gp_hash_table
  int operator()(int x) const { return x ^ RANDOM; }
};
gp_hash_table<int, int, chash> table;

/* ordered set
    find_by_order(k): returns an iterator to the k-th element (0-based)
    order_of_key(k): returns the number of elements in the set that are strictly less than k
*/
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*  rope
    rope <int> cur = v.substr(l, r - l + 1);
    v.erase(l, r - l + 1);
    v.insert(v.mutable_begin(), cur);
*/
#line 1 "ds/Fenwick.h"
// for 2d fenwick just add a for
template <class T>
struct Fenwick {  // 1-indexed
  int n;
  vector<T> t;
  Fenwick(int n) : n(n), t(n + 1, T(0)) {}
  void add(int p, T v) {
    while (p <= n) t[p] += v, p += (p & -p);
  }
  T sum(int p) {
    T res = 0;
    while (p) res += t[p], p -= (p & -p);
    return res;
  }
  // [l, r)
  T sum(int l, int r) {
    if (l > r) return T(0);
    return sum(r) - sum(l - 1);
  }
};
#line 5 "tests/Point_Add_Range_Sum.test.cpp"

void solve() {
  int n, q;
  cin >> n >> q;
  Fenwick<i64> fw(n);
  for (int i = 1; i <= n; ++i) {
    i64 x;
    cin >> x;
    fw.add(i, x);
  }
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      int p, x;
      cin >> p >> x;
      ++p;
      fw.add(p, x);
    } else {
      int l, r;
      cin >> l >> r;
      ++l;
      cout << fw.sum(l, r) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  // cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}