test/data-structure/offline-rectangle-sum/yosupo-Point-Add-Rectangle-Sum.test.cpp

• View this file on GitHub
• Last update: 2023-07-11 10:41:16+08:00
• Problem: https://judge.yosupo.jp/problem/point_add_rectangle_sum

Depends on

• library/data-structure/fenwick.hpp
• library/data-structure/offline-rectangle-sum.hpp

Code

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

#include <iostream>
#include "../../../library/data-structure/offline-rectangle-sum.hpp"
using namespace std;
using namespace felix;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	offline_rectangle_sum<int, long long> solver;
	for(int i = 0; i < n; i++) {
		int x, y;
		long long w;
		cin >> x >> y >> w;
		solver.add_point(x, y, w);
	}
	while(q--) {
		int type, x, y;
		cin >> type >> x >> y;
		if(type == 0) {
			long long w;
			cin >> w;
			solver.add_point(x, y, w);
		} else {
			int x2, y2;
			cin >> x2 >> y2;
			solver.add_query(x, y, x2, y2);
		}
	}
	auto ans = solver.solve();
	for(auto x : ans) {
		cout << x << "\n";
	}
	return 0;
}

#line 1 "test/data-structure/offline-rectangle-sum/yosupo-Point-Add-Rectangle-Sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/point_add_rectangle_sum"

#include <iostream>
#line 2 "library/data-structure/offline-rectangle-sum.hpp"
#include <vector>
#include <algorithm>
#line 3 "library/data-structure/fenwick.hpp"
#include <cassert>

namespace felix {

template<class S>
struct fenwick {
public:
	fenwick() : n(0) {}
	explicit fenwick(int _n) : n(_n), data(_n) {}

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

	// [0, p)
	S get(int p) const {
		auto ans = S();
		for(int i = p; i > 0; i -= i & -i) {
			ans += data[i - 1];
		}
		return ans;
	}

	// [l, r)
	S sum(int l, int r) const { return get(r) - get(l); }

	// 0-based
	int kth(S k) const {
		int x = 0;
		for(int i = 1 << std::__lg(n); i > 0; i >>= 1) {
			if (x + i <= n && k >= data[x + i - 1]) {
				x += i;
				k -= data[x - 1];
			}
		}
		return x;
	}

private:
	int n;
	std::vector<S> data;
};

} // namespace felix
#line 5 "library/data-structure/offline-rectangle-sum.hpp"

namespace felix {

template<class T, class Weight_t>
struct offline_rectangle_sum {
	struct op_t {
		T x, y;
		Weight_t w;
		int id;

		op_t() {}
		op_t(T _x, T _y, Weight_t _w, int _id) : x(_x), y(_y), w(_w), id(_id) {}
	};

	void add_point(T x, T y, Weight_t w) {
		queries.emplace_back(x, y, w, -1);
	}

	void add_query(T x, T y, T x2, T y2) {
		queries.emplace_back(x, y, +1, qid);
		queries.emplace_back(x, y2, -1, qid);
		queries.emplace_back(x2, y, -1, qid);
		queries.emplace_back(x2, y2, +1, qid);
		qid++;
	}

	std::vector<Weight_t> solve() {
		std::vector<T> ys;
		for(auto& q : queries) {
			ys.push_back(q.y);
		}
		std::sort(ys.begin(), ys.end());
		ys.erase(std::unique(ys.begin(), ys.end()), ys.end());
		sz = (int) ys.size();
		for(auto& q : queries) {
			q.y = std::lower_bound(ys.begin(), ys.end(), q.y) - ys.begin();
		}
		ans.assign(qid, 0);
		fenw = fenwick<Weight_t>(sz);
		CDQ(0, queries.size());
		return ans;
	}

private:
	int qid = 0, sz;
	std::vector<op_t> queries;
	std::vector<Weight_t> ans;
	fenwick<Weight_t> fenw;

	void CDQ(int l, int r) {
		if(l + 1 == r) {
			return;
		}
		int mid = (l + r) / 2;
		CDQ(l, mid), CDQ(mid, r);
		int i = l;
		for(int j = mid; j < r; j++) {
			const op_t& q = queries[j];
			while(i < mid && queries[i].x >= q.x) {
				if(queries[i].id == -1) {
					fenw.add(queries[i].y, queries[i].w);
				}
				i++;
			}
			if(q.id >= 0) {
				ans[q.id] += q.w * fenw.sum(q.y, sz);
			}
		}
		for(int p = l; p < i; p++) {
			if(queries[p].id == -1) {
				fenw.add(queries[p].y, -queries[p].w);
			}
		}
		std::inplace_merge(queries.begin() + l, queries.begin() + mid, queries.begin() + r, [](const op_t& a, const op_t& b) {
			return a.x > b.x;
		});
	}
};

} // namespace felix
#line 5 "test/data-structure/offline-rectangle-sum/yosupo-Point-Add-Rectangle-Sum.test.cpp"
using namespace std;
using namespace felix;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	offline_rectangle_sum<int, long long> solver;
	for(int i = 0; i < n; i++) {
		int x, y;
		long long w;
		cin >> x >> y >> w;
		solver.add_point(x, y, w);
	}
	while(q--) {
		int type, x, y;
		cin >> type >> x >> y;
		if(type == 0) {
			long long w;
			cin >> w;
			solver.add_point(x, y, w);
		} else {
			int x2, y2;
			cin >> x2 >> y2;
			solver.add_query(x, y, x2, y2);
		}
	}
	auto ans = solver.solve();
	for(auto x : ans) {
		cout << x << "\n";
	}
	return 0;
}

Back to top page