Tifa's CP Library

:heavy_check_mark: deque_with_w (src/code/ds/deque_with_w.hpp)

Depends on

Verified with

Code

#ifndef TIFALIBS_DS_DEQUE_WITH_W
#define TIFALIBS_DS_DEQUE_WITH_W

#include "../util/util.hpp"

namespace tifa_libs::ds {

template <class T, auto e, auto op>
requires requires(T a, T b) {
  { e() } -> std::same_as<T>;
  { op(a, b) } -> std::same_as<T>;
}
class deque_with_w {
  // front [q[0].back        q[0].front][q[1].front       q[1].back] back
  vvec<T> q, s;
  constexpr void bf() {
    s[0].resize(q[0].size() + 1);
    s[0][0] = e();
    for (u32 i = 0; i < q[0].size(); ++i) s[0][i + 1] = op(q[0][i], s[0][i]);
    s[1].resize(q[1].size() + 1);
    s[1][0] = e();
    for (u32 i = 0; i < q[1].size(); ++i) s[1][i + 1] = op(s[1][i], q[1][i]);
  }

 public:
  explicit constexpr deque_with_w() : q(2), s(2) { bf(); }

  constexpr void push_front(T x) {
    q[0].push_back(x);
    if (s[0].size()) s[0].push_back(op(x, s[0].back()));
    else s[0].push_back(x);
  }
  constexpr void push_back(T x) {
    q[1].push_back(x);
    if (s[1].size()) s[1].push_back(op(s[1].back(), x));
    else s[1].push_back(x);
  }
  constexpr T pop_front() {
    if (q[0].empty()) {
      u32 lessHalf = u32(q[1].size()) / 2;
      q[0] = vec<T>(q[1].rbegin() + lessHalf, q[1].rend());
      q[1] = vec<T>(q[1].end() - lessHalf, q[1].end());
      bf();
    }
    T ret = q[0].back();
    q[0].pop_back(), s[0].pop_back();
    return ret;
  }
  constexpr T pop_back() {
    if (q[1].empty()) {
      u32 lessHalf = u32(q[0].size()) / 2;
      q[1] = vec<T>(q[0].rbegin() + lessHalf, q[0].rend());
      q[0] = vec<T>(q[0].end() - lessHalf, q[0].end());
      bf();
    }
    T ret = q[1].back();
    q[1].pop_back(), s[1].pop_back();
    return ret;
  }
  constexpr T w() { return op(s[0].back(), s[1].back()); }
};

}  // namespace tifa_libs::ds

#endif
#line 1 "src/code/ds/deque_with_w.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/deque_with_w.hpp"

namespace tifa_libs::ds {

template <class T, auto e, auto op>
requires requires(T a, T b) {
  { e() } -> std::same_as<T>;
  { op(a, b) } -> std::same_as<T>;
}
class deque_with_w {
  // front [q[0].back        q[0].front][q[1].front       q[1].back] back
  vvec<T> q, s;
  constexpr void bf() {
    s[0].resize(q[0].size() + 1);
    s[0][0] = e();
    for (u32 i = 0; i < q[0].size(); ++i) s[0][i + 1] = op(q[0][i], s[0][i]);
    s[1].resize(q[1].size() + 1);
    s[1][0] = e();
    for (u32 i = 0; i < q[1].size(); ++i) s[1][i + 1] = op(s[1][i], q[1][i]);
  }

 public:
  explicit constexpr deque_with_w() : q(2), s(2) { bf(); }

  constexpr void push_front(T x) {
    q[0].push_back(x);
    if (s[0].size()) s[0].push_back(op(x, s[0].back()));
    else s[0].push_back(x);
  }
  constexpr void push_back(T x) {
    q[1].push_back(x);
    if (s[1].size()) s[1].push_back(op(s[1].back(), x));
    else s[1].push_back(x);
  }
  constexpr T pop_front() {
    if (q[0].empty()) {
      u32 lessHalf = u32(q[1].size()) / 2;
      q[0] = vec<T>(q[1].rbegin() + lessHalf, q[1].rend());
      q[1] = vec<T>(q[1].end() - lessHalf, q[1].end());
      bf();
    }
    T ret = q[0].back();
    q[0].pop_back(), s[0].pop_back();
    return ret;
  }
  constexpr T pop_back() {
    if (q[1].empty()) {
      u32 lessHalf = u32(q[0].size()) / 2;
      q[1] = vec<T>(q[0].rbegin() + lessHalf, q[0].rend());
      q[0] = vec<T>(q[0].end() - lessHalf, q[0].end());
      bf();
    }
    T ret = q[1].back();
    q[1].pop_back(), s[1].pop_back();
    return ret;
  }
  constexpr T w() { return op(s[0].back(), s[1].back()); }
};

}  // namespace tifa_libs::ds


Back to top page