test/verify/yosupo-staticrmq-5.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

• Printer(高速出力) (other/printer.hpp)
• Scanner(高速入力) (other/scanner.hpp)
• Linear-RMQ (structure/others/linear-rmq.hpp)
• template/template.hpp

Code

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

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

#include "../../structure/others/linear-rmq.hpp"

#include "../../other/scanner.hpp"
#include "../../other/printer.hpp"

int main() {
  Scanner in(stdin);
  Printer out(stdout);
  int N, Q;
  in.read(N, Q);
  vector< int > A(N);
  in.read(A);
  auto f = [&](int a, int b) { return A[a] < A[b]; };
  auto seg = get_linear_rmq(N, f);
  while(Q--) {
    int l, r;
    in.read(l, r);
    out.writeln(A[seg.fold(l, r)]);
  }
}

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

#line 1 "structure/others/linear-rmq.hpp"
/**
 * @brief Linear-RMQ
 **/
template <typename Comp>
struct LinearRMQ {
  vector<int> small;
  vector<vector<int> > large;

  LinearRMQ() = default;

  Comp comp;

  static inline int msb(int c) { return 31 - __builtin_clz(c); }

  static inline int ctz(int c) { return __builtin_ctz(c); }

  inline int get_min(int l, int r) const { return comp(l, r) ? l : r; }

  explicit LinearRMQ(size_t n, const Comp &comp) : comp(comp) {
    vector<int> st;
    st.reserve(32);
    large.emplace_back();
    large.front().reserve(n / 32);
    small.reserve(n);
    for (int i = 0; i < n; i++) {
      while (!st.empty() && !comp(st.back(), i)) {
        st.pop_back();
      }
      small.emplace_back(st.empty() ? 0 : small[st.back()]);
      small.back() |= 1 << (i % 32);
      st.emplace_back(i);
      if ((i + 1) % 32 == 0) {
        large.front().emplace_back(st.front());
        st.clear();
      }
    }
    for (int i = 1; (i << 1) <= n / 32; i <<= 1) {
      vector<int> v;
      int csz = n / 32 + 1 - (i << 1);
      v.reserve(csz);
      for (int k = 0; k < csz; k++) {
        v.emplace_back(get_min(large.back()[k], large.back()[k + i]));
      }
      large.emplace_back(move(v));
    }
  }

  int fold(int l, int r) const {
    --r;
    int left = l / 32 + 1;
    int right = r / 32;
    if (left < right) {
      auto p = msb(right - left);
      return get_min(
          get_min((left - 1) * 32 + ctz(small[left * 32 - 1] & ~0 << l % 32),
                  large[p][left]),
          get_min(large[p][right - (1 << p)], right * 32 + ctz(small[r])));
    } else if (left == right) {
      return get_min((left - 1) * 32 + ctz(small[left * 32 - 1] & ~0 << l % 32),
                     left * 32 + ctz(small[r]));
    } else {
      return right * 32 + ctz(small[r] & ~0 << l % 32);
    }
  }
};

template <typename Comp>
LinearRMQ<Comp> get_linear_rmq(int n, const Comp &comp) {
  return LinearRMQ<Comp>(n, comp);
}
#line 6 "test/verify/yosupo-staticrmq-5.test.cpp"

#line 1 "other/scanner.hpp"
/**
 * @brief Scanner(高速入力)
 */
struct Scanner {
 public:
  explicit Scanner(FILE *fp) : fp(fp) {}

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

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

  void read() {}

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

  void reread() {
    ptrdiff_t len = ed - st;
    memmove(line, st, len);
    char *tmp = line + len;
    ed = tmp + 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, enable_if_t<is_integral<T>::value, int> = 0>
  void read_single(T &s) {
    skip_space();
    if (st + int_digits >= ed) reread();
    bool neg = false;
    if (is_signed<T>::value && *st == '-') {
      neg = true;
      ++st;
    }
    typename make_unsigned<T>::type y = *st++ - '0';
    while (*st >= '0') {
      y = 10 * y + *st++ - '0';
    }
    s = (neg ? -y : y);
  }

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

  template <typename T>
  void read_single(vector<T> &s) {
    for (auto &d : s) read(d);
  }
};
#line 1 "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 size_t line_size = 1 << 16;
  static constexpr 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, enable_if_t<is_integral<T>::value, int> = 0>
  void write_single(T s) {
    if (st + int_digits >= line + line_size) flush();
    st += to_chars(st, st + int_digits, s).ptr - st;
  }

  void write_single(const 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 vector<T> &s) {
    for (size_t i = 0; i < s.size(); i++) {
      if (i) write_single(' ');
      write_single(s[i]);
    }
  }
};
#line 9 "test/verify/yosupo-staticrmq-5.test.cpp"

int main() {
  Scanner in(stdin);
  Printer out(stdout);
  int N, Q;
  in.read(N, Q);
  vector< int > A(N);
  in.read(A);
  auto f = [&](int a, int b) { return A[a] < A[b]; };
  auto seg = get_linear_rmq(N, f);
  while(Q--) {
    int l, r;
    in.read(l, r);
    out.writeln(A[seg.fold(l, r)]);
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	6 ms	4 MB
g++	max_random_00	AC	47 ms	8 MB
g++	max_random_01	AC	47 ms	8 MB
g++	max_random_02	AC	48 ms	8 MB
g++	max_random_03	AC	50 ms	8 MB
g++	max_random_04	AC	47 ms	8 MB
g++	random_00	AC	40 ms	7 MB
g++	random_01	AC	44 ms	8 MB
g++	random_02	AC	25 ms	4 MB
g++	random_03	AC	19 ms	8 MB
g++	random_04	AC	19 ms	6 MB
g++	small_00	AC	8 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	53 ms	8 MB
g++	small_width_query_01	AC	53 ms	8 MB
g++	small_width_query_02	AC	54 ms	8 MB
g++	small_width_query_03	AC	55 ms	8 MB
g++	small_width_query_04	AC	57 ms	8 MB
clang++	example_00	AC	7 ms	4 MB
clang++	max_random_00	AC	50 ms	8 MB
clang++	max_random_01	AC	55 ms	8 MB
clang++	max_random_02	AC	55 ms	8 MB
clang++	max_random_03	AC	55 ms	8 MB
clang++	max_random_04	AC	50 ms	8 MB
clang++	random_00	AC	43 ms	7 MB
clang++	random_01	AC	44 ms	8 MB
clang++	random_02	AC	27 ms	4 MB
clang++	random_03	AC	20 ms	8 MB
clang++	random_04	AC	20 ms	6 MB
clang++	small_00	AC	7 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	7 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	57 ms	8 MB
clang++	small_width_query_01	AC	58 ms	8 MB
clang++	small_width_query_02	AC	57 ms	8 MB
clang++	small_width_query_03	AC	57 ms	8 MB
clang++	small_width_query_04	AC	59 ms	8 MB

Back to top page