:heavy_check_mark: verify/segment-tree/LC_point_add_rectangle_sum.segment_tree_2d.test.cpp

Depends on

Code

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

#include "template/template.hpp"
#include "segment-tree/segment-tree-2d.hpp"

int main() {
  int n, q;
  in(n, q);
  vector<array<int, 3>> ps(n);
  vector<pair<int, int>> points;
  rep(i, 0, n) {
    int x, y, w;
    in(x, y, w);
    ps[i] = {x, y, w};
    points.push_back({x, y});
  }

  vector<array<int, 5>> qs(q);
  rep(i, 0, q) {
    int t;
    in(t);
    if (t == 0) {
      int x, y, w;
      in(x, y, w);
      qs[i] = {0, x, y, w, 0};
      points.push_back({x, y});
    } else {
      int l, d, r, u;
      in(l, d, r, u);
      qs[i] = {1, l, d, r, u};
    }
  }

  SegmentTree2D<AddMonoid<long long>> seg(points);
  for (auto [x, y, w] : ps) seg.apply(x, y, w);

  for (auto query : qs) {
    if (query[0] == 0) {
      auto [_, x, y, w, __] = query;
      seg.apply(x, y, w);
    } else {
      auto [_, l, d, r, u] = query;
      out(seg.prod(l, r, d, u));
    }
  }
}
#line 1 "verify/segment-tree/LC_point_add_rectangle_sum.segment_tree_2d.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/point_add_rectangle_sum"

#line 2 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#line 2 "template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "template/template.hpp"

#line 2 "template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <class T>
using priority_queue_asc = priority_queue<T, vector<T>, greater<T>>;

template <class T, class S = T>
S SUM(const vector<T>& a) {
  return accumulate(ALL(a), S(0));
}
template <class T1, class T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmin_opt(optional<T1>& a, T2 b) {
  if (!a || a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax_opt(optional<T1>& a, T2 b) {
  if (!a || a < b) {
    a = b;
    return true;
  }
  return false;
}

template <class T>
int popcnt(T x) {
  return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
  return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
  return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "template/template.hpp"

#line 2 "template/inout.hpp"
struct Fast {
  Fast() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} fast;

ostream& operator<<(ostream& os, __uint128_t x) {
  char buf[40];
  size_t k = 0;
  while (x > 0) buf[k++] = (char)(x % 10 + '0'), x /= 10;
  if (k == 0) buf[k++] = '0';
  while (k) os << buf[--k];
  return os;
}
ostream& operator<<(ostream& os, __int128_t x) {
  return x < 0 ? (os << '-' << (__uint128_t)(-x)) : (os << (__uint128_t)x);
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
  for (auto& v : a) is >> v;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
  os << "{";
  for (auto it = st.begin(); it != st.end();) {
    os << *it;
    if (++it != st.end()) os << ",";
  }
  os << "}";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
  os << "{";
  for (auto it = mp.begin(); it != mp.end();) {
    os << it->first << ":" << it->second;
    if (++it != mp.end()) os << ",";
  }
  os << "}";
  return os;
}

void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
  cin >> t;
  in(u...);
}
template <class... T>
void in_zip(int n, T&... t) {
  assert(n >= 0 && ((size(t) >= static_cast<size_t>(n)) && ...));
  for (int i = 0; i < n; i++) in(t[i]...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}
template <class T, class U>
void out_opt(const optional<T>& opt, const U& fallback, ostream& os = cout) {
  if (opt.has_value())
    os << opt.value();
  else
    os << fallback;
  os << "\n";
}
template <class T, class U>
void out_opt(const vector<optional<T>>& vec, const U& fallback, ostream& os = cout) {
  for (auto it = vec.begin(); it != vec.end();) {
    if ((*it).has_value())
      os << (*it).value();
    else
      os << fallback;
    if (++it != vec.end()) os << " ";
  }
  os << "\n";
}

namespace IO {
template <class T, class... U>
T read(U&&... u) {
  T t = T(forward<U>(u)...);
  in(t);
  return t;
}
namespace Graph {
vector<vector<int>> unweighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    u -= offset, v -= offset;
    g[u].push_back(v);
    if (!directed) g[v].push_back(u);
  }
  return g;
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<pair<int, T>>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    T w;
    cin >> u >> v >> w;
    u -= offset, v -= offset;
    g[u].push_back({v, w});
    if (!directed) g[v].push_back({u, w});
  }
  return g;
}
}  // namespace Graph
namespace Tree {
vector<vector<int>> unweighted(int n, bool directed = false, int offset = 1) {
  return Graph::unweighted(n, n - 1, directed, offset);
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, bool directed = false, int offset = 1) {
  return Graph::weighted<T>(n, n - 1, directed, offset);
}
vector<vector<int>> rooted(int n, bool to_root = true, bool to_leaf = true, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    p -= offset;
    if (to_root) g[i].push_back(p);
    if (to_leaf) g[p].push_back(i);
  }
  return g;
}
}  // namespace Tree
}  // namespace IO
#line 10 "template/template.hpp"

