test/verify/yosupo-static-range-frequency.test.cpp

View this file on GitHub
Last update: 2024-07-28 19:56:12+09:00
Problem: https://judge.yosupo.jp/problem/static_range_frequency

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_range_frequency

#include "../../template/template.hpp"

#include "../../other/static-range-frequency.hpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N);
  for(auto& a : A) cin >> a;
  StaticRangeFrequency s(A);
  while(Q--) {
    int l, r, x;
    cin >> l >> r >> x;
    cout << s.query(l, r, x) << "\n";
  }
}

#line 1 "test/verify/yosupo-static-range-frequency.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_range_frequency

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

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 != v.size() ? " " : "");
  }
  return os;
}

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

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/yosupo-static-range-frequency.test.cpp"

#line 1 "other/static-range-frequency.hpp"
template <typename T>
struct StaticRangeFrequency {
 private:
  vector<T> vs;
  vector<vector<int> > mp;

 public:
  explicit StaticRangeFrequency(const vector<T> &xs) : vs{xs} {
    sort(vs.begin(), vs.end());
    vs.erase(unique(vs.begin(), vs.end()), vs.end());
    mp.resize(vs.size());
    for (int i = 0; i < xs.size(); i++) {
      int p = lower_bound(vs.begin(), vs.end(), xs[i]) - vs.begin();
      mp[p].emplace_back(i);
    }
  }
  size_t query(int l, int r, T x) const {
    int p = lower_bound(vs.begin(), vs.end(), x) - vs.begin();
    if (p == vs.size() or x != vs[p]) return 0;
    l = lower_bound(mp[p].begin(), mp[p].end(), l) - vs.begin();
    r = lower_bound(mp[p].begin(), mp[p].end(), r) - vs.begin();
    return r - l;
  }
};
#line 6 "test/verify/yosupo-static-range-frequency.test.cpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N);
  for(auto& a : A) cin >> a;
  StaticRangeFrequency s(A);
  while(Q--) {
    int l, r, x;
    cin >> l >> r >> x;
    cout << s.query(l, r, x) << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	5 ms	3 MB
g++	random_00	AC	212 ms	8 MB
g++	random_01	AC	222 ms	10 MB
g++	random_02	AC	134 ms	5 MB
g++	random_03	AC	280 ms	9 MB
g++	random_04	AC	271 ms	10 MB
g++	random_05	AC	354 ms	21 MB
g++	small_n_00	AC	82 ms	3 MB
g++	small_n_01	AC	86 ms	3 MB
g++	small_n_02	AC	93 ms	3 MB
g++	small_q_00	AC	82 ms	10 MB
clang++	example_00	AC	5 ms	3 MB
clang++	random_00	AC	190 ms	8 MB
clang++	random_01	AC	198 ms	10 MB
clang++	random_02	AC	123 ms	5 MB
clang++	random_03	AC	237 ms	9 MB
clang++	random_04	AC	232 ms	10 MB
clang++	random_05	AC	325 ms	21 MB
clang++	small_n_00	AC	93 ms	3 MB
clang++	small_n_01	AC	85 ms	3 MB
clang++	small_n_02	AC	89 ms	3 MB
clang++	small_q_00	AC	67 ms	10 MB