data_structure/test/point_add_rectangle_sum.test.cpp

View this file on GitHub
Last update: 2022-08-25 19:52:54+09:00
Problem: https://judge.yosupo.jp/problem/point_add_rectangle_sum

Depends on

Code

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

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

int main() {
    i32 n, q;
    cin >> n >> q;
    Vec<i32> x(n), y(n), w(n);
    REP(i, n) {
        cin >> x[i] >> y[i] >> w[i];
    }
    Vec<tuple<i32, i32, i32, i32, i32>> queries(q);
    for (auto &[type, a, b, c, d] : queries) {
        cin >> type;
        if (type == 0) {
            cin >> a >> b >> c;
            d = 0;
        } else {
            cin >> a >> b >> c >> d;
        }
    }
    i32 pct = n;
    for (const auto &[type, _a, _b, _c, _d] : queries) {
        if (type == 0) {
            ++pct;
        }
    }
    Vec<pair<i32, i32>> pts;
    pts.reserve(pct);
    REP(i, n) {
        pts.emplace_back(x[i], y[i]);
    }
    for (const auto &[type, a, b, c, d] : queries) {
        if (type == 0) {
            pts.emplace_back(a, b);
        }
    }
    GRangeTree rt(pts);
    Vec<Vec<i32>> upd_pct(pct - n);
    REP(i, rt.size()) {
        if (rt[i] >= n) {
            upd_pct[rt[i] - n].push_back(i);
        }
    }
    FenwickTree<Add<i64>> ft(rt.size());
    REP(i, rt.size()) {
        if (rt[i] < n) {
            ft.add(i, w[rt[i]]);
        }
    }
    i32 it = 0;
    for (const auto &[type, a, b, c, d] : queries) {
        if (type == 0) {
            for (i32 upd : upd_pct[it++]) {
                ft.add(upd, c);
            }
        } else {
            i64 ans = 0;
            for (auto [l, r] : rt.rectangle(a, c, b, d)) {
                ans += ft.sum(l, r);
            }
            cout << ans << '\n';
        }
    }
}

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

#line 1 "template/template.hpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

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

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
#line 2 "data_structure/general_range_tree.hpp"

#line 6 "data_structure/general_range_tree.hpp"

template <typename T>
class GRangeTree {
    std::vector<T> xs;
    std::vector<std::pair<T, int>> arr;
    std::vector<int> rngs;
    
    static bool compare_by_first(const std::pair<T, int> &p0, const std::pair<T, int> &p1) {
        return p0.first < p1.first;
    }
    
public:
    GRangeTree(const std::vector<std::pair<T, T>> &pts) : xs(), arr(), rngs() {
        xs.reserve(pts.size());
        for (const auto &[x, _y] : pts) {
            xs.push_back(x);
        }
        std::sort(xs.begin(), xs.end());
        xs.erase(std::unique(xs.begin(), xs.end()), xs.end());
        int xs_sz = (int) xs.size();
        std::vector<std::vector<std::pair<T, int>>> nodes(2 * xs_sz);
        for (int i = 0; i < (int) pts.size(); ++i) {
            int xi = (int) (std::lower_bound(xs.begin(), xs.end(), pts[i].first) - xs.begin());
            nodes[xs_sz + xi].emplace_back(pts[i].second, i);
        }
        for (int i = xs_sz; i < 2 * xs_sz; ++i) {
            std::sort(nodes[i].begin(), nodes[i].end(), compare_by_first);
        }
        for (int i = xs_sz - 1; i > 0; --i) {
            nodes[i].reserve(nodes[2 * i].size() + nodes[2 * i + 1].size());
            std::merge(
                nodes[2 * i].begin(), nodes[2 * i].end(),
                nodes[2 * i + 1].begin(), nodes[2 * i + 1].end(),
                std::back_inserter(nodes[i]),
                compare_by_first
            );
        }
        int tot = 0;
        for (int i = 1; i < 2 * xs_sz; ++i) {
            tot += (int) nodes[i].size();
        }
        arr.reserve(tot);
        for (int i = 1; i < 2 * xs_sz; ++i) {
            for (auto ele : nodes[i]) {
                arr.emplace_back(ele);
            }
        }
        rngs.resize(2 * xs_sz, 0);
        for (int i = 1; i < 2 * xs_sz; ++i) {
            rngs[i] = rngs[i - 1] + (int) nodes[i].size();
        }
    }
    
    int size() const {
        return (int) arr.size();
    }
    int operator[](int i) const {
        return arr[i].second;
    }
    
    // [xl, xr), [yl, yr)
    std::vector<std::pair<int, int>> rectangle(T xl, T xr, T yl, T yr) const {
        int xli = (int) (std::lower_bound(xs.begin(), xs.end(), xl) - xs.begin());
        int xri = (int) (std::lower_bound(xs.begin(), xs.end(), xr) - xs.begin());
        std::vector<std::pair<int, int>> ret;
        xli += (int) xs.size();
        xri += (int) xs.size();
        while (xli < xri) {
            if (xli % 2 == 1) {
                int l = rngs[xli - 1];
                int r = rngs[xli];
                ret.emplace_back(
                    (int) (
                        std::lower_bound(arr.begin() + l, arr.begin() + r, std::pair<T, int>(yl, 0), compare_by_first)
                        - arr.begin()
                    ),
                    (int) (
                        std::lower_bound(arr.begin() + l, arr.begin() + r, std::pair<T, int>(yr, 0), compare_by_first)
                        - arr.begin()
                    )
                );
                ++xli;
            }
            if (xri % 2 == 1) {
                --xri;
                int l = rngs[xri - 1];
                int r = rngs[xri];
                ret.emplace_back(
                    (int) (
                        std::lower_bound(arr.begin() + l, arr.begin() + r, std::pair<T, int>(yl, 0), compare_by_first)
                        - arr.begin()
                    ),
                    (int) (
                        std::lower_bound(arr.begin() + l, arr.begin() + r, std::pair<T, int>(yr, 0), compare_by_first)
                        - arr.begin()
                    )
                );
            }
            xli /= 2;
            xri /= 2;
        }
        return ret;
    }
};
#line 2 "data_structure/fenwick_tree.hpp"

