This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/queue_operate_all_composite
#include "../../template/template.hpp"
#include "../../math/combinatorics/montgomery-mod-int.hpp"
#include "../../structure/others/sliding-window-aggregation.hpp"
using mint = modint998244353;
int main() {
int Q;
cin >> Q;
using pi = pair< mint, mint >;
auto f = [](const pi &a, const pi &b) -> pi {
return {a.first * b.first, a.second * b.first + b.second};
};
SlidingWindowAggregation< pi > swa(f);
while(Q--) {
int t;
cin >> t;
if(t == 0) {
mint a, b;
cin >> a >> b;
swa.push(pi(a, b));
} else if(t == 1) {
swa.pop();
} else {
mint x;
cin >> x;
if(swa.empty()) {
cout << x << "\n";
} else {
auto s = swa.fold_all();
cout << s.first * x + s.second << "\n";
}
}
}
}
#line 1 "test/verify/yosupo-queue-operate-all-composite.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/queue_operate_all_composite
#line 1 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t) fill_v(e, v);
}
template <typename F>
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/yosupo-queue-operate-all-composite.test.cpp"
#line 2 "math/combinatorics/montgomery-mod-int.hpp"
template <uint32_t mod_, bool fast = false>
struct MontgomeryModInt {
private:
using mint = MontgomeryModInt;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = 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 ostream &operator<<(ostream &os, const mint &p) {
return os << p.val();
}
friend istream &operator>>(istream &is, mint &a) {
i64 t;
is >> t;
a = mint(t);
return is;
}
static constexpr u32 mod() { return mod_; }
};
template <uint32_t mod>
using modint = MontgomeryModInt<mod>;
using modint998244353 = modint<998244353>;
using modint1000000007 = modint<1000000007>;
#line 6 "test/verify/yosupo-queue-operate-all-composite.test.cpp"
#line 1 "structure/others/sliding-window-aggregation.hpp"
template <typename SemiGroup>
struct SlidingWindowAggregation {
using F = function<SemiGroup(SemiGroup, SemiGroup)>;
struct Node {
SemiGroup val, sum;
Node(const SemiGroup &val, const SemiGroup &sum) : val(val), sum(sum) {}
};
SlidingWindowAggregation(F f) : f(f) {}
const F f;
stack<Node> front, back;
bool empty() const { return front.empty() && back.empty(); }
size_t size() const { return front.size() + back.size(); }
SemiGroup fold_all() const {
if (front.empty()) {
return back.top().sum;
} else if (back.empty()) {
return front.top().sum;
} else {
return f(front.top().sum, back.top().sum);
}
}
void push(const SemiGroup &x) {
if (back.empty()) {
back.emplace(x, x);
} else {
back.emplace(x, f(back.top().sum, x));
}
}
void pop() {
if (front.empty()) {
front.emplace(back.top().val, back.top().val);
back.pop();
while (!back.empty()) {
front.emplace(back.top().val, f(back.top().val, front.top().sum));
back.pop();
}
}
front.pop();
}
};
#line 8 "test/verify/yosupo-queue-operate-all-composite.test.cpp"
using mint = modint998244353;
int main() {
int Q;
cin >> Q;
using pi = pair< mint, mint >;
auto f = [](const pi &a, const pi &b) -> pi {
return {a.first * b.first, a.second * b.first + b.second};
};
SlidingWindowAggregation< pi > swa(f);
while(Q--) {
int t;
cin >> t;
if(t == 0) {
mint a, b;
cin >> a >> b;
swa.push(pi(a, b));
} else if(t == 1) {
swa.pop();
} else {
mint x;
cin >> x;
if(swa.empty()) {
cout << x << "\n";
} else {
auto s = swa.fold_all();
cout << s.first * x + s.second << "\n";
}
}
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | example_00 | AC | 6 ms | 4 MB |
g++ | example_01 | AC | 6 ms | 4 MB |
g++ | large_max_00 | AC | 83 ms | 8 MB |
g++ | large_max_01 | AC | 84 ms | 8 MB |
g++ | large_min_00 | AC | 70 ms | 4 MB |
g++ | large_min_01 | AC | 72 ms | 4 MB |
g++ | large_triangle_00 | AC | 69 ms | 4 MB |
g++ | large_triangle_01 | AC | 68 ms | 4 MB |
g++ | max_random_00 | AC | 91 ms | 9 MB |
g++ | max_random_01 | AC | 89 ms | 9 MB |
g++ | max_random_02 | AC | 91 ms | 9 MB |
g++ | random_00 | AC | 64 ms | 5 MB |
g++ | random_01 | AC | 74 ms | 5 MB |
g++ | random_02 | AC | 14 ms | 4 MB |
g++ | small_00 | AC | 6 ms | 4 MB |
g++ | small_01 | AC | 6 ms | 4 MB |
g++ | small_02 | AC | 6 ms | 4 MB |
g++ | small_03 | AC | 6 ms | 4 MB |
g++ | small_04 | AC | 6 ms | 4 MB |
clang++ | example_00 | AC | 6 ms | 4 MB |
clang++ | example_01 | AC | 6 ms | 4 MB |
clang++ | large_max_00 | AC | 82 ms | 8 MB |
clang++ | large_max_01 | AC | 84 ms | 8 MB |
clang++ | large_min_00 | AC | 69 ms | 4 MB |
clang++ | large_min_01 | AC | 69 ms | 4 MB |
clang++ | large_triangle_00 | AC | 66 ms | 4 MB |
clang++ | large_triangle_01 | AC | 67 ms | 4 MB |
clang++ | max_random_00 | AC | 91 ms | 9 MB |
clang++ | max_random_01 | AC | 91 ms | 9 MB |
clang++ | max_random_02 | AC | 92 ms | 9 MB |
clang++ | random_00 | AC | 61 ms | 5 MB |
clang++ | random_01 | AC | 74 ms | 5 MB |
clang++ | random_02 | AC | 14 ms | 4 MB |
clang++ | small_00 | AC | 6 ms | 4 MB |
clang++ | small_01 | AC | 6 ms | 4 MB |
clang++ | small_02 | AC | 6 ms | 4 MB |
clang++ | small_03 | AC | 6 ms | 4 MB |
clang++ | small_04 | AC | 6 ms | 4 MB |