firiexp's Library
This documentation is automatically generated by online-judge-tools/verification-helper
test/yosupo_static_rectangle_sum.test.cpp
- View this file on GitHub
- Last update: 2026-03-22 13:47:31+09:00
- Problem: https://judge.yosupo.jp/problem/rectangle_sum
Depends on
- Binary Indexed Tree(BIT)
(datastructure/binaryindexedtree.cpp)
- 静的長方形和(Static Rectangle Sum)
(datastructure/static_rectangle_sum.cpp)
- 高速入出力(Fast IO)
(util/fastio.cpp)
Code
#define PROBLEM "https://judge.yosupo.jp/problem/rectangle_sum"
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>
#include "../util/fastio.cpp"
#include "../datastructure/static_rectangle_sum.cpp"
int main() {
Scanner sc;
Printer pr;
int n, q;
sc.read(n, q);
StaticRectangleSum<long long> solver;
for (int i = 0; i < n; ++i) {
int x, y;
long long w;
sc.read(x, y, w);
solver.add_point(x, y, w);
}
for (int i = 0; i < q; ++i) {
int l, d, r, u;
sc.read(l, d, r, u);
solver.add_query(l, d, r, u);
}
auto ans = solver.solve();
for (auto x : ans) pr.println(x);
return 0;
}#line 1 "test/yosupo_static_rectangle_sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/rectangle_sum"
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>
#line 1 "util/fastio.cpp"
using namespace std;
extern "C" int fileno(FILE *);
extern "C" int isatty(int);
template<class T, class = void>
struct is_fastio_range : false_type {};
template<class T>
struct is_fastio_range<T, void_t<decltype(declval<T &>().begin()), decltype(declval<T &>().end())>> : true_type {};
template<class T, class = void>
struct has_fastio_value : false_type {};
template<class T>
struct has_fastio_value<T, void_t<decltype(declval<const T &>().value())>> : true_type {};
struct FastIoDigitTable {
char num[40000];
constexpr FastIoDigitTable() : num() {
for (int i = 0; i < 10000; ++i) {
int x = i;
for (int j = 3; j >= 0; --j) {
num[i * 4 + j] = char('0' + x % 10);
x /= 10;
}
}
}
};
struct Scanner {
static constexpr int BUFSIZE = 1 << 17;
static constexpr int OFFSET = 64;
char buf[BUFSIZE + 1];
int idx, size;
bool interactive;
Scanner() : idx(0), size(0), interactive(isatty(fileno(stdin))) {}
inline void load() {
int len = size - idx;
memmove(buf, buf + idx, len);
if (interactive) {
if (fgets(buf + len, BUFSIZE + 1 - len, stdin)) size = len + (int)strlen(buf + len);
else size = len;
} else {
size = len + (int)fread(buf + len, 1, BUFSIZE - len, stdin);
}
idx = 0;
buf[size] = 0;
}
inline void ensure() {
if (idx + OFFSET > size) load();
}
inline void ensure_interactive() {
if (idx == size) load();
}
inline char skip() {
if (interactive) {
ensure_interactive();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure_interactive();
}
return buf[idx++];
}
ensure();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure();
}
return buf[idx++];
}
template<class T, typename enable_if<is_integral<T>::value, int>::type = 0>
void read(T &x) {
if (interactive) {
char c = skip();
bool neg = false;
if constexpr (is_signed<T>::value) {
if (c == '-') {
neg = true;
ensure_interactive();
c = buf[idx++];
}
}
x = 0;
while (c >= '0') {
x = x * 10 + (c & 15);
ensure_interactive();
c = buf[idx++];
}
if constexpr (is_signed<T>::value) {
if (neg) x = -x;
}
return;
}
char c = skip();
bool neg = false;
if constexpr (is_signed<T>::value) {
if (c == '-') {
neg = true;
c = buf[idx++];
}
}
x = 0;
while (c >= '0') {
x = x * 10 + (c & 15);
c = buf[idx++];
}
if constexpr (is_signed<T>::value) {
if (neg) x = -x;
}
}
template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
void read(T &x) {
long long v;
read(v);
x = T(v);
}
template<class Head, class Next, class... Tail>
void read(Head &head, Next &next, Tail &...tail) {
read(head);
read(next, tail...);
}
template<class T, class U>
void read(pair<T, U> &p) {
read(p.first, p.second);
}
template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
void read(T &a) {
for (auto &x : a) read(x);
}
void read(char &c) {
c = skip();
}
void read(string &s) {
s.clear();
if (interactive) {
ensure_interactive();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure_interactive();
}
while (true) {
int start = idx;
while (idx < size && buf[idx] > ' ') ++idx;
s.append(buf + start, idx - start);
if (idx < size) break;
load();
if (size == 0) break;
}
if (idx < size) ++idx;
return;
}
ensure();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure();
}
while (true) {
int start = idx;
while (idx < size && buf[idx] > ' ') ++idx;
s.append(buf + start, idx - start);
if (idx < size) break;
load();
}
if (idx < size) ++idx;
}
};
struct Printer {
static constexpr int BUFSIZE = 1 << 17;
static constexpr int OFFSET = 64;
char buf[BUFSIZE];
int idx;
bool interactive;
inline static constexpr FastIoDigitTable table{};
Printer() : idx(0), interactive(isatty(fileno(stdout))) {}
~Printer() { flush(); }
inline void flush() {
if (idx) {
fwrite(buf, 1, idx, stdout);
idx = 0;
}
}
inline void pc(char c) {
if (idx > BUFSIZE - OFFSET) flush();
buf[idx++] = c;
if (interactive && c == '\n') flush();
}
inline void print_range(const char *s, size_t n) {
size_t pos = 0;
while (pos < n) {
if (idx == BUFSIZE) flush();
size_t chunk = min(n - pos, (size_t)(BUFSIZE - idx));
memcpy(buf + idx, s + pos, chunk);
idx += (int)chunk;
pos += chunk;
}
}
void print(const char *s) {
print_range(s, strlen(s));
}
void print(const string &s) {
print_range(s.data(), s.size());
}
void print(char c) {
pc(c);
}
void print(bool b) {
pc(char('0' + (b ? 1 : 0)));
}
template<class T, typename enable_if<is_integral<T>::value && !is_same<T, bool>::value, int>::type = 0>
void print(T x) {
if (idx > BUFSIZE - 100) flush();
using U = typename make_unsigned<T>::type;
U y;
if constexpr (is_signed<T>::value) {
if (x < 0) {
buf[idx++] = '-';
y = U(0) - static_cast<U>(x);
} else {
y = static_cast<U>(x);
}
} else {
y = x;
}
if (y == 0) {
buf[idx++] = '0';
return;
}
static constexpr int TMP_SIZE = sizeof(U) * 10 / 4;
char tmp[TMP_SIZE];
int pos = TMP_SIZE;
while (y >= 10000) {
pos -= 4;
memcpy(tmp + pos, table.num + (y % 10000) * 4, 4);
y /= 10000;
}
if (y >= 1000) {
memcpy(buf + idx, table.num + (y << 2), 4);
idx += 4;
} else if (y >= 100) {
memcpy(buf + idx, table.num + (y << 2) + 1, 3);
idx += 3;
} else if (y >= 10) {
unsigned q = (unsigned(y) * 205) >> 11;
buf[idx] = char('0' + q);
buf[idx + 1] = char('0' + (unsigned(y) - q * 10));
idx += 2;
} else {
buf[idx++] = char('0' + y);
}
memcpy(buf + idx, tmp + pos, TMP_SIZE - pos);
idx += TMP_SIZE - pos;
}
template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
void print(const T &x) {
print(x.value());
}
template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
void print(const T &a) {
bool first = true;
for (auto &&x : a) {
if (!first) pc(' ');
first = false;
print(x);
}
}
template<class T>
void println(const T &x) {
print(x);
pc('\n');
}
template<class Head, class... Tail>
void println(const Head &head, const Tail &...tail) {
print(head);
((pc(' '), print(tail)), ...);
pc('\n');
}
void println() {
pc('\n');
}
};
template<class T>
Scanner &operator>>(Scanner &in, T &x) {
in.read(x);
return in;
}
template<class T>
Printer &operator<<(Printer &out, const T &x) {
out.print(x);
return out;
}
/**
* @brief 高速入出力(Fast IO)
*/
#line 1 "datastructure/static_rectangle_sum.cpp"
using namespace std;
#line 1 "datastructure/binaryindexedtree.cpp"
template<class T>
class BIT {
vector<T> bit;
int m, n;
public:
BIT(int n): bit(n), m(1), n(n) {
while (m < n) m <<= 1;
}
T sum(int k){
T ret = 0;
for (; k > 0; k -= (k & -k)) ret += bit[k - 1];
return ret;
}
void add(int k, T x){
for (k++; k <= n; k += (k & -k)) bit[k - 1] += x;
}
int lower_bound(T x) {
if (x <= 0) return 0;
int i = 0;
for (int j = m; j; j >>= 1) {
if (i + j <= n && bit[i + j - 1] < x) x -= bit[i + j - 1], i += j;
}
return min(i + 1, n);
}
};
/**
* @brief Binary Indexed Tree(BIT)
*/
#line 4 "datastructure/static_rectangle_sum.cpp"
template<class T>
struct StaticRectangleSum {
struct Point {
int x, y;
T w;
};
struct Event {
int x, d, u, id, sign;
bool operator<(const Event& other) const {
return x < other.x;
}
};
vector<Point> points;
vector<Event> events;
vector<int> ys;
void add_point(int x, int y, T w) {
points.push_back({x, y, w});
ys.push_back(y);
}
void add_query(int l, int d, int r, int u) {
int id = (int)events.size() / 2;
events.push_back({r, d, u, id, 1});
events.push_back({l, d, u, id, -1});
ys.push_back(d);
ys.push_back(u);
}
vector<T> solve() {
vector<int> ord_y = ys;
sort(ord_y.begin(), ord_y.end());
ord_y.erase(unique(ord_y.begin(), ord_y.end()), ord_y.end());
auto get_y = [&](int y) {
return (int)(lower_bound(ord_y.begin(), ord_y.end(), y) - ord_y.begin());
};
vector<Point> ps = points;
for (auto& p : ps) p.y = get_y(p.y);
for (auto& e : events) {
e.d = get_y(e.d);
e.u = get_y(e.u);
}
sort(ps.begin(), ps.end(), [](const Point& a, const Point& b) {
return a.x < b.x;
});
sort(events.begin(), events.end());
int q = (int)events.size() / 2;
vector<T> ans(q, 0);
BIT<T> bit((int)ord_y.size());
int i = 0;
for (auto e : events) {
while (i < (int)ps.size() && ps[i].x < e.x) {
bit.add(ps[i].y, ps[i].w);
++i;
}
ans[e.id] += (bit.sum(e.u) - bit.sum(e.d)) * e.sign;
}
return ans;
}
};
/**
* @brief 静的長方形和(Static Rectangle Sum)
*/
#line 13 "test/yosupo_static_rectangle_sum.test.cpp"
int main() {
Scanner sc;
Printer pr;
int n, q;
sc.read(n, q);
StaticRectangleSum<long long> solver;
for (int i = 0; i < n; ++i) {
int x, y;
long long w;
sc.read(x, y, w);
solver.add_point(x, y, w);
}
for (int i = 0; i < q; ++i) {
int l, d, r, u;
sc.read(l, d, r, u);
solver.add_query(l, d, r, u);
}
auto ans = solver.solve();
for (auto x : ans) pr.println(x);
return 0;
}