#line 5 "data_structure/fenwick_tree.hpp"

#line 2 "data_structure/operations.hpp"

#include <limits>
#line 5 "data_structure/operations.hpp"

template <typename T>
struct Add {
    using Value = T;
    static Value id() {
        return T(0);
    }
    static Value op(const Value &lhs, const Value &rhs) {
        return lhs + rhs;
    }
    static Value inv(const Value &x) {
        return -x;
    }
};

template <typename T>
struct Mul {
    using Value = T;
    static Value id() {
        return Value(1);
    }
    static Value op(const Value &lhs, const Value &rhs) {
        return lhs * rhs;
    }
    static Value inv(const Value &x) {
        return Value(1) / x;
    }
};

template <typename T>
struct Min {
    using Value = T;
    static Value id() {
        return std::numeric_limits<T>::max();
    }
    static Value op(const Value &lhs, const Value &rhs) {
        return std::min(lhs, rhs);
    }
};

template <typename T>
struct Max {
    using Value = T;
    static Value id() {
        return std::numeric_limits<Value>::min();
    }
    static Value op(const Value &lhs, const Value &rhs) {
        return std::max(lhs, rhs);
    }
};

template <typename T>
struct Xor {
    using Value = T;
    static Value id() {
        return T(0);
    }
    static Value op(const Value &lhs, const Value &rhs) {
        return lhs ^ rhs;
    }
    static Value inv(const Value &x) {
        return x;
    }
};

template <typename Monoid>
struct Reversible {
    using Value = std::pair<typename Monoid::Value, typename Monoid::Value>;
    static Value id() {
        return Value(Monoid::id(), Monoid::id());
    }
    static Value op(const Value &v1, const Value &v2) {
        return Value(
            Monoid::op(v1.first, v2.first),
            Monoid::op(v2.second, v1.second));
    }
};

#line 7 "data_structure/fenwick_tree.hpp"

template <typename CommutativeGroup>
class FenwickTree {
public:
    using Value = typename CommutativeGroup::Value;

private:
    std::vector<Value> data;

public:
    FenwickTree(int n) : data(n, CommutativeGroup::id()) {}

    void add(int idx, const Value &x) {
        assert(idx >= 0 && idx < (int) data.size());
        for (; idx < (int) data.size(); idx |= idx + 1) {
            data[idx] = CommutativeGroup::op(data[idx], x);
        }
    }

    Value sum(int r) const {
        assert(r >= 0 && r <= (int) data.size());
        Value ret = CommutativeGroup::id();
        for (; r > 0; r &= r - 1) {
            ret = CommutativeGroup::op(ret, data[r - 1]);
        }
        return ret;
    }

    Value sum(int l, int r) const {
        assert(l >= 0 && l <= r && r <= (int) data.size());
        return CommutativeGroup::op(sum(r), CommutativeGroup::inv(sum(l)));
    }
};

template <typename T>
using FenwickTreeAdd = FenwickTree<Add<T>>;
#line 6 "data_structure/test/point_add_rectangle_sum.test.cpp"

int main() {
    i32 n, q;
    cin >> n >> q;
    Vec<i32> x(n), y(n), w(n);
    REP(i, n) {
        cin >> x[i] >> y[i] >> w[i];
    }
    Vec<tuple<i32, i32, i32, i32, i32>> queries(q);
    for (auto &[type, a, b, c, d] : queries) {
        cin >> type;
        if (type == 0) {
            cin >> a >> b >> c;
            d = 0;
        } else {
            cin >> a >> b >> c >> d;
        }
    }
    i32 pct = n;
    for (const auto &[type, _a, _b, _c, _d] : queries) {
        if (type == 0) {
            ++pct;
        }
    }
    Vec<pair<i32, i32>> pts;
    pts.reserve(pct);
    REP(i, n) {
        pts.emplace_back(x[i], y[i]);
    }
    for (const auto &[type, a, b, c, d] : queries) {
        if (type == 0) {
            pts.emplace_back(a, b);
        }
    }
    GRangeTree rt(pts);
    Vec<Vec<i32>> upd_pct(pct - n);
    REP(i, rt.size()) {
        if (rt[i] >= n) {
            upd_pct[rt[i] - n].push_back(i);
        }
    }
    FenwickTree<Add<i64>> ft(rt.size());
    REP(i, rt.size()) {
        if (rt[i] < n) {
            ft.add(i, w[rt[i]]);
        }
    }
    i32 it = 0;
    for (const auto &[type, a, b, c, d] : queries) {
        if (type == 0) {
            for (i32 upd : upd_pct[it++]) {
                ft.add(upd, c);
            }
        } else {
            i64 ans = 0;
            for (auto [l, r] : rt.rectangle(a, c, b, d)) {
                ans += ft.sum(l, r);
            }
            cout << ans << '\n';
        }
    }
}