test/ds/segtree.partition_point.test.cpp

• View this file on GitHub
• Last update: 2024-11-09 00:49:07+00:00
• Problem: https://yukicoder.me/problems/3277

Depends on

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

Code

// competitive-verifier: PROBLEM https://yukicoder.me/problems/3277

#include "io.hpp"
#include "ds/segtree_binsearch.hpp"

int main() {
  int n = in, q = in;
  auto a = in.vec<int>(n);
  segment_tree_binsearch<minimum<int>> seg(all(a));
  while (q--) {
    int op = in, l = in, r = in;
    if (op == 1) {
      l--, r--;
      int tmp = seg.prod(r, r + 1);
      seg.exec(l, [&](auto& v) { swap(v, tmp); });
      seg.exec(r, [&](auto& v) { v = tmp; });
    } else {
      l--;
      int mini = seg.prod(l, r);
      int i = seg.partition_point(l, [&](auto v) { return v > mini; });
      out(i);
    }
  }
}

#line 1 "test/ds/segtree.partition_point.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/3277

#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 "io.hpp"

template <size_t BufSize = 1 << 26> class stdin_reader {
 public: stdin_reader() { buf[fread(buf, 1, sizeof(buf), stdin)] = 0; } template <class T> enable_if_t<is_integral_v<T>> read(T& x) { skip(); [[maybe_unused]] bool neg = false; if constexpr (is_signed_v<T>) neg = *p == '-' ? (p++, true) : false; x = 0; while (*p > ' ') x = x * 10 + (*p++ & 0x0F); if constexpr (is_signed_v<T>) x = neg ? -x : x; } template <class T> void_t<decltype(&T::val)> read(T& x) { x = T((unsigned)(*this)); } void read(char &c) { skip(); c = *p++; } void read(char*& q) { skip(); q = p; while (*p > ' ') p++; *p = 0; } template <size_t N> void read(char (&s)[N]) { read(s); } void read(string& s) { skip(); char* p0 = p; while (*p > ' ') p++; s.assign(p0, p); } template <class T, void_t<decltype(tuple_size<T>::value)>* = nullptr> void read(T& x) { read_tuple_impl(x, make_index_sequence<tuple_size_v<T>>{}); } template <class T, class U> void read(pair<T, U>& x) { read(x.first), read(x.second); } template <class T, size_t N> void read(T (&a)[N]) { for (auto& e : a) read(e); } template <class T> operator T() { T x; return read(x), x; } template <class... Ts> void operator()(Ts&... xs) { (read(xs), ...); } int operator--() { return (int)*this - 1; } template <class T> T* arr(int n) { T* p = new T[n + 1]; rep(i, n) read(p[i]); return p; } template <class T> void vec(vector<T>& v, int n) { v.resize(n); for (auto& e : v) read(e); } template <class T> vector<T> vec(int n) { vector<T> v; return vec(v, n), v; } auto vi(int n) { return vec<int>(n); } auto vi1(int n) { auto v = vec<int>(n); rep(i, n) v[i]--; return v; } auto vll(int n) { return vec<ll>(n); } template <class... Ts> tuple<vector<Ts>...> vecs(int n) { tuple<vector<Ts>...> res; vecs_impl(res, n, make_index_sequence<sizeof...(Ts)>{}); return res; } template <class T> void vvec(vector<vector<T>>& v, int n, int m) { v.resize(n); for (auto& e : v) vec(e, m); } template <class T> vector<vector<T>> vvec(int n, int m) { vector<vector<T>> v; return vvec(v, n, m), v; } template <class... Ts> auto cols(int n) { return transpose(vec<tuple<Ts...>>(n)); } private: char buf[BufSize], *p = buf; void skip() { while (*p <= ' ') p++; } template <class T, size_t... Is> void read_tuple_impl(T& x, index_sequence<Is...>) { (*this)(get<Is>(x)...); } template <class T, size_t... Is> void vecs_impl(T& x, int n, index_sequence<Is...>) { (vec(get<Is>(x), n), ...); } template <class T, size_t... Is> static auto transpose_impl(const vector<T>& v, index_sequence<Is...>) { tuple<vector<decay_t<tuple_element_t<Is, T>>>...> w; (get<Is>(w).reserve(v.size()), ...); for (const auto& row : v) (get<Is>(w).push_back(get<Is>(row)), ...); return w; } template <class T> static auto transpose(const vector<T>& v) { return transpose_impl(v, make_index_sequence<tuple_size_v<T>>{}); }
};
template <size_t BufSize = 1 << 26> class stdout_writer {
 public: ~stdout_writer() { flush(); } void flush() { fwrite(buf, 1, p - buf, stdout), p = buf; } void write_char(char c) { *p++ = c; } void write() {} void write(char c) { write_char(c); } template <class T> enable_if_t<is_integral_v<T>> write(T x) { if (!x) return write_char('0'); if constexpr (is_signed_v<T>) if (x < 0) write_char('-'), x = -x; static char tmp[16]; char* q = end(tmp); while (x >= 10000) memcpy(q -= 4, digits.data + x % 10000 * 4, 4), x /= 10000; if (x < 10) write_char('0' + x); else if (x < 100) write_char('0' + (uint8_t)x / 10), write_char('0' + (uint8_t)x % 10); else if (x < 1000) memcpy(p, digits.data + x * 4 + 1, 3), p += 3; else memcpy(p, digits.data + x * 4, 4), p += 4; memcpy(p, q, end(tmp) - q), p += end(tmp) - q; } template <class T> void_t<decltype(&T::val)> write(T x) { write(x.val()); } void write(double x) { static char tmp[40]; sprintf(tmp, "%.15f", x); write(tmp); } void write(long double x) { static char tmp[40]; sprintf(tmp, "%.15Lf", x); write(tmp); } void write(const char* s) { while (*s) *p++ = *s++; } void write(const string& s) { memcpy(p, s.c_str(), s.size()), p += s.size(); } template <class T, class U> void write(const pair<T, U>& x) { write(x.first), write_char(' '), write(x.second); } template <class... Ts> void write(const tuple<Ts...>& x) { write_tuple(x, make_index_sequence<sizeof...(Ts)>{}); } template <class... Ts> void write(const Ts&... xs) { ((write(xs), write_char(' ')), ...), --p; } template <class... Ts> void writeln(const Ts&... xs) { write(xs...), write_char('\n'); } template <class... Ts> void operator()(const Ts&... xs) { writeln(xs...); } template <class It> void iter(It first, It last, char sep = ' ') { if (first == last) write_char('\n'); else { while (first != last) write(*first++), write_char(sep); p[-1] = '\n'; } } template <class It> void iter1(It first, It last, char sep = ' ') { if (first == last) write_char('\n'); else { while (first != last) write(1 + *first++), write_char(sep); p[-1] = '\n'; } } template <class T> void vec(const vector<T>& v, char sep = ' ') { iter(all(v), sep); } template <class T> void write(const vector<T>& v) { vec(v), p--; } template <class T> void vec1(const vector<T>& v, char sep = ' ') { iter1(all(v), sep); } void del() { *--p = 0; } void Yes(bool b = true) { writeln(b ? "Yes" : "No"); } void YES(bool b = true) { writeln(b ? "YES" : "NO"); } void Takahashi(bool b = true) { writeln(b ? "Takahashi" : "Aoki"); } private: char buf[BufSize], *p = buf; template <class T, size_t... Is> void write_tuple(const T& x, index_sequence<Is...>) { ((write(get<Is>(x)), write_char(' ')), ...), --p; } struct four_digits { char data[40000]; constexpr four_digits() : data() { for (int i = 0; i < 10000; i++) for (int n = i, j = 4; j--;) data[i * 4 + j] = n % 10 + '0', n /= 10; } } static constexpr digits{}; public:
#define INSTANT(s) void s() { writeln(#s); }
  INSTANT(No) INSTANT(NO) INSTANT(Aoki) INSTANT(possible) INSTANT(Possible) INSTANT(POSSIBLE) INSTANT(impossible) INSTANT(Impossible) INSTANT(IMPOSSIBLE)
#undef INSTANT
};
stdin_reader<> in;
stdout_writer<> out;
#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 3 "ds/segtree_binsearch.hpp"

