algo

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub dnx04/algo

:heavy_check_mark: tests/Deque_Operate_All_Composite.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/deque_operate_all_composite"

#include "../misc/macros.h"
#include "../math/ModInt.h"
#include "../math/Affine.h"
#include "../ds/SWAD.h"

void solve() {
  using Fp = modint<998244353>;
  using A = affine<Fp>;
  int q;
  cin >> q;
  SWAD swag([](const A& f, const A& g) { return f * g; }, A{});
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      int a, b;
      cin >> a >> b;
      swag.push_front({a, b});
    } else if (cmd == 1) {
      int a, b;
      cin >> a >> b;
      swag.push_back({a, b});
    } else if (cmd == 2) {
      swag.pop_front();
    } else if (cmd == 3) {
      swag.pop_back();
    } else {
      int x;
      cin >> x;
      cout << swag.query()(x) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  //   cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}
#line 1 "tests/Deque_Operate_All_Composite.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/deque_operate_all_composite"

#line 1 "misc/macros.h"
// #pragma GCC optimize("Ofast,unroll-loops")       // unroll long, simple loops
// #pragma GCC target("avx2,fma")                   // vectorizing code
// #pragma GCC target("lzcnt,popcnt,abm,bmi,bmi2")  // for fast bitset operation

#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;  // ordered_set, gp_hash_table
// using namespace __gnu_cxx; // rope

// for templates to work
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using pii = pair<i32, i32>;
using vi = vector<i32>;

// fast map
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {  // customize hash function for gp_hash_table
  int operator()(int x) const { return x ^ RANDOM; }
};
gp_hash_table<int, int, chash> table;

/* ordered set
    find_by_order(k): returns an iterator to the k-th element (0-based)
    order_of_key(k): returns the number of elements in the set that are strictly less than k
*/
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*  rope
    rope <int> cur = v.substr(l, r - l + 1);
    v.erase(l, r - l + 1);
    v.insert(v.mutable_begin(), cur);
*/
#line 2 "math/ModInt.h"

template <int mod>
struct modint {
  using M = modint;
  static_assert(mod > 0 && mod <= 2147483647);
  static constexpr int modulo = mod;
  static constexpr u32 r1 = []() {
    u32 r1 = mod;
    for (int i = 0; i < 5; ++i) r1 *= 2 - mod * r1;
    return -r1;
  }();
  static constexpr u32 r2 = -u64(mod) % mod;
  static u32 reduce(u64 x) {
    u32 y = u32(x) * r1, r = (x + u64(y) * mod) >> 32;
    return r >= mod ? r - mod : r;
  }
  u32 x;
  modint() : x(0) {}
  modint(i64 x) : x(reduce(u64(x % mod + mod) * r2)) {}
  M& operator+=(const M& a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  M& operator-=(const M& a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  M& operator*=(const M& a) {
    x = reduce(u64(x) * a.x);
    return *this;
  }
  M& operator/=(const M& a) { return *this *= a.inv(); }
  M operator-() const { return M(0) - *this; }
  M operator+(const M& a) const { return M(*this) += a; }
  M operator-(const M& a) const { return M(*this) -= a; }
  M operator*(const M& a) const { return M(*this) *= a; }
  M operator/(const M& a) const { return M(*this) /= a; }
  bool operator==(const M& a) const { return x == a.x; }
  bool operator!=(const M& a) const { return x != a.x; }
  M pow(u64 k) const {
    M res(1), b = *this;
    while (k) {
      if (k & 1) res *= b;
      b *= b, k >>= 1;
    }
    return res;
  }
  M inv() const { return pow(mod - 2); }
  friend ostream& operator<<(ostream& os, const M& a) {
    return os << reduce(a.x);
  }
  friend istream& operator>>(istream& is, M& a) {
    i64 v;
    is >> v;
    a = M(v);
    return is;
  }
};

u64 modmul(u64 x, u64 y, u64 m) { return u128(x) * y % m; }
u64 modpow(u64 x, u64 k, u64 m) {
  u64 res = 1;
  while (k) {
    if (k & 1) res = modmul(res, x, m);
    x = modmul(x, x, m);
    k >>= 1;
  }
  return res;
}
#line 1 "math/Affine.h"
template <class T>
struct affine {
  T a, b;
  constexpr affine() : a(1), b(0) {}
  constexpr affine(T a, T b) : a(a), b(b) {}
  T operator()(T x) const { return a * x + b; }
  affine operator()(const affine& f) const {
    return f * (*this);
  }
  affine operator*(const affine& g) const {  // g(f(x))
    return {a * g.a, b * g.a + g.b};
  }
  affine operator!=(const affine& g) const {
    return a != g.a || b != g.b;
  }
};
#line 1 "ds/SWAD.h"
template <class T, class F>
struct SWAD {
  vector<T> a0, a1, r0, r1;
  F f;
  T I;
  SWAD(F f, T i) : f(f), I(i) {}

 private:
  T get0() const { return r0.empty() ? I : r0.back(); }
  T get1() const { return r1.empty() ? I : r1.back(); }

  void push0(const T& x) {
    a0.eb(x), r0.eb(f(x, get0()));
  }
  void push1(const T& x) {
    a1.eb(x), r1.eb(f(get1(), x));
  }
  void rebalance() {
    int n = a0.size() + a1.size();
    int s0 = n / 2 + (a0.empty() ? n % 2 : 0);
    vector<T> a{a0};
    reverse(all(a));
    copy(all(a1), back_inserter(a));
    a0.clear(), r0.clear(), a1.clear(), r1.clear();
    for (int i = s0 - 1; i >= 0; i--) push0(a[i]);
    for (int i = s0; i < n; i++) push1(a[i]);
  }

 public:
  void push_front(const T& t) { push0(t); }
  void push_back(const T& t) { push1(t); }
  T front() const { return a0.empty() ? a1.front() : a0.back(); }
  T back() const { return a1.empty() ? a0.front() : a1.back(); }
  void pop_front() {
    if (a0.empty()) rebalance();
    assert(!a0.empty());
    a0.pop_back(), r0.pop_back();
  }
  void pop_back() {
    if (a1.empty()) rebalance();
    assert(!a1.empty());
    a1.pop_back(), r1.pop_back();
  }
  T query() { return f(get0(), get1()); }
};
#line 7 "tests/Deque_Operate_All_Composite.test.cpp"

void solve() {
  using Fp = modint<998244353>;
  using A = affine<Fp>;
  int q;
  cin >> q;
  SWAD swag([](const A& f, const A& g) { return f * g; }, A{});
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      int a, b;
      cin >> a >> b;
      swag.push_front({a, b});
    } else if (cmd == 1) {
      int a, b;
      cin >> a >> b;
      swag.push_back({a, b});
    } else if (cmd == 2) {
      swag.pop_front();
    } else if (cmd == 3) {
      swag.pop_back();
    } else {
      int x;
      cin >> x;
      cout << swag.query()(x) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  //   cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}
Back to top page