lmori's Library

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

View the Project on GitHub lmorinn/library

:heavy_check_mark: verify/LibraryChecker/data-structure/others/StaticRangeFrequency.test.cpp

Depends on

Code

#include "../../../../template/template.hpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_frequency"
#include "../../../../data-structure/others/MergeSortTree.hpp"

using S = lint;
int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, q;
  in(n, q);
  vector<int> a(n);
  in(a);

  MergeSortTree t(a);
  rep(i, q) {
    int l, r, x;
    in(l, r, x);
    out(t.range_freq(l, r, x, x + 1));
  }
}
#line 2 "template/template.hpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ull = unsigned long long;
using ld = long double;
using int128 = __int128_t;
#define all(x) (x).begin(), (x).end()
#define uniqv(v) v.erase(unique(all(v)), v.end())
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define logfixed(x) cout << fixed << setprecision(10) << x << endl;

ostream &operator<<(ostream &dest, __int128_t value) {
  ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(ios_base::badbit);
    }
  }
  return dest;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != (int)v.size() ? " " : "");
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const unordered_map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
  os << pair_var.first << " " << pair_var.second;
  return os;
}

void out() { cout << '\n'; }
template <class T, class... Ts>
void out(const T &a, const Ts &...b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

void outf() { cout << '\n'; }
template <class T, class... Ts>
void outf(const T &a, const Ts &...b) {
  cout << fixed << setprecision(14) << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
  cin >> first;
  in(rest...);
  return;
}

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

vector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};
vector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<lint> dx4 = {1, 0, -1, 0};
vector<lint> dy4 = {0, 1, 0, -1};

#pragma endregion
#line 2 "verify/LibraryChecker/data-structure/others/StaticRangeFrequency.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_frequency"
#line 1 "data-structure/others/MergeSortTree.hpp"

class MergeSortTree {
 private:
  int n0;
  int n;
  int MA = 1e9 + 10;
  vector<int> px;

  vector<vector<int>> node;

  void _merge(vector<int> &par, vector<int> a, vector<int> b) {
    int siz_a = a.size();
    int siz_b = b.size();
    par.resize(siz_a + siz_b);
    int i = 0;
    int j = 0;
    for (int k = 0; k < siz_a + siz_b; k++) {
      if (i < siz_a and j < siz_b) {
        if (a[i] <= b[j]) {
          par[k] = a[i];
          i++;
        } else {
          par[k] = b[j];
          j++;
        }
      } else if (i < siz_a) {
        par[k] = a[i];
        i++;
      } else {
        par[k] = b[j];
        j++;
      }
    }
  }

  int less_count(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = n0;
    if (r <= a or b <= l) return 0;
    if (a <= l and r <= b) return distance(node[k].begin(), lower_bound(node[k].begin(), node[k].end(), x));

    int cl = less_count(a, b, x, k * 2 + 1, l, (l + r) / 2);
    int cr = less_count(a, b, x, k * 2 + 2, (l + r) / 2, r);

    return cl + cr;
  }

 public:
  MergeSortTree() {}
  MergeSortTree(const vector<int> &v) {
    n = v.size();
    n0 = 1;
    while (n0 < n) n0 *= 2;
    node.resize(n0 * 2 - 1);
    for (int i = 0; i < n; i++) node[i + n0 - 1].emplace_back(v[i]);
    for (int i = n0 - 2; i >= 0; i--) _merge(node[i], node[i * 2 + 1], node[i * 2 + 2]);
  }

  MergeSortTree(vector<int> x, vector<int> y) {
    n = x.size();
    n0 = 1;
    while (n0 < n) n0 *= 2;
    vector<pair<int, int>> v(n);
    for (int i = 0; i < n; i++) v[i] = {x[i], y[i]};
    sort(v.begin(), v.end());
    px.resize(n);
    for (int i = 0; i < n; i++) {
      px[i] = v[i].first;
      y[i] = v[i].second;
    }

    node.resize(n0 * 2 - 1);
    for (int i = 0; i < n; i++) node[i + n0 - 1].emplace_back(y[i]);
    for (int i = n0 - 2; i >= 0; i--) _merge(node[i], node[i * 2 + 1], node[i * 2 + 2]);
  }

  int range_freq(int l, int r, int mink, int maxk) {
    return less_count(l, r, maxk) - less_count(l, r, mink);
  }

  int rectangle_freq(int lx, int rx, int ly, int ry) {
    int l = distance(px.begin(), lower_bound(px.begin(), px.end(), lx));
    int r = distance(px.begin(), lower_bound(px.begin(), px.end(), rx));
    return less_count(l, r, ry) - less_count(l, r, ly);
  }
};
#line 4 "verify/LibraryChecker/data-structure/others/StaticRangeFrequency.test.cpp"

using S = lint;
int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, q;
  in(n, q);
  vector<int> a(n);
  in(a);

  MergeSortTree t(a);
  rep(i, q) {
    int l, r, x;
    in(l, r, x);
    out(t.range_freq(l, r, x, x + 1));
  }
}
Back to top page