template <class M>
class segment_tree_binsearch : public segment_tree<M> {
 public:
  using segment_tree<M>::segment_tree;
  using value_type = segment_tree<M>::value_type;

  // min r s.t. !f(prod(l, r)) or size()+1 if no such r exists
  template <class F>
  int partition_point(int l, F f) const {
    if (!f(this->m.unit())) return l;
    if (f(this->data[1])) return this->size() + 1;
    if (l < this->size() && !f(this->data[l + this->size()])) return l + 1;
    int r = l + this->size();
    while (r % 2 == 0) r /= 2;
    value_type acc = this->m.unit();
    do {
      value_type acc2 = this->m.op(acc, this->data[r]);
      if (f(acc2)) {
        acc = acc2, r++;
        while (r % 2 == 0) r /= 2;
      } else if (r < this->size()) {
        r *= 2;
      }
    } while (r < this->size());
    if (f(this->m.op(acc, this->data[r]))) r++;
    r = r + 1 - this->size();
    return r <= l ? this->size() + 1 : r;
  }

  // max l s.t. !f(prod(l, r)) or -1 if no such l exists
  template <class F>
  int rpartition_point(int r, F f) const {
    if (!f(this->m.unit())) return r;
    if (f(this->data[1])) return -1;
    if (r > 0 && !f(this->data[r - 1 + this->size()])) return r - 1;
    int l = r + this->size() - 1;
    while (l % 2 == 1 && l > 1) l /= 2;
    value_type acc = this->m.unit();
    do {
      value_type acc2 = this->m.op(this->data[l], acc);
      if (f(acc2)) {
        acc = acc2, l--;
        while (l % 2 == 1 && l > 1) l /= 2;
      } else if (l < this->size()) {
        l = l * 2 + 1;
      }
    } while (l < this->size());
    if (f(this->m.op(this->data[l], acc))) l--;
    l = l - this->size();
    return l >= r ? -1 : l;
  }
  // min r s.t. prod(l, r) >= x
  template <class Comp = less<>>
  int lower_bound(int l, value_type x, Comp comp = Comp()) const {
    return partition_point(l, [&](auto y) { return comp(y, x); });
  }
  // max l s.t. prod(l, r) >= x
  template <class Comp = less<>>
  int rlower_bound(int r, value_type x, Comp comp = Comp()) const {
    return rpartition_point(r, [&](auto y) { return comp(y, x); });
  }
};
#line 5 "test/ds/segtree.partition_point.test.cpp"

