sotanishy's code snippets for competitive programming
View the Project on GitHub sotanishy/cp-library-cpp
#define PROBLEM "https://judge.yosupo.jp/problem/rectangle_add_point_get" #include <bits/stdc++.h> #include "../../data-structure/segtree/dual_segment_tree_2d.hpp" using namespace std; using ll = long long; struct AddMonoid { using T = ll; static T id() { return 0; } static T op(T a, T b) { return a + b; } }; struct Query { int t, x, y, l, d, r, u, w; Query(int t, int l, int d, int r, int u, int w) : t(t), l(l), d(d), r(r), u(u), w(w) {} Query(int t, int x, int y) : t(t), x(x), y(y) {} }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int N, Q; cin >> N >> Q; vector<int> l(N), d(N), r(N), u(N), w(N); for (int i = 0; i < N; ++i) { cin >> l[i] >> d[i] >> r[i] >> u[i] >> w[i]; } vector<pair<int, int>> pts; vector<Query> queries; for (int i = 0; i < Q; ++i) { int t; cin >> t; if (t == 0) { int l, d, r, u, w; cin >> l >> d >> r >> u >> w; queries.emplace_back(t, l, d, r, u, w); } else { int x, y; cin >> x >> y; pts.push_back({x, y}); queries.emplace_back(t, x, y); } } DualSegmentTree2D<int, int, AddMonoid> st(pts); for (int i = 0; i < N; ++i) { st.update(l[i], r[i], d[i], u[i], w[i]); } for (auto& q : queries) { if (q.t == 0) { st.update(q.l, q.r, q.d, q.u, q.w); } else { cout << st.get(q.x, q.y) << "\n"; } } }
#line 1 "test/yosupo/rectangle_add_point_get.2d_dual_segtree.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/rectangle_add_point_get" #include <bits/stdc++.h> #line 3 "data-structure/segtree/dual_segment_tree_2d.hpp" #include <bit> #line 7 "data-structure/segtree/dual_segment_tree_2d.hpp" #line 4 "data-structure/segtree/dual_segment_tree.hpp" template <typename M> class DualSegmentTree { using T = typename M::T; public: DualSegmentTree() = default; explicit DualSegmentTree(int n) : size(std::bit_ceil((unsigned int)n)), height(std::bit_width((unsigned int)size) - 1), lazy(2 * size, M::id()) {} T operator[](int k) { k += size; propagate(k); return lazy[k]; } void update(int l, int r, const T& x) { if (l >= r) return; l += size; r += size; propagate(l); propagate(r - 1); for (; l < r; l >>= 1, r >>= 1) { if (l & 1) lazy[l] = M::op(lazy[l], x), ++l; if (r & 1) --r, lazy[r] = M::op(lazy[r], x); } } private: int size, height; std::vector<T> lazy; void push(int k) { if (lazy[k] == M::id()) return; lazy[2 * k] = M::op(lazy[2 * k], lazy[k]); lazy[2 * k + 1] = M::op(lazy[2 * k + 1], lazy[k]); lazy[k] = M::id(); } void propagate(int k) { for (int i = height; i > 0; --i) push(k >> i); } }; #line 9 "data-structure/segtree/dual_segment_tree_2d.hpp" /** * @brief 2D Dual Segment Tree */ template <typename X, typename Y, typename M> class DualSegmentTree2D { using T = M::T; public: DualSegmentTree2D() = default; explicit DualSegmentTree2D(const std::vector<std::pair<X, Y>>& pts) { for (auto& [x, y] : pts) { xs.push_back(x); } std::ranges::sort(xs); xs.erase(std::ranges::unique(xs).begin(), xs.end()); const int n = xs.size(); size = std::bit_ceil((unsigned int)n); ys.resize(2 * size); seg.resize(2 * size); for (auto& [x, y] : pts) { ys[size + getx(x)].push_back(y); } for (int i = size + n - 1; i > 0; --i) { if (i >= size) { std::ranges::sort(ys[i]); } else { std::ranges::merge(ys[2 * i], ys[2 * i + 1], std::back_inserter(ys[i])); } ys[i].erase(std::ranges::unique(ys[i]).begin(), ys[i].end()); } for (int i = 1; i < size + n; ++i) { seg[i] = DualSegmentTree<M>(ys[i].size()); } } T get(X x, Y y) { int kx = getx(x); assert(kx < (int)xs.size() && xs[kx] == x); T ret = M::id(); for (kx += size; kx > 0; kx >>= 1) { int ky = gety(kx, y); assert(ky < (int)ys[kx].size() && ys[kx][ky] == y); ret = M::op(ret, seg[kx][ky]); } return ret; } void update(X sx, X tx, Y sy, Y ty, T val) { for (int l = size + getx(sx), r = size + getx(tx); l < r; l >>= 1, r >>= 1) { if (l & 1) { seg[l].update(gety(l, sy), gety(l, ty), val); ++l; } if (r & 1) { --r; seg[r].update(gety(r, sy), gety(r, ty), val); } } } private: int size; std::vector<X> xs; std::vector<std::vector<Y>> ys; std::vector<DualSegmentTree<M>> seg; int getx(X x) const { return std::ranges::lower_bound(xs, x) - xs.begin(); } int gety(int k, Y y) const { return std::ranges::lower_bound(ys[k], y) - ys[k].begin(); } }; #line 6 "test/yosupo/rectangle_add_point_get.2d_dual_segtree.test.cpp" using namespace std; using ll = long long; struct AddMonoid { using T = ll; static T id() { return 0; } static T op(T a, T b) { return a + b; } }; struct Query { int t, x, y, l, d, r, u, w; Query(int t, int l, int d, int r, int u, int w) : t(t), l(l), d(d), r(r), u(u), w(w) {} Query(int t, int x, int y) : t(t), x(x), y(y) {} }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int N, Q; cin >> N >> Q; vector<int> l(N), d(N), r(N), u(N), w(N); for (int i = 0; i < N; ++i) { cin >> l[i] >> d[i] >> r[i] >> u[i] >> w[i]; } vector<pair<int, int>> pts; vector<Query> queries; for (int i = 0; i < Q; ++i) { int t; cin >> t; if (t == 0) { int l, d, r, u, w; cin >> l >> d >> r >> u >> w; queries.emplace_back(t, l, d, r, u, w); } else { int x, y; cin >> x >> y; pts.push_back({x, y}); queries.emplace_back(t, x, y); } } DualSegmentTree2D<int, int, AddMonoid> st(pts); for (int i = 0; i < N; ++i) { st.update(l[i], r[i], d[i], u[i], w[i]); } for (auto& q : queries) { if (q.t == 0) { st.update(q.l, q.r, q.d, q.u, q.w); } else { cout << st.get(q.x, q.y) << "\n"; } } }