Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/staticrmq.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"

#include "../../code/ds/st_array.hpp"

i32 f(i32 x, i32 y) { return std::min(x, y); }

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, q;
  std::cin >> n >> q;
  vec<i32> a(n);
  for (u32 i = 0; i < n; ++i) std::cin >> a[i];
  tifa_libs::ds::st_array<i32, f> st(a);
  for (u32 i = 1, u, v; i <= q; ++i) {
    std::cin >> u >> v;
    std::cout << st.query(u, v - 1) << '\n';
  }
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/staticrmq.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"

#line 1 "src/code/ds/st_array.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/ds/st_array.hpp"

namespace tifa_libs::ds {

template <class T, T (*op)(T, T)>
class st_array {
  vvec<T> st;

 public:
  explicit constexpr st_array(vec<T> const &a) : st((u32)std::bit_width(a.size()), vec<T>(a.size())) {
    u32 n = a.size();
    st[0] = a;
    for (u32 j = 1, m = (u32)std::bit_width(n); j < m; ++j)
      for (u32 i = 0; i < n; ++i) st[j][i] = op(st[j - 1][i], st[j - 1][std::min(n - 1, i + (1 << (j - 1)))]);
  }

  //! [l, r]
  constexpr T query(u32 l, u32 r) const {
    u32 k = (u32)(std::bit_width(1 + r - l) - 1);
    return op(st[k][l], st[k][r + 1 - (1 << k)]);
  }
};

}  // namespace tifa_libs::ds


#line 4 "src/test_cpverifier/library-checker/staticrmq.test.cpp"

i32 f(i32 x, i32 y) { return std::min(x, y); }

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, q;
  std::cin >> n >> q;
  vec<i32> a(n);
  for (u32 i = 0; i < n; ++i) std::cin >> a[i];
  tifa_libs::ds::st_array<i32, f> st(a);
  for (u32 i = 1, u, v; i <= q; ++i) {
    std::cin >> u >> v;
    std::cout << st.query(u, v - 1) << '\n';
  }
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 max_random_00 :heavy_check_mark: AC 151 ms 44 MB
g++-12 max_random_01 :heavy_check_mark: AC 153 ms 44 MB
g++-12 max_random_02 :heavy_check_mark: AC 154 ms 44 MB
g++-12 max_random_03 :heavy_check_mark: AC 152 ms 44 MB
g++-12 max_random_04 :heavy_check_mark: AC 153 ms 44 MB
g++-12 random_00 :heavy_check_mark: AC 129 ms 35 MB
g++-12 random_01 :heavy_check_mark: AC 140 ms 41 MB
g++-12 random_02 :heavy_check_mark: AC 73 ms 7 MB
g++-12 random_03 :heavy_check_mark: AC 65 ms 39 MB
g++-12 random_04 :heavy_check_mark: AC 59 ms 26 MB
g++-12 small_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_01 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_02 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_03 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_04 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_05 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_06 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_07 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_08 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_09 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_width_query_00 :heavy_check_mark: AC 172 ms 44 MB
g++-12 small_width_query_01 :heavy_check_mark: AC 163 ms 44 MB
g++-12 small_width_query_02 :heavy_check_mark: AC 167 ms 44 MB
g++-12 small_width_query_03 :heavy_check_mark: AC 183 ms 44 MB
g++-12 small_width_query_04 :heavy_check_mark: AC 170 ms 44 MB
Back to top page