test/ds/segtree.rmq.test.cpp

• View this file on GitHub
• Last update: 2024-11-09 00:49:07+00:00
• Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_A

Depends on

• algebra.hpp
• ds/segtree.hpp
• prelude.hpp

Code

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_A

#include "prelude.hpp"
#include "ds/segtree.hpp"

int main() {
  int n, q, c, x, y;
  scanf("%d%d", &n, &q);
  segment_tree rmq(n, monoid(CONST(INT_MAX), WRAP_FN(min)));
  while (q--) {
    scanf("%d%d%d", &c, &x, &y);
    if (c == 0)
      rmq.set(x, y);
    else
      printf("%d\n", rmq.prod(x, y + 1));
  }
}

#line 1 "test/ds/segtree.rmq.test.cpp"
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_A

#line 2 "prelude.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vc = vector<char>;
#define rep2(i, m, n) for (auto i = (m); i < (n); i++)
#define rep(i, n) rep2(i, 0, n)
#define repr2(i, m, n) for (auto i = (n); i-- > (m);)
#define repr(i, n) repr2(i, 0, n)
#define all(x) begin(x), end(x)
auto ndvec(int n, auto e) { return vector(n, e); }
auto ndvec(int n, auto ...e) { return vector(n, ndvec(e...)); }
auto comp_key(auto&& f) { return [&](auto&& a, auto&& b) { return f(a) < f(b); }; }
auto& max(const auto& a, const auto& b) { return a < b ? b : a; }
auto& min(const auto& a, const auto& b) { return b < a ? b : a; }
#if __cpp_lib_ranges
namespace R = std::ranges;
namespace V = std::views;
#endif
#line 3 "algebra.hpp"

#define CONST(val) [=] { return val; }
#define WRAP_FN(func) \
  [](auto&&... args) { return func(forward<decltype(args)>(args)...); }

template <class Unit, class Op>
struct monoid : private Unit, private Op {
  using type = decltype(declval<Unit>()());
  monoid(Unit unit, Op op) : Unit(unit), Op(op) {}
  type unit() const { return Unit::operator()(); }
  type op(type a, type b) const { return Op::operator()(a, b); }
};

template <class Unit, class Op, class Inv>
struct group : monoid<Unit, Op>, private Inv {
  using type = typename monoid<Unit, Op>::type;
  group(Unit unit, Op op, Inv inv) : monoid<Unit, Op>(unit, op), Inv(inv) {}
  type inv(type a) const { return Inv::operator()(a); }
};

template <class T>
struct addition {
  using type = T;
  type unit() const { return 0; }
  type op(type a, type b) const { return a + b; }
  type inv(type a) const { return -a; }
};

template <class T>
struct maximum {
  using type = T;
  type unit() const { return numeric_limits<T>::min(); }
  type op(type a, type b) const { return a > b ? a : b; }
};

template <class T>
struct minimum {
  using type = T;
  type unit() const { return numeric_limits<T>::max(); }
  type op(type a, type b) const { return a > b ? b : a; }
};

template <class T, T nul = -1>
struct assign {
  using type = T;
  type unit() const { return nul; }
  type op(type a, type b) const { return b == nul ? a : b; }
};
#line 3 "ds/segtree.hpp"

template <class M>
class segment_tree {
 public:
  using value_type = typename M::type;
  template <class Iter>
  segment_tree(Iter f, Iter l, M m = M()) : m(m), data((l - f) * 2) {
    copy(f, l, data.begin() + (l - f));
    init();
  }
  template <class F>
  segment_tree(int n, F f, M m = M()) : m(m), data(n * 2) {
    rep(i, n) data[i + n] = f(i);
    init();
  }
  segment_tree(int n = 0, M m = M()) : m(m), data(n * 2, m.unit()) {}

  int size() const { return data.size() / 2; }
  value_type prod(int l, int r) const {
    value_type accl = m.unit(), accr = m.unit();
    for (l += size(), r += size(); l < r; l >>= 1, r >>= 1) {
      if (l & 1) accl = m.op(accl, data[l++]);
      if (r & 1) accr = m.op(data[--r], accr);
    }
    return m.op(accl, accr);
  }
  void mul(int i, value_type v) {
    exec(i, [&](value_type& e) { e = m.op(e, v); });
  }
  void set(int i, value_type v) {
    exec(i, [&](value_type& e) { e = v; });
  }
  template <class F>
  void exec(int i, F f) {
    f(data[i + size()]);
    for (i += size(); i >>= 1;) data[i] = m.op(data[i << 1], data[i << 1 | 1]);
  }

 protected:
  M m;
  vector<value_type> data;

  void init() {
    repr2(i, 1, size()) data[i] = m.op(data[i << 1], data[i << 1 | 1]);
  }
};
#line 5 "test/ds/segtree.rmq.test.cpp"

int main() {
  int n, q, c, x, y;
  scanf("%d%d", &n, &q);
  segment_tree rmq(n, monoid(CONST(INT_MAX), WRAP_FN(min)));
  while (q--) {
    scanf("%d%d%d", &c, &x, &y);
    if (c == 0)
      rmq.set(x, y);
    else
      printf("%d\n", rmq.prod(x, y + 1));
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-12	00_small_00.in	AC	12 ms	8 MB
g++-12	00_small_01.in	AC	12 ms	8 MB
g++-12	00_small_02.in	AC	11 ms	8 MB
g++-12	00_small_03.in	AC	11 ms	8 MB
g++-12	01_rand_00.in	AC	11 ms	8 MB
g++-12	01_rand_01.in	AC	11 ms	8 MB
g++-12	01_rand_02.in	AC	12 ms	8 MB
g++-12	01_rand_03.in	AC	11 ms	8 MB
g++-12	02_biased_00.in	AC	12 ms	8 MB
g++-12	02_biased_01.in	AC	11 ms	8 MB
g++-12	02_biased_02.in	AC	11 ms	8 MB
g++-12	02_biased_03.in	AC	44 ms	8 MB
g++-12	03_rand_00.in	AC	11 ms	8 MB
g++-12	03_rand_01.in	AC	15 ms	8 MB
g++-12	03_rand_02.in	AC	15 ms	8 MB
g++-12	03_rand_03.in	AC	15 ms	8 MB
g++-12	03_rand_04.in	AC	53 ms	9 MB
g++-12	03_rand_05.in	AC	54 ms	9 MB
g++-12	04_maximum_00.in	AC	53 ms	8 MB
g++-12	04_maximum_01.in	AC	53 ms	9 MB

Back to top page