test/verify/yosupo-staticrmq.test.cpp

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Problem: https://judge.yosupo.jp/problem/staticrmq

Depends on

• Sparse-Table(スパーステーブル) (structure/others/sparse-table.hpp)
• template/template.hpp

Code

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

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

#include "../../structure/others/sparse-table.hpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N);
  cin >> A;
  auto st = get_sparse_table(A, [](int a, int b) { return min(a, b); });
  while(Q--) {
    int l, r;
    cin >> l >> r;
    cout << st.fold(l, r) << "\n";
  }
}

#line 1 "test/verify/yosupo-staticrmq.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/staticrmq

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

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(forward<F>(f)) {}

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

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

#line 1 "structure/others/sparse-table.hpp"
/**
 * @brief Sparse-Table(スパーステーブル)
 *
 */
template <typename T, typename F>
struct SparseTable {
  F f;
  vector<vector<T> > st;
  vector<int> lookup;

  SparseTable() = default;

  explicit SparseTable(const vector<T> &v, const F &f) : f(f) {
    const int n = (int)v.size();
    const int b = 32 - __builtin_clz(n);
    st.assign(b, vector<T>(n));
    for (int i = 0; i < v.size(); i++) {
      st[0][i] = v[i];
    }
    for (int i = 1; i < b; i++) {
      for (int j = 0; j + (1 << i) <= n; j++) {
        st[i][j] = f(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
      }
    }
    lookup.resize(v.size() + 1);
    for (int i = 2; i < lookup.size(); i++) {
      lookup[i] = lookup[i >> 1] + 1;
    }
  }

  inline T fold(int l, int r) const {
    int b = lookup[r - l];
    return f(st[b][l], st[b][r - (1 << b)]);
  }
};

template <typename T, typename F>
SparseTable<T, F> get_sparse_table(const vector<T> &v, const F &f) {
  return SparseTable<T, F>(v, f);
}
#line 6 "test/verify/yosupo-staticrmq.test.cpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N);
  cin >> A;
  auto st = get_sparse_table(A, [](int a, int b) { return min(a, b); });
  while(Q--) {
    int l, r;
    cin >> l >> r;
    cout << st.fold(l, r) << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	7 ms	4 MB
g++	max_random_00	AC	216 ms	44 MB
g++	max_random_01	AC	224 ms	44 MB
g++	max_random_02	AC	229 ms	44 MB
g++	max_random_03	AC	216 ms	44 MB
g++	max_random_04	AC	213 ms	44 MB
g++	random_00	AC	162 ms	35 MB
g++	random_01	AC	155 ms	41 MB
g++	random_02	AC	81 ms	7 MB
g++	random_03	AC	65 ms	39 MB
g++	random_04	AC	61 ms	26 MB
g++	small_00	AC	7 ms	4 MB
g++	small_01	AC	7 ms	4 MB
g++	small_02	AC	7 ms	4 MB
g++	small_03	AC	7 ms	4 MB
g++	small_04	AC	7 ms	4 MB
g++	small_05	AC	7 ms	4 MB
g++	small_06	AC	7 ms	4 MB
g++	small_07	AC	6 ms	4 MB
g++	small_08	AC	7 ms	4 MB
g++	small_09	AC	7 ms	4 MB
g++	small_width_query_00	AC	194 ms	44 MB
g++	small_width_query_01	AC	206 ms	44 MB
g++	small_width_query_02	AC	204 ms	44 MB
g++	small_width_query_03	AC	205 ms	44 MB
g++	small_width_query_04	AC	203 ms	44 MB
clang++	example_00	AC	7 ms	4 MB
clang++	max_random_00	AC	201 ms	44 MB
clang++	max_random_01	AC	218 ms	44 MB
clang++	max_random_02	AC	217 ms	44 MB
clang++	max_random_03	AC	197 ms	44 MB
clang++	max_random_04	AC	198 ms	44 MB
clang++	random_00	AC	167 ms	35 MB
clang++	random_01	AC	164 ms	41 MB
clang++	random_02	AC	77 ms	7 MB
clang++	random_03	AC	62 ms	39 MB
clang++	random_04	AC	59 ms	26 MB
clang++	small_00	AC	7 ms	4 MB
clang++	small_01	AC	7 ms	4 MB
clang++	small_02	AC	7 ms	4 MB
clang++	small_03	AC	7 ms	4 MB
clang++	small_04	AC	7 ms	4 MB
clang++	small_05	AC	7 ms	4 MB
clang++	small_06	AC	6 ms	4 MB
clang++	small_07	AC	7 ms	4 MB
clang++	small_08	AC	7 ms	4 MB
clang++	small_09	AC	7 ms	4 MB
clang++	small_width_query_00	AC	193 ms	44 MB
clang++	small_width_query_01	AC	187 ms	44 MB
clang++	small_width_query_02	AC	191 ms	44 MB
clang++	small_width_query_03	AC	191 ms	44 MB
clang++	small_width_query_04	AC	196 ms	44 MB

Back to top page