test/verify/yosupo-staticrmq-2.test.cpp

• View this file on GitHub
• Last update: 2024-04-27 01:27:28+09:00
• Problem: https://judge.yosupo.jp/problem/staticrmq

Depends on

• Disjoint-Sparse-Table (structure/others/disjoint-sparse-table.hpp)
• template/template.hpp

Code

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

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

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

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

#line 1 "test/verify/yosupo-staticrmq-2.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-2.test.cpp"

#line 1 "structure/others/disjoint-sparse-table.hpp"
/**
 * @brief Disjoint-Sparse-Table
 *
 */
template <typename Semigroup, typename F>
struct DisjointSparseTable {
  const F f;
  vector<vector<Semigroup> > st;
  vector<int> lookup;

  DisjointSparseTable(const vector<Semigroup>& v, const F& f) : f(f) {
    int b = 0;
    while ((1 << b) <= v.size()) ++b;
    st.resize(b, vector<Semigroup>(v.size(), Semigroup()));
    for (int i = 0; i < v.size(); i++) st[0][i] = v[i];
    for (int i = 1; i < b; i++) {
      int shift = 1 << i;
      for (int j = 0; j < v.size(); j += shift << 1) {
        int t = min(j + shift, (int)v.size());
        st[i][t - 1] = v[t - 1];
        for (int k = t - 2; k >= j; k--) st[i][k] = f(v[k], st[i][k + 1]);
        if (v.size() <= t) break;
        st[i][t] = v[t];
        int r = min(t + shift, (int)v.size());
        for (int k = t + 1; k < r; k++) st[i][k] = f(st[i][k - 1], v[k]);
      }
    }
    lookup.resize(1 << b);
    for (int i = 2; i < lookup.size(); i++) {
      lookup[i] = lookup[i >> 1] + 1;
    }
  }

  Semigroup fold(int l, int r) {
    if (l >= --r) return st[0][l];
    int p = lookup[l ^ r];
    return f(st[p][l], st[p][r]);
  }
};

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

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N);
  cin >> A;
  auto f = [](int a, int b) { return min(a, b); };
  auto st = get_disjoint_sparse_table(A, f);
  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	6 ms	4 MB
g++	max_random_00	AC	159 ms	45 MB
g++	max_random_01	AC	167 ms	45 MB
g++	max_random_02	AC	171 ms	45 MB
g++	max_random_03	AC	160 ms	45 MB
g++	max_random_04	AC	158 ms	45 MB
g++	random_00	AC	128 ms	36 MB
g++	random_01	AC	144 ms	42 MB
g++	random_02	AC	77 ms	7 MB
g++	random_03	AC	64 ms	39 MB
g++	random_04	AC	59 ms	27 MB
g++	small_00	AC	6 ms	4 MB
g++	small_01	AC	6 ms	4 MB
g++	small_02	AC	6 ms	4 MB
g++	small_03	AC	6 ms	4 MB
g++	small_04	AC	6 ms	4 MB
g++	small_05	AC	6 ms	4 MB
g++	small_06	AC	6 ms	4 MB
g++	small_07	AC	6 ms	4 MB
g++	small_08	AC	6 ms	4 MB
g++	small_09	AC	6 ms	4 MB
g++	small_width_query_00	AC	174 ms	45 MB
g++	small_width_query_01	AC	171 ms	45 MB
g++	small_width_query_02	AC	175 ms	45 MB
g++	small_width_query_03	AC	170 ms	45 MB
g++	small_width_query_04	AC	172 ms	45 MB
clang++	example_00	AC	6 ms	4 MB
clang++	max_random_00	AC	162 ms	45 MB
clang++	max_random_01	AC	167 ms	45 MB
clang++	max_random_02	AC	165 ms	45 MB
clang++	max_random_03	AC	161 ms	45 MB
clang++	max_random_04	AC	163 ms	45 MB
clang++	random_00	AC	130 ms	36 MB
clang++	random_01	AC	140 ms	42 MB
clang++	random_02	AC	82 ms	7 MB
clang++	random_03	AC	64 ms	39 MB
clang++	random_04	AC	59 ms	27 MB
clang++	small_00	AC	6 ms	4 MB
clang++	small_01	AC	6 ms	4 MB
clang++	small_02	AC	6 ms	4 MB
clang++	small_03	AC	6 ms	4 MB
clang++	small_04	AC	6 ms	4 MB
clang++	small_05	AC	6 ms	4 MB
clang++	small_06	AC	6 ms	4 MB
clang++	small_07	AC	6 ms	4 MB
clang++	small_08	AC	6 ms	4 MB
clang++	small_09	AC	6 ms	4 MB
clang++	small_width_query_00	AC	180 ms	45 MB
clang++	small_width_query_01	AC	170 ms	45 MB
clang++	small_width_query_02	AC	178 ms	45 MB
clang++	small_width_query_03	AC	166 ms	45 MB
clang++	small_width_query_04	AC	171 ms	45 MB

Back to top page