test/rectangle_sum.test.cpp

View this file on GitHub
Last update: 2024-08-04 01:36:11+08:00
Problem: https://judge.yosupo.jp/problem/rectangle_sum

Depends on

Code

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

#include "../default/t.cpp"
#include "../ds/fenwickTree.cpp"
#include "../misc/compression.cpp"
#include "../ds_problem/rectangleSum.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, q; cin >> n >> q;
  vector<tuple<int, int, ll>> pts(n);
  for(auto &[x, y, w] : pts)
    cin >> x >> y >> w;
  vector<array<int, 4>> query(q);
  for(auto &[l, d, r, u] : query)
    cin >> l >> r >> d >> u;

  for(ll ans : rectangleSum(pts, query))
    cout << ans << '\n';

  return 0;
}

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

#line 1 "default/t.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

using namespace std;

template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(size_t i = 0; T x : arr) {
    os << x;
    if (++i != N) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(size_t i = 0; T x : vec) {
    os << x;
    if (++i != size(vec)) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(size_t i = 0; T x : s) {
    os << x;
    if (++i != size(s)) os << ' ';
  }
  return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2> &m) {
  for(size_t i = 0; pair<T1, T2> x : m) {
    os << x;
    if (++i != size(m)) os << ' ';
  }
  return os;
}

#ifdef DEBUG
#define dbg(...) cerr << '(', _do(#__VA_ARGS__), cerr << ") = ", _do2(__VA_ARGS__)
template<typename T> void _do(T &&x) { cerr << x; }
template<typename T, typename ...S> void _do(T &&x, S&&...y) { cerr << x << ", "; _do(y...); }
template<typename T> void _do2(T &&x) { cerr << x << endl; }
template<typename T, typename ...S> void _do2(T &&x, S&&...y) { cerr << x << ", "; _do2(y...); }
#else
#define dbg(...)
#endif

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_heap = priority_queue<T>;

template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP = plus<T>>
void pSum(rng &v) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = OP()(p, x);
}
template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP>
void pSum(rng &v, OP op) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = op(p, x);
}

template<ranges::forward_range rng>
void Unique(rng &v) {
  ranges::sort(v);
  v.resize(unique(v.begin(), v.end()) - v.begin());
}

template<ranges::random_access_range rng>
rng invPerm(rng p) {
  rng ret = p;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = i;
  return ret;
}

template<ranges::random_access_range rng, ranges::random_access_range rng2>
rng Permute(rng v, rng2 p) {
  rng ret = v;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = v[i];
  return ret;
}

template<bool directed>
vector<vector<int>> readGraph(int n, int m, int base) {
  vector<vector<int>> g(n);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    u -= base, v -= base;
    g[u].emplace_back(v);
    if constexpr (!directed)
      g[v].emplace_back(u);
  }
  return g;
}

template<class T>
void setBit(T &msk, int bit, bool x) {
  msk = (msk & ~(T(1) << bit)) | (T(x) << bit);
}
template<class T> void flipBit(T &msk, int bit) { msk ^= T(1) << bit; }
template<class T> bool getBit(T msk, int bit) { return msk >> bit & T(1); }

template<class T>
T floorDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? a / b : (a - b + 1) / b;
}
template<class T>
T ceilDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? (a + b - 1) / b : a / b;
}

template<class T> bool chmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template<class T> bool chmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
#line 1 "ds/fenwickTree.cpp"
template<class T>
struct fenwickTree {
  const int size;
  vector<T> data;

  fenwickTree(int _size) : size(_size + 1), data(_size + 1) {}
  fenwickTree(vector<T> &init) : size(ssize(init) + 1), data(ssize(init) + 1) {
    partial_sum(init.begin(), init.end(), data.begin() + 1);
    for(int i = size - 1; i > 0; i--)
      data[i] -= data[i - (i & (-i))];
  }

  void add(int i, T d) {
    for(i += 1; i < size; i += i & (-i))
      data[i] += d;
  }

  T query(int i) {
    T res = T(0);
    for(i += 1; i > 0; i -= i & (-i))
      res += data[i];
    return res;
  }

  T query(int l, int r) { //query [l, r)
    return query(r - 1) - query(l - 1);
  }
};
#line 1 "misc/compression.cpp"
template<class T, bool duplicate = false>
struct compression {
  vector<int> ord;
  vector<T> val;

  compression(vector<T> &init) : val(init) { precompute(); }
  compression(int size = 0) { val.reserve(size); }

  void precompute() {
    vector<T> init = val;
    ord.resize(ssize(val));
    ranges::sort(val);
    if constexpr (duplicate) {
      vector<int> cnt(ssize(init));
      iota(cnt.begin(), cnt.end(), 0);
      for(int i = 0; i < ssize(ord); i++)
        ord[i] = cnt[lower_bound(init[i])]++;
    } else {
      val.resize(unique(val.begin(), val.end()) - val.begin());
      for(int i = 0; i < ssize(ord); i++)
        ord[i] = lower_bound(init[i]);
    }
  }

  int lower_bound(T x) { return ranges::lower_bound(val, x) - val.begin(); }
  int size() { return ssize(val); }
  template<ranges::range rng, class proj = identity>
  void mapping(rng &v, proj p = {}) { for(auto &x : v) p(x) = lower_bound(p(x)); }
  template<ranges::range rng, class proj = identity>
  void insert(rng &v, proj p = {}) { for(auto &x : v) val.emplace_back(p(x)); }
};
#line 1 "ds_problem/rectangleSum.cpp"
//#include<ds/fenwickTree.cpp>
//#include<misc/compression.cpp>

template<class T1, class T2>
vector<T2> rectangleSum(vector<tuple<T1, T1, T2>> pt, vector<array<T1, 4>> query) {
  compression<T1> ys(ssize(pt));
  ys.insert(pt, [](auto &x) { return get<1>(x); });
  ys.precompute();
  ys.mapping(pt, [](auto &x) -> T1& { return get<1>(x); });
  ys.mapping(query, [](auto &x) -> T1& { return x[2]; });
  ys.mapping(query, [](auto &x) -> T1& { return x[3]; });

  ranges::sort(pt, less<T1>{}, [](auto x) { return get<0>(x); });

  vector<tuple<T1, int, int>> qry;
  qry.reserve(2 * ssize(query));
  for(int i = 0; i < ssize(query); i++) {
    qry.emplace_back(query[i][0] - 1, -1, i);
    qry.emplace_back(query[i][1] - 1, 1, i);
  }
  ranges::sort(qry, {}, [](auto &x) { return get<0>(x); });

  fenwickTree<T2> bit(ys.size());
  vector<T2> ans(ssize(query));
  for(int ptr = 0; auto [x, r, i] : qry) {
    while(ptr < ssize(pt) and get<0>(pt[ptr]) <= x) {
      auto [_, y, w] = pt[ptr++];
      bit.add(y, w);
    }
    ans[i] += r * bit.query(query[i][2], query[i][3]);
  }

  return ans;
}
#line 7 "test/rectangle_sum.test.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, q; cin >> n >> q;
  vector<tuple<int, int, ll>> pts(n);
  for(auto &[x, y, w] : pts)
    cin >> x >> y >> w;
  vector<array<int, 4>> query(q);
  for(auto &[l, d, r, u] : query)
    cin >> l >> r >> d >> u;

  for(ll ans : rectangleSum(pts, query))
    cout << ans << '\n';

  return 0;
}