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-static-range-count-distinct.test.cpp

Depends on

Code

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

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

#include "../../other/static-range-count-distinct.hpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N);
  for(auto& a : A) cin >> a;
  StaticRangeCountDistinct s(A);
  for(int i = 0; i < Q; i++) {
    int l, r;
    cin >> l >> r;
    s.add_query(l, r);
  }
  cout << s.calclate_queries() << "\n";
}

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

#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-count-distinct.test.cpp"

#line 1 "structure/others/binary-indexed-tree.hpp"
template <typename T>
struct BinaryIndexedTree {
 private:
  int n;
  vector<T> data;

 public:
  BinaryIndexedTree() = default;

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

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

  void build(const 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 << (__lg(n) + 1); 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 << (__lg(n) + 1); k > 0; k >>= 1) {
      if (i + k <= n && data[i + k] <= x) {
        x -= data[i + k];
        i += k;
      }
    }
    return i;
  }
};
#line 2 "other/static-range-count-distinct.hpp"

template <typename T>
struct StaticRangeCountDistinct {
 private:
  using BIT = BinaryIndexedTree<int>;
  size_t m;
  vector<int> xs;
  vector<vector<int> > mp;
  vector<pair<int, int> > qs;

 public:
  explicit StaticRangeCountDistinct(const vector<T> &vs) : xs(vs.size()) {
    vector<T> ys = vs;
    sort(ys.begin(), ys.end());
    ys.erase(unique(ys.begin(), ys.end()), ys.end());
    m = ys.size();
    for (int i = 0; i < vs.size(); i++) {
      int p = lower_bound(ys.begin(), ys.end(), vs[i]) - ys.begin();
      xs[i] = p;
    }
  }

  void add_query(int l, int r) {
    assert(0 <= l and l <= r and r <= xs.size());
    qs.emplace_back(l, r - 1);
  }

  vector<size_t> calclate_queries() const {
    int n = (int)xs.size();
    int q = (int)qs.size();
    vector<vector<int> > ev(n);
    for (int i = 0; i < q; i++) {
      if (qs[i].first <= qs[i].second) {
        ev[qs[i].second].emplace_back(i);
      }
    }
    vector<int> pre(m, -1);
    BIT bit(n);
    vector<size_t> ans(q);
    for (int i = 0; i < n; i++) {
      int v = xs[i];
      if (~pre[v]) bit.apply(n - pre[v] - 1, -1);
      pre[v] = i;
      bit.apply(n - i - 1, 1);
      for (auto &j : ev[i]) {
        ans[j] = bit.prod(n - qs[j].first);
      }
    }
    return ans;
  }
};
#line 6 "test/verify/yosupo-static-range-count-distinct.test.cpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N);
  for(auto& a : A) cin >> a;
  StaticRangeCountDistinct s(A);
  for(int i = 0; i < Q; i++) {
    int l, r;
    cin >> l >> r;
    s.add_query(l, r);
  }
  cout << s.calclate_queries() << "\n";
}

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 5 ms 3 MB
g++ random_00 :heavy_check_mark: AC 140 ms 31 MB
g++ random_01 :heavy_check_mark: AC 187 ms 35 MB
g++ random_02 :heavy_check_mark: AC 97 ms 16 MB
g++ random_03 :heavy_check_mark: AC 179 ms 38 MB
g++ random_04 :heavy_check_mark: AC 216 ms 38 MB
g++ random_05 :heavy_check_mark: AC 270 ms 39 MB
g++ small_n_00 :heavy_check_mark: AC 59 ms 11 MB
g++ small_n_01 :heavy_check_mark: AC 64 ms 13 MB
g++ small_n_02 :heavy_check_mark: AC 64 ms 13 MB
g++ small_q_00 :heavy_check_mark: AC 93 ms 21 MB
clang++ example_00 :heavy_check_mark: AC 5 ms 3 MB
clang++ random_00 :heavy_check_mark: AC 148 ms 31 MB
clang++ random_01 :heavy_check_mark: AC 176 ms 35 MB
clang++ random_02 :heavy_check_mark: AC 90 ms 16 MB
clang++ random_03 :heavy_check_mark: AC 188 ms 38 MB
clang++ random_04 :heavy_check_mark: AC 208 ms 38 MB
clang++ random_05 :heavy_check_mark: AC 243 ms 39 MB
clang++ small_n_00 :heavy_check_mark: AC 58 ms 11 MB
clang++ small_n_01 :heavy_check_mark: AC 66 ms 13 MB
clang++ small_n_02 :heavy_check_mark: AC 65 ms 13 MB
clang++ small_q_00 :heavy_check_mark: AC 84 ms 21 MB
Back to top page