test/verify/yosupo-queue-operate-all-composite.test.cpp

View this file on GitHub
Last update: 2026-08-10 14:38:36+00:00
Problem: https://judge.yosupo.jp/problem/queue_operate_all_composite

Depends on

Code

// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/queue_operate_all_composite
// clang-format on

#include <iostream>
#include <utility>
#include <vector>

#include "../../math/combinatorics/montgomery-mod-int.hpp"
#include "../../structure/class/affine.hpp"
#include "../../structure/others/queue-operate-aggregation.hpp"

using namespace std;

using mint = modint998244353;

int main() {
  int Q;
  cin >> Q;
  using pi = Affine<mint>;
  auto f = [](const pi& a, const pi& b) -> pi { return pi::op(a, b); };
  auto que = get_queue_operate_aggregation<pi>(f);
  while (Q--) {
    int t;
    cin >> t;
    if (t == 0) {
      mint a, b;
      cin >> a >> b;
      que.push(pi(a, b));
    } else if (t == 1) {
      que.pop();
    } else {
      mint x;
      cin >> x;
      if (que.empty()) {
        cout << x << "\n";
      } else {
        auto s = que.all_prod();
        cout << s.eval(x) << "\n";
      }
    }
  }
}

#line 1 "test/verify/yosupo-queue-operate-all-composite.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/queue_operate_all_composite
// clang-format on

#include <iostream>
#include <utility>
#include <vector>

#line 2 "math/combinatorics/montgomery-mod-int.hpp"

#include <cstdint>
#line 5 "math/combinatorics/montgomery-mod-int.hpp"

template <std::uint32_t mod_, bool fast = false>
struct MontgomeryModInt {
 private:
  using mint = MontgomeryModInt;
  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;

  static constexpr u32 get_r() {
    u32 ret = mod_;
    for (i32 i = 0; i < 4; i++) ret *= 2 - mod_ * ret;
    return ret;
  }

  static constexpr u32 r = get_r();

  static constexpr u32 n2 = -u64(mod_) % mod_;

  static_assert(r * mod_ == 1, "invalid, r * mod != 1");
  static_assert(mod_ < (1 << 30), "invalid, mod >= 2 ^ 30");
  static_assert((mod_ & 1) == 1, "invalid, mod % 2 == 0");

  u32 x;

 public:
  MontgomeryModInt() : x{} {}

  MontgomeryModInt(const i64& a)
      : x(reduce(u64(fast ? a : (a % mod() + mod())) * n2)) {}

  static constexpr u32 reduce(const u64& b) {
    return u32(b >> 32) + mod() - u32((u64(u32(b) * r) * mod()) >> 32);
  }

  mint& operator+=(const mint& p) {
    if (i32(x += p.x - 2 * mod()) < 0) x += 2 * mod();
    return *this;
  }

  mint& operator-=(const mint& p) {
    if (i32(x -= p.x) < 0) x += 2 * mod();
    return *this;
  }

  mint& operator*=(const mint& p) {
    x = reduce(u64(x) * p.x);
    return *this;
  }

  mint& operator/=(const mint& p) {
    *this *= p.inv();
    return *this;
  }

  mint operator-() const { return mint() - *this; }

  mint operator+(const mint& p) const { return mint(*this) += p; }

  mint operator-(const mint& p) const { return mint(*this) -= p; }

  mint operator*(const mint& p) const { return mint(*this) *= p; }

  mint operator/(const mint& p) const { return mint(*this) /= p; }

  bool operator==(const mint& p) const {
    return (x >= mod() ? x - mod() : x) == (p.x >= mod() ? p.x - mod() : p.x);
  }

  bool operator!=(const mint& p) const {
    return (x >= mod() ? x - mod() : x) != (p.x >= mod() ? p.x - mod() : p.x);
  }

  u32 val() const {
    u32 ret = reduce(x);
    return ret >= mod() ? ret - mod() : ret;
  }

  mint pow(u64 n) const {
    mint ret(1), mul(*this);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  mint inv() const { return pow(mod() - 2); }

  friend std::ostream& operator<<(std::ostream& os, const mint& p) {
    return os << p.val();
  }

  friend std::istream& operator>>(std::istream& is, mint& a) {
    i64 t;
    is >> t;
    a = mint(t);
    return is;
  }

  static constexpr u32 mod() { return mod_; }
};

template <std::uint32_t mod>
using modint = MontgomeryModInt<mod>;
using modint998244353 = modint<998244353>;
using modint1000000007 = modint<1000000007>;
#line 2 "structure/class/affine.hpp"

template <typename T>
struct Affine {
  T a, b;  // ax+b
  Affine() : a(1), b(0) {}
  Affine(T a, T b) : a(a), b(b) {}
  T eval(T x) const { return a * x + b; }
  static constexpr Affine op(const Affine& l, const Affine& r) {
    return {l.a * r.a, l.b * r.a + r.b};
  }
  constexpr bool operator==(const Affine& p) const {
    return a == p.a and b == p.b;
  }
  constexpr bool operator!=(const Affine& p) const {
    return a != p.a or b != p.b;
  }
};
#line 2 "structure/others/queue-operate-aggregation.hpp"

#include <cassert>
#include <cstddef>
#line 6 "structure/others/queue-operate-aggregation.hpp"

template <typename T, typename F>
struct QueueOperateAggregation {
 private:
  struct Node {
    T val, sum;

