Luzhiled's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub ei1333/library

:heavy_check_mark: test/verify/yosupo-rectangle-sum-2.test.cpp

Depends on

Code

// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/rectangle_sum
// clang-format on

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <limits>
#include <tuple>
#include <utility>
#include <vector>

#include "../../other/printer.hpp"
#include "../../other/scanner.hpp"
#include "../../other/static-point-add-rectangle-sum.hpp"

using namespace std;

int main() {
  int N, Q;
  Scanner in(stdin);
  Printer out(stdout);
  in.read(N, Q);
  StaticPointAddRectangleSum<int, long long> spars;
  for (int i = 0; i < N; i++) {
    int x, y, z;
    in.read(x, y, z);
    spars.add_point(x, y, z);
  }
  vector<tuple<int, int, int, int> > query;
  query.reserve(Q);
  for (int i = 0; i < Q; i++) {
    int l, d, r, u;
    in.read(l, d, r, u);
    spars.add_query(l, d, r, u);
  }
  for (auto&& ans : spars.calculate_queries()) {
    out.writeln(ans);
  }
}

#line 1 "test/verify/yosupo-rectangle-sum-2.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/rectangle_sum
// clang-format on

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <limits>
#include <tuple>
#include <utility>
#include <vector>

#line 2 "other/printer.hpp"

#include <charconv>
#include <cstddef>
#line 6 "other/printer.hpp"
#include <string>
#include <type_traits>
#line 9 "other/printer.hpp"

/**
 * @brief Printer(高速出力)
 */
struct Printer {
 public:
  explicit Printer(FILE* fp) : fp(fp) {}

  ~Printer() { flush(); }

  template <bool f = false, typename T, typename... E>
  void write(const T& t, const E&... e) {
    if (f) write_single(' ');
    write_single(t);
    write<true>(e...);
  }

  template <typename... T>
  void writeln(const T&... t) {
    write(t...);
    write_single('\n');
  }

  void flush() {
    fwrite(line, 1, st - line, fp);
    st = line;
  }

 private:
  FILE* fp = nullptr;
  static constexpr std::size_t line_size = 1 << 16;
  static constexpr std::size_t int_digits = 20;
  char line[line_size + 1] = {};
  char* st = line;

  template <bool f = false>
  void write() {}

  void write_single(const char& t) {
    if (st + 1 >= line + line_size) flush();
    *st++ = t;
  }

  template <typename T, std::enable_if_t<std::is_integral<T>::value, int> = 0>
  void write_single(T s) {
    if (st + int_digits >= line + line_size) flush();
    st += std::to_chars(st, st + int_digits, s).ptr - st;
  }

  void write_single(const std::string& s) {
    for (auto& c : s) write_single(c);
  }

  void write_single(const char* s) {
    while (*s != 0) write_single(*s++);
  }

  template <typename T>
  void write_single(const std::vector<T>& s) {
    for (std::size_t i = 0; i < s.size(); i++) {
      if (i) write_single(' ');
      write_single(s[i]);
    }
  }
};
#line 2 "other/scanner.hpp"

#line 5 "other/scanner.hpp"
#include <cstring>
#line 9 "other/scanner.hpp"

/**
 * @brief Scanner(高速入力)
 */
struct Scanner {
 public:
  explicit Scanner(std::FILE* fp) : fp(fp) {}

  template <typename T, typename... E>
  void read(T& t, E&... e) {
    read_single(t);
    read(e...);
  }

 private:
  static constexpr std::size_t line_size = 1 << 16;
  static constexpr std::size_t int_digits = 20;
  char line[line_size + 1] = {};
  std::FILE* fp = nullptr;
  char* st = line;
  char* ed = line;

  void read() {}

  static inline bool is_space(char c) { return c <= ' '; }

  void reread() {
    std::ptrdiff_t len = ed - st;
    std::memmove(line, st, len);
    char* tmp = line + len;
    ed = tmp + std::fread(tmp, 1, line_size - len, fp);
    *ed = 0;
    st = line;
  }

  void skip_space() {
    while (true) {
      if (st == ed) reread();
      while (*st && is_space(*st)) ++st;
      if (st != ed) return;
    }
  }