int main() {
  int n = in, q = in;
  auto a = in.vec<int>(n);
  segment_tree_binsearch<minimum<int>> seg(all(a));
  while (q--) {
    int op = in, l = in, r = in;
    if (op == 1) {
      l--, r--;
      int tmp = seg.prod(r, r + 1);
      seg.exec(l, [&](auto& v) { swap(v, tmp); });
      seg.exec(r, [&](auto& v) { v = tmp; });
    } else {
      l--;
      int mini = seg.prod(l, r);
      int i = seg.partition_point(l, [&](auto v) { return v > mini; });
      out(i);
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-12	00_sample_01	AC	127 ms	10 MB
g++-12	22_random_01	AC	23 ms	10 MB
g++-12	22_random_02	AC	24 ms	10 MB
g++-12	22_random_03	AC	24 ms	10 MB
g++-12	22_random_04	AC	24 ms	10 MB
g++-12	22_random_05	AC	23 ms	10 MB
g++-12	22_random_06	AC	23 ms	10 MB
g++-12	22_random_07	AC	23 ms	10 MB
g++-12	22_random_08	AC	24 ms	10 MB
g++-12	22_random_09	AC	24 ms	10 MB
g++-12	22_random_10	AC	23 ms	10 MB
g++-12	33_large_01	AC	55 ms	14 MB
g++-12	33_large_02	AC	49 ms	15 MB
g++-12	33_large_03	AC	45 ms	14 MB
g++-12	33_large_04	AC	45 ms	14 MB
g++-12	33_large_05	AC	53 ms	14 MB
g++-12	43_max_01	AC	59 ms	14 MB
g++-12	43_max_02	AC	61 ms	12 MB
g++-12	43_max_03	AC	61 ms	12 MB

Back to top page