    Node(const T& val, const T& sum) : val(val), sum(sum) {}
  };
  const F f;
  std::vector<Node> st[2];

 public:
  QueueOperateAggregation() = default;

  explicit QueueOperateAggregation(F f) : f(f) {}

  bool empty() const { return st[0].empty() and st[1].empty(); }

  std::size_t size() const { return st[0].size() + st[1].size(); }

  T all_prod() const {
    assert(not empty());
    if (st[0].empty()) {
      return st[1].back().sum;
    } else if (st[1].empty()) {
      return st[0].back().sum;
    } else {
      return f(st[0].back().sum, st[1].back().sum);
    }
  }

  void push(const T& x) {
    if (st[1].empty()) {
      st[1].emplace_back(x, x);
    } else {
      st[1].emplace_back(x, f(st[1].back().sum, x));
    }
  }

  void pop() {
    assert(not empty());
    if (st[0].empty()) {
      st[0].emplace_back(st[1].back().val, st[1].back().val);
      st[1].pop_back();
      while (not st[1].empty()) {
        st[0].emplace_back(st[1].back().val,
                           f(st[1].back().val, st[0].back().sum));
        st[1].pop_back();
      }
    }
    st[0].pop_back();
  }
};

template <typename T, typename F>
QueueOperateAggregation<T, F> get_queue_operate_aggregation(const F& f) {
  return QueueOperateAggregation<T, F>{f};
}
#line 12 "test/verify/yosupo-queue-operate-all-composite.test.cpp"

using namespace std;

using mint = modint998244353;

int main() {
  int Q;
  cin >> Q;
  using pi = Affine<mint>;
  auto f = [](const pi& a, const pi& b) -> pi { return pi::op(a, b); };
  auto que = get_queue_operate_aggregation<pi>(f);
  while (Q--) {
    int t;
    cin >> t;
    if (t == 0) {
      mint a, b;
      cin >> a >> b;
      que.push(pi(a, b));
    } else if (t == 1) {
      que.pop();
    } else {
      mint x;
      cin >> x;
      if (que.empty()) {
        cout << x << "\n";
      } else {
        auto s = que.all_prod();
        cout << s.eval(x) << "\n";
      }
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	2 ms	4 MB
g++	example_01	AC	2 ms	4 MB
g++	large_max_00	AC	510 ms	13 MB
g++	large_max_01	AC	351 ms	14 MB
g++	large_min_00	AC	428 ms	4 MB
g++	large_min_01	AC	377 ms	4 MB
g++	large_triangle_00	AC	353 ms	5 MB
g++	large_triangle_01	AC	452 ms	5 MB
g++	max_random_00	AC	733 ms	13 MB
g++	max_random_01	AC	450 ms	12 MB
g++	max_random_02	AC	440 ms	13 MB
g++	random_00	AC	472 ms	6 MB
g++	random_01	AC	392 ms	7 MB
g++	random_02	AC	80 ms	4 MB
g++	small_00	AC	2 ms	4 MB
g++	small_01	AC	2 ms	4 MB
g++	small_02	AC	2 ms	4 MB
g++	small_03	AC	2 ms	4 MB
g++	small_04	AC	2 ms	4 MB
clang++	example_00	AC	2 ms	4 MB
clang++	example_01	AC	2 ms	4 MB
clang++	large_max_00	AC	518 ms	14 MB
clang++	large_max_01	AC	344 ms	14 MB
clang++	large_min_00	AC	598 ms	4 MB
clang++	large_min_01	AC	360 ms	4 MB
clang++	large_triangle_00	AC	421 ms	5 MB
clang++	large_triangle_01	AC	357 ms	5 MB
clang++	max_random_00	AC	430 ms	12 MB
clang++	max_random_01	AC	536 ms	13 MB
clang++	max_random_02	AC	425 ms	12 MB
clang++	random_00	AC	283 ms	6 MB
clang++	random_01	AC	348 ms	7 MB
clang++	random_02	AC	55 ms	4 MB
clang++	small_00	AC	2 ms	4 MB
clang++	small_01	AC	2 ms	4 MB
clang++	small_02	AC	2 ms	4 MB
clang++	small_03	AC	2 ms	4 MB
clang++	small_04	AC	2 ms	4 MB