  template <typename T, std::enable_if_t<std::is_integral<T>::value, int> = 0>
  void read_single(T& s) {
    skip_space();
    if (st + int_digits >= ed) reread();
    bool neg = false;
    if (std::is_signed<T>::value && *st == '-') {
      neg = true;
      ++st;
    }
    typename std::make_unsigned<T>::type y = *st++ - '0';
    while (*st >= '0') {
      y = 10 * y + *st++ - '0';
    }
    s = (neg ? -y : y);
  }

  template <typename T,
            std::enable_if_t<std::is_same<T, std::string>::value, int> = 0>
  void read_single(T& s) {
    s = "";
    skip_space();
    while (true) {
      char* base = st;
      while (*st && !is_space(*st)) ++st;
      s += std::string(base, st);
      if (st != ed) return;
      reread();
    }
  }

  template <typename T>
  void read_single(std::vector<T>& s) {
    for (auto& d : s) read(d);
  }
};
#line 2 "other/static-point-add-rectangle-sum.hpp"

#line 4 "other/static-point-add-rectangle-sum.hpp"
#include <cassert>
#include <iterator>
#line 8 "other/static-point-add-rectangle-sum.hpp"

#line 2 "structure/others/binary-indexed-tree.hpp"

#line 5 "structure/others/binary-indexed-tree.hpp"

template <typename T>
struct BinaryIndexedTree {
 private:
  int n;
  std::vector<T> data;

 public:
  BinaryIndexedTree() = default;

  explicit BinaryIndexedTree(int n) : n(n) { data.assign(n + 1, T()); }

  explicit BinaryIndexedTree(const std::vector<T>& v)
      : BinaryIndexedTree((int)v.size()) {
    build(v);
  }

  void build(const std::vector<T>& v) {
    assert(n == (int)v.size());
    for (int i = 1; i <= n; i++) data[i] = v[i - 1];
    for (int i = 1; i <= n; i++) {
      int j = i + (i & -i);
      if (j <= n) data[j] += data[i];
    }
  }

  void apply(int k, const T& x) {
    for (++k; k <= n; k += k & -k) data[k] += x;
  }

  T prod(int r) const {
    T ret = T();
    for (; r > 0; r -= r & -r) ret += data[r];
    return ret;
  }

  T prod(int l, int r) const { return prod(r) - prod(l); }

  int lower_bound(T x) const {
    int i = 0;
    for (int k = 1 << (32 - __builtin_clz(n)); k > 0; k >>= 1) {
      if (i + k <= n && data[i + k] < x) {
        x -= data[i + k];
        i += k;
      }
    }
    return i;
  }

  int upper_bound(T x) const {
    int i = 0;
    for (int k = 1 << (32 - __builtin_clz(n)); k > 0; k >>= 1) {
      if (i + k <= n && data[i + k] <= x) {
        x -= data[i + k];
        i += k;
      }
    }
    return i;
  }
};
#line 10 "other/static-point-add-rectangle-sum.hpp"

template <typename T, typename C>
struct StaticPointAddRectangleSum {
  using BIT = BinaryIndexedTree<C>;

  static_assert(std::is_integral<T>::value,
                "template parameter T must be integral type");

  struct Point {
    T x, y;
    C w;
  };

  struct Query {
    T l, d, r, u;
  };

  std::vector<Point> points;
  std::vector<Query> queries;

  StaticPointAddRectangleSum() = default;

  StaticPointAddRectangleSum(int n, int q) {
    points.reserve(n);
    queries.reserve(q);
  }

  void add_point(T x, T y, C w) { points.emplace_back(Point{x, y, w}); }

  // total weight of [l, r) * [d, u) points
  void add_query(T l, T d, T r, T u) {
    queries.emplace_back(Query{l, d, r, u});
  }

