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

• View this file on GitHub
• Last update: 2026-08-10 10:59:37+00:00
• Problem: https://judge.yosupo.jp/problem/staticrmq

Depends on

• Offline RMQ (other/offline-rmq.hpp)
• Printer(高速出力) (other/printer.hpp)
• Scanner(高速入力) (other/scanner.hpp)
• Union Find (structure/union-find/union-find.hpp)

Code

// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/staticrmq
// clang-format on

#include <cstdio>
#include <utility>
#include <vector>

#include "../../other/offline-rmq.hpp"
#include "../../other/printer.hpp"
#include "../../other/scanner.hpp"

using namespace std;

int main() {
  Scanner in(stdin);
  Printer out(stdout);
  int N, Q;
  in.read(N, Q);
  vector<int> A(N);
  in.read(A);
  vector<pair<int, int>> qs(Q);
  for (auto& [l, r] : qs) in.read(l, r);
  auto ans = offline_rmq(qs, [&](int a, int b) { return A[a] < A[b]; });
  for (int i = 0; i < Q; i++) out.writeln(A[ans[i]]);
}

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

#include <cstdio>
#include <utility>
#include <vector>

#line 2 "other/offline-rmq.hpp"

#include <algorithm>
#line 6 "other/offline-rmq.hpp"

#line 2 "structure/union-find/union-find.hpp"

#line 4 "structure/union-find/union-find.hpp"
#include <cstddef>
#line 7 "structure/union-find/union-find.hpp"

struct UnionFind {
  std::vector<int> data;

  UnionFind() = default;

  explicit UnionFind(std::size_t sz) : data(sz, -1) {}

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (data[x] > data[y]) std::swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }

  int find(int k) {
    if (data[k] < 0) return (k);
    return data[k] = find(data[k]);
  }

  int size(int k) { return -data[find(k)]; }

  bool same(int x, int y) { return find(x) == find(y); }

  std::vector<std::vector<int>> groups() {
    int n = (int)data.size();
    std::vector<std::vector<int>> ret(n);
    for (int i = 0; i < n; i++) {
      ret[find(i)].emplace_back(i);
    }
    ret.erase(
        std::remove_if(ret.begin(), ret.end(),
                       [&](const std::vector<int>& v) { return v.empty(); }),
        ret.end());
    return ret;
  }
};
#line 8 "other/offline-rmq.hpp"

/**
 * @brief Offline RMQ
 **/
template <typename Comp>
std::vector<int> offline_rmq(std::vector<std::pair<int, int> >& qs,
                             const Comp& comp) {
  int n = 0;
  for (auto& [l, r] : qs) n = std::max(n, r);
  UnionFind uf(n);
  std::vector<int> st(n), mark(n), ans(qs.size());
  int top = -1;
  for (auto& [l, r] : qs) mark[r - 1]++;
  std::vector<std::vector<int> > q(n);
  for (int i = 0; i < n; i++) {
    q[i].reserve(mark[i]);
  }
  for (int i = 0; i < qs.size(); i++) {
    q[qs[i].second - 1].emplace_back(i);
  }
  for (int i = 0; i < n; i++) {
    while (~top and not comp(st[top], i)) {
      uf.unite(st[top--], i);
    }
    st[++top] = i;
    mark[uf.find(i)] = i;
    for (auto& j : q[i]) {
      ans[j] = mark[uf.find(qs[j].first)];
    }
  }
  return ans;
}
#line 2 "other/printer.hpp"

#include <charconv>
#line 6 "other/printer.hpp"
#include <string>
#include <type_traits>
#line 9 "other/printer.hpp"

/**
 * @brief Printer(高速出力)
 */
struct Printer {
 public:
  explicit Printer(FILE* fp) : fp(fp) {}

  ~Printer() { flush(); }

  template <bool f = false, typename T, typename... E>
  void write(const T& t, const E&... e) {
    if (f) write_single(' ');
    write_single(t);
    write<true>(e...);
  }

  template <typename... T>
  void writeln(const T&... t) {
    write(t...);
    write_single('\n');
  }

  void flush() {
    fwrite(line, 1, st - line, fp);
    st = line;
  }

 private:
  FILE* fp = nullptr;
  static constexpr std::size_t line_size = 1 << 16;
  static constexpr std::size_t int_digits = 20;
  char line[line_size + 1] = {};
  char* st = line;

  template <bool f = false>
  void write() {}

  void write_single(const char& t) {
    if (st + 1 >= line + line_size) flush();
    *st++ = t;
  }

  template <typename T, std::enable_if_t<std::is_integral<T>::value, int> = 0>
  void write_single(T s) {
    if (st + int_digits >= line + line_size) flush();
    st += std::to_chars(st, st + int_digits, s).ptr - st;
  }

  void write_single(const std::string& s) {
    for (auto& c : s) write_single(c);
  }

  void write_single(const char* s) {
    while (*s != 0) write_single(*s++);
  }

  template <typename T>
  void write_single(const std::vector<T>& s) {
    for (std::size_t i = 0; i < s.size(); i++) {
      if (i) write_single(' ');
      write_single(s[i]);
    }
  }
};
#line 2 "other/scanner.hpp"

#line 5 "other/scanner.hpp"
#include <cstring>
#line 9 "other/scanner.hpp"

/**
 * @brief Scanner(高速入力)
 */