#line 2 "template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int, T) {
  cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
  for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
  cerr << ":" << b << " ";
  _show(i + 1, a, c...);
}
#line 2 "segment-tree/segment-tree-2d.hpp"

#line 2 "algebraic-structure/util.hpp"
#ifdef __cpp_concepts
#define REQUIRES(...) requires __VA_ARGS__
#else
#define REQUIRES(...)
#endif
#line 3 "algebraic-structure/magma.hpp"

#ifdef __cpp_concepts
template <class M>
concept Magma = requires(typename M::value_type x, typename M::value_type y) {
  typename M::value_type;
  { M::op(x, y) } -> same_as<typename M::value_type>;
};
#endif

template <class T>
struct AddMagma {
  using value_type = T;
  static T op(T x, T y) { return x + y; }
};
template <class T>
struct MulMagma {
  using value_type = T;
  static T op(T x, T y) { return x * y; }
};
template <class T, T id>
struct MaxMagma {
  using value_type = T;
  static T op(T x, T y) { return x > y ? x : y; }
};
template <class T, T id>
struct MinMagma {
  using value_type = T;
  static T op(T x, T y) { return x < y ? x : y; }
};
#line 3 "algebraic-structure/monoid.hpp"

#ifdef __cpp_concepts
template <class M>
concept Monoid = Magma<M> && requires {
  { M::e() } -> same_as<typename M::value_type>;
};
#endif

template <class T>
struct AddMonoid {
  using value_type = T;
  static T op(T x, T y) { return x + y; }
  static T e() { return T(0); }
};
template <class T>
struct MulMonoid {
  using value_type = T;
  static T op(T x, T y) { return x * y; }
  static T e() { return T(1); }
};
template <class T, T id>
struct MaxMonoid {
  using value_type = T;
  static T op(T x, T y) { return x > y ? x : y; }
  static T e() { return id; }
};
template <class T, T id>
struct MinMonoid {
  using value_type = T;
  static T op(T x, T y) { return x < y ? x : y; }
  static T e() { return id; }
};
#line 4 "segment-tree/segment-tree-2d.hpp"