  std::vector<C> calculate_queries() {
    int n = (int)points.size();
    int q = (int)queries.size();
    std::vector<C> ans(q);
    if (points.empty() or queries.empty()) {
      return ans;
    }
    std::sort(points.begin(), points.end(),
              [](const Point& a, const Point& b) { return a.y < b.y; });
    std::vector<T> ys;
    ys.reserve(n);
    for (Point& p : points) {
      if (ys.empty() or ys.back() != p.y) ys.emplace_back(p.y);
      p.y = (int)ys.size() - 1;
    }
    ys.shrink_to_fit();

    struct Q {
      T x;
      int d, u;
      bool type;
      int idx;
    };
    std::vector<Q> qs;
    qs.reserve(q + q);
    for (int i = 0; i < q; i++) {
      auto& query = queries[i];
      int d = std::lower_bound(ys.begin(), ys.end(), query.d) - ys.begin();
      int u = std::lower_bound(ys.begin(), ys.end(), query.u) - ys.begin();
      qs.emplace_back(Q{query.l, d, u, false, i});
      qs.emplace_back(Q{query.r, d, u, true, i});
    }
    std::sort(points.begin(), points.end(),
              [](const Point& a, const Point& b) { return a.x < b.x; });
    std::sort(qs.begin(), qs.end(),
              [](const Q& a, const Q& b) { return a.x < b.x; });
    int j = 0;
    BIT bit(ys.size());
    for (auto& query : qs) {
      while (j < n and points[j].x < query.x) {
        bit.apply(points[j].y, points[j].w);
        ++j;
      }
      if (query.type)
        ans[query.idx] += bit.prod(query.d, query.u);
      else
        ans[query.idx] -= bit.prod(query.d, query.u);
    }
    return ans;
  }
};
#line 16 "test/verify/yosupo-rectangle-sum-2.test.cpp"

using namespace std;

int main() {
  int N, Q;
  Scanner in(stdin);
  Printer out(stdout);
  in.read(N, Q);
  StaticPointAddRectangleSum<int, long long> spars;
  for (int i = 0; i < N; i++) {
    int x, y, z;
    in.read(x, y, z);
    spars.add_point(x, y, z);
  }
  vector<tuple<int, int, int, int> > query;
  query.reserve(Q);
  for (int i = 0; i < Q; i++) {
    int l, d, r, u;
    in.read(l, d, r, u);
    spars.add_query(l, d, r, u);
  }
  for (auto&& ans : spars.calculate_queries()) {
    out.writeln(ans);
  }
}

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 2 ms 4 MB
g++ max_random_00 :heavy_check_mark: AC 151 ms 22 MB
g++ max_random_01 :heavy_check_mark: AC 152 ms 22 MB
g++ max_random_02 :heavy_check_mark: AC 149 ms 22 MB
g++ n_131072_00 :heavy_check_mark: AC 102 ms 20 MB
g++ random_00 :heavy_check_mark: AC 106 ms 17 MB
g++ random_01 :heavy_check_mark: AC 115 ms 19 MB
g++ random_02 :heavy_check_mark: AC 72 ms 13 MB
g++ small_00 :heavy_check_mark: AC 2 ms 4 MB
g++ small_01 :heavy_check_mark: AC 2 ms 4 MB
g++ small_02 :heavy_check_mark: AC 2 ms 4 MB
g++ xy_concentrate_00 :heavy_check_mark: AC 138 ms 22 MB
g++ xy_concentrate_01 :heavy_check_mark: AC 137 ms 21 MB
g++ xy_concentrate_02 :heavy_check_mark: AC 139 ms 21 MB
clang++ example_00 :heavy_check_mark: AC 2 ms 4 MB
clang++ max_random_00 :heavy_check_mark: AC 128 ms 22 MB
clang++ max_random_01 :heavy_check_mark: AC 129 ms 22 MB
clang++ max_random_02 :heavy_check_mark: AC 131 ms 22 MB
clang++ n_131072_00 :heavy_check_mark: AC 97 ms 20 MB
clang++ random_00 :heavy_check_mark: AC 87 ms 17 MB
clang++ random_01 :heavy_check_mark: AC 96 ms 17 MB
clang++ random_02 :heavy_check_mark: AC 58 ms 13 MB
clang++ small_00 :heavy_check_mark: AC 2 ms 4 MB
clang++ small_01 :heavy_check_mark: AC 2 ms 4 MB
clang++ small_02 :heavy_check_mark: AC 2 ms 4 MB
clang++ xy_concentrate_00 :heavy_check_mark: AC 119 ms 21 MB
clang++ xy_concentrate_01 :heavy_check_mark: AC 120 ms 21 MB
clang++ xy_concentrate_02 :heavy_check_mark: AC 116 ms 21 MB
Back to top page