struct Scanner {
 public:
  explicit Scanner(std::FILE* fp) : fp(fp) {}

  template <typename T, typename... E>
  void read(T& t, E&... e) {
    read_single(t);
    read(e...);
  }

 private:
  static constexpr std::size_t line_size = 1 << 16;
  static constexpr std::size_t int_digits = 20;
  char line[line_size + 1] = {};
  std::FILE* fp = nullptr;
  char* st = line;
  char* ed = line;

  void read() {}

  static inline bool is_space(char c) { return c <= ' '; }

  void reread() {
    std::ptrdiff_t len = ed - st;
    std::memmove(line, st, len);
    char* tmp = line + len;
    ed = tmp + std::fread(tmp, 1, line_size - len, fp);
    *ed = 0;
    st = line;
  }

  void skip_space() {
    while (true) {
      if (st == ed) reread();
      while (*st && is_space(*st)) ++st;
      if (st != ed) return;
    }
  }

  template <typename T, std::enable_if_t<std::is_integral<T>::value, int> = 0>
  void read_single(T& s) {
    skip_space();
    if (st + int_digits >= ed) reread();
    bool neg = false;
    if (std::is_signed<T>::value && *st == '-') {
      neg = true;
      ++st;
    }
    typename std::make_unsigned<T>::type y = *st++ - '0';
    while (*st >= '0') {
      y = 10 * y + *st++ - '0';
    }
    s = (neg ? -y : y);
  }

  template <typename T,
            std::enable_if_t<std::is_same<T, std::string>::value, int> = 0>
  void read_single(T& s) {
    s = "";
    skip_space();
    while (true) {
      char* base = st;
      while (*st && !is_space(*st)) ++st;
      s += std::string(base, st);
      if (st != ed) return;
      reread();
    }
  }

  template <typename T>
  void read_single(std::vector<T>& s) {
    for (auto& d : s) read(d);
  }
};
#line 12 "test/verify/yosupo-staticrmq-6.test.cpp"

using namespace std;

int main() {
  Scanner in(stdin);
  Printer out(stdout);
  int N, Q;
  in.read(N, Q);
  vector<int> A(N);
  in.read(A);
  vector<pair<int, int>> qs(Q);
  for (auto& [l, r] : qs) in.read(l, r);
  auto ans = offline_rmq(qs, [&](int a, int b) { return A[a] < A[b]; });
  for (int i = 0; i < Q; i++) out.writeln(A[ans[i]]);
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	2 ms	4 MB
g++	max_random_00	AC	69 ms	38 MB
g++	max_random_01	AC	68 ms	38 MB
g++	max_random_02	AC	71 ms	38 MB
g++	max_random_03	AC	71 ms	38 MB
g++	max_random_04	AC	70 ms	38 MB
g++	random_00	AC	53 ms	31 MB
g++	random_01	AC	57 ms	34 MB
g++	random_02	AC	23 ms	12 MB
g++	random_03	AC	20 ms	21 MB
g++	random_04	AC	21 ms	18 MB
g++	small_00	AC	2 ms	4 MB
g++	small_01	AC	2 ms	4 MB
g++	small_02	AC	1 ms	4 MB
g++	small_03	AC	1 ms	4 MB
g++	small_04	AC	1 ms	4 MB
g++	small_05	AC	1 ms	4 MB
g++	small_06	AC	1 ms	4 MB
g++	small_07	AC	1 ms	4 MB
g++	small_08	AC	1 ms	4 MB
g++	small_09	AC	1 ms	4 MB
g++	small_values_00	AC	59 ms	38 MB
g++	small_width_query_00	AC	67 ms	39 MB
g++	small_width_query_01	AC	74 ms	39 MB
g++	small_width_query_02	AC	76 ms	39 MB
g++	small_width_query_03	AC	81 ms	39 MB
g++	small_width_query_04	AC	79 ms	39 MB
clang++	example_00	AC	2 ms	4 MB
clang++	max_random_00	AC	78 ms	38 MB
clang++	max_random_01	AC	78 ms	38 MB
clang++	max_random_02	AC	81 ms	38 MB
clang++	max_random_03	AC	81 ms	38 MB
clang++	max_random_04	AC	80 ms	38 MB
clang++	random_00	AC	60 ms	31 MB
clang++	random_01	AC	67 ms	34 MB
clang++	random_02	AC	26 ms	12 MB
clang++	random_03	AC	24 ms	21 MB
clang++	random_04	AC	26 ms	18 MB
clang++	small_00	AC	2 ms	4 MB
clang++	small_01	AC	2 ms	4 MB
clang++	small_02	AC	2 ms	4 MB
clang++	small_03	AC	2 ms	4 MB
clang++	small_04	AC	1 ms	4 MB
clang++	small_05	AC	1 ms	4 MB
clang++	small_06	AC	2 ms	4 MB
clang++	small_07	AC	2 ms	4 MB
clang++	small_08	AC	1 ms	4 MB
clang++	small_09	AC	1 ms	4 MB
clang++	small_values_00	AC	73 ms	38 MB
clang++	small_width_query_00	AC	81 ms	39 MB
clang++	small_width_query_01	AC	80 ms	39 MB
clang++	small_width_query_02	AC	80 ms	39 MB
clang++	small_width_query_03	AC	84 ms	39 MB
clang++	small_width_query_04	AC	81 ms	39 MB

Back to top page