// M: commutative monoid
template <class M>
REQUIRES(Monoid<M>)
struct SegmentTree2D {
  using T = typename M::value_type;
  SegmentTree2D() : n(0), size(1) {}
  explicit SegmentTree2D(const vector<pair<int, int>>& points) { build(points); }
  void build(vector<pair<int, int>> points) {
    sort(points.begin(), points.end());
    points.erase(unique(points.begin(), points.end()), points.end());
    ps = points;
    xs.clear();
    xs.reserve(ps.size());
    for (auto [x, _] : ps) xs.push_back(x);
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
    n = xs.size();
    size = 1;
    while (size < n) size <<= 1;
    ys.assign(2 * size, {});
    seg.assign(2 * size, {});
    for (auto [x, y] : ps) {
      int k = lower_bound(xs.begin(), xs.end(), x) - xs.begin();
      for (k += size; k > 0; k >>= 1) ys[k].push_back(y);
    }
    for (int k = 1; k < 2 * size; k++) {
      sort(ys[k].begin(), ys[k].end());
      ys[k].erase(unique(ys[k].begin(), ys[k].end()), ys[k].end());
      seg[k].assign(2 * ys[k].size(), M::e());
    }
  }
  bool contains(int x, int y) const {
    auto it = lower_bound(ps.begin(), ps.end(), make_pair(x, y));
    return it != ps.end() && *it == make_pair(x, y);
  }
  void set(int x, int y, T v) {
    int k = leaf(x, y);
    set_node(k, y, v);
    while (k >>= 1) {
      T vl = get_node(2 * k, y);
      T vr = get_node(2 * k + 1, y);
      set_node(k, y, M::op(vl, vr));
    }
  }
  void apply(int x, int y, T v) {
    int k = leaf(x, y);
    while (k > 0) {
      apply_node(k, y, v);
      k >>= 1;
    }
  }
  T get(int x, int y) const {
    int k = leaf(x, y);
    return get_node(k, y);
  }
  T prod(int xl, int xr, int yl, int yr) const {
    if (xl >= xr || yl >= yr) return M::e();
    int l = lower_bound(xs.begin(), xs.end(), xl) - xs.begin();
    int r = lower_bound(xs.begin(), xs.end(), xr) - xs.begin();
    T sl = M::e(), sr = M::e();
    for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
      if (l & 1) sl = M::op(sl, prod_node(l++, yl, yr));
      if (r & 1) sr = M::op(prod_node(--r, yl, yr), sr);
    }
    return M::op(sl, sr);
  }
  int size_x() const { return n; }
  int size_points() const { return ps.size(); }

 private:
  int n, size;
  vector<pair<int, int>> ps;
  vector<int> xs;
  vector<vector<int>> ys;
  vector<vector<T>> seg;
  int leaf(int x, int y) const {
    auto it = lower_bound(ps.begin(), ps.end(), make_pair(x, y));
    assert(it != ps.end() && *it == make_pair(x, y));
    int k = lower_bound(xs.begin(), xs.end(), x) - xs.begin();
    return k + size;
  }
  int y_index(int k, int y) const {
    int i = lower_bound(ys[k].begin(), ys[k].end(), y) - ys[k].begin();
    assert(i < (int)ys[k].size() && ys[k][i] == y);
    return i;
  }
  void set_node(int k, int y, T v) {
    int m = ys[k].size();
    int i = y_index(k, y) + m;
    seg[k][i] = v;
    while (i >>= 1) seg[k][i] = M::op(seg[k][2 * i], seg[k][2 * i + 1]);
  }
  void apply_node(int k, int y, T v) {
    int m = ys[k].size();
    int i = y_index(k, y) + m;
    seg[k][i] = M::op(seg[k][i], v);
    while (i >>= 1) seg[k][i] = M::op(seg[k][2 * i], seg[k][2 * i + 1]);
  }
  T get_node(int k, int y) const {
    int m = ys[k].size();
    int i = lower_bound(ys[k].begin(), ys[k].end(), y) - ys[k].begin();
    if (i == m || ys[k][i] != y) return M::e();
    return seg[k][i + m];
  }
  T prod_node(int k, int yl, int yr) const {
    int m = ys[k].size();
    int l = lower_bound(ys[k].begin(), ys[k].end(), yl) - ys[k].begin();
    int r = lower_bound(ys[k].begin(), ys[k].end(), yr) - ys[k].begin();
    T sl = M::e(), sr = M::e();
    for (l += m, r += m; l < r; l >>= 1, r >>= 1) {
      if (l & 1) sl = M::op(sl, seg[k][l++]);
      if (r & 1) sr = M::op(seg[k][--r], sr);
    }
    return M::op(sl, sr);
  }
};

/**
 * @brief 2D Segment Tree
 * @docs docs/segment-tree/segment-tree-2d.md
 */
#line 5 "verify/segment-tree/LC_point_add_rectangle_sum.segment_tree_2d.test.cpp"

int main() {
  int n, q;
  in(n, q);
  vector<array<int, 3>> ps(n);
  vector<pair<int, int>> points;
  rep(i, 0, n) {
    int x, y, w;
    in(x, y, w);
    ps[i] = {x, y, w};
    points.push_back({x, y});
  }

  vector<array<int, 5>> qs(q);
  rep(i, 0, q) {
    int t;
    in(t);
    if (t == 0) {
      int x, y, w;
      in(x, y, w);
      qs[i] = {0, x, y, w, 0};
      points.push_back({x, y});
    } else {
      int l, d, r, u;
      in(l, d, r, u);
      qs[i] = {1, l, d, r, u};
    }
  }

  SegmentTree2D<AddMonoid<long long>> seg(points);
  for (auto [x, y, w] : ps) seg.apply(x, y, w);

  for (auto query : qs) {
    if (query[0] == 0) {
      auto [_, x, y, w, __] = query;
      seg.apply(x, y, w);
    } else {
      auto [_, l, d, r, u] = query;
      out(seg.prod(l, r, d, u));
    }
  }
}
Back to top page