Test/SlidingWindowAggregation.test.cpp

• View this file on GitHub
• Last update: 2021-06-05 13:56:14+09:00
• Problem: https://judge.yosupo.jp/problem/queue_operate_all_composite

Depends on

• Sliding Window Aggregation (SWAG) (DataStructure/SlidingWindowAggregation.hpp)
• ModInt 構造体 (Mathematics/ModInt.hpp)

Code

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

#include "DataStructure/SlidingWindowAggregation.hpp"
#include "Mathematics/ModInt.hpp"

#include <cstdio>
#include <utility>

int main() {
	int Q;
	scanf("%d", &Q);
	
	using mint = ModInt<998244353>;
	using P = std::pair<mint, mint>;
	
	SlidingWindowAggregation<P> swag({1, 0}, [](const auto & x, const auto & y) -> P {
		return {x.first * y.first, x.second * y.first + y.second};
	});
	
	while (Q--) {
		int q;
		scanf("%d", &q);
		if (q == 0) {
			int a, b;
			scanf("%d %d", &a, &b);
			swag.push({a, b});
		}
		else if (q == 1) swag.pop();
		else {
			int x;
			scanf("%d", &x);
			auto res = swag.fold_all();
			printf("%d\n", (res.first * x + res.second).val());
		}
	}
}

#line 1 "Test/SlidingWindowAggregation.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/queue_operate_all_composite"

#line 1 "DataStructure/SlidingWindowAggregation.hpp"



#include <cassert>
#include <vector>
#include <functional>

/**
 * @brief https://tkmst201.github.io/Library/DataStructure/SlidingWindowAggregation.hpp
 */
template<typename T>
struct SlidingWindowAggregation {
	using value_type = T;
	using const_reference = const value_type &;
	using size_type = std::size_t;
	using F = std::function<value_type (const_reference, const_reference)>;
	
private:
	value_type id_elem;
	F f;
	std::vector<value_type> lstack, rstack;
	value_type rsum;
	
public:
	SlidingWindowAggregation(const_reference id_elem, const F & f)
		: id_elem(id_elem), f(f), lstack(1, id_elem), rsum(id_elem) {}
	
	size_type size() const noexcept {
		return lstack.size() - 1 + rstack.size();
	}
	
	void push(const_reference x) {
		rstack.emplace_back(x);
		rsum = f(rsum, x);
	}
	
	void pop() {
		assert(size() > 0);
		if (lstack.size() == 1) {
			while (rstack.size() > 1) {
				lstack.emplace_back(f(rstack.back(), lstack.back()));
				rstack.pop_back();
			}
			rstack.pop_back();
			rsum = id_elem;
		}
		else lstack.pop_back();
	}
	
	value_type fold_all() const {
		return f(lstack.back(), rsum);
	}
};


#line 1 "Mathematics/ModInt.hpp"



#line 5 "Mathematics/ModInt.hpp"
#include <iostream>
#include <cstdint>

/**
 * @brief https://tkmst201.github.io/Library/Mathematics/ModInt.hpp
 */
template<int M>
struct ModInt {
	static_assert(M > 0);
	
	using value_type = int;
	using calc_type = std::int_fast64_t;
	
private:
	value_type val_;
	
public:
	constexpr ModInt(calc_type val = 0) : val_(val % M + (val >= 0 ? 0 : M)) {}
	constexpr value_type val() const noexcept { return val_; }
	constexpr static decltype(M) mod() noexcept { return M; }
	
	explicit constexpr operator bool() const noexcept { return val_; }
	constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
	constexpr ModInt operator +() const noexcept { return *this; }
	constexpr ModInt operator -() const noexcept { return ModInt(val_ == 0 ? 0 : M - val_); }
	constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
	constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
	constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
	constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
	constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
	constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
	constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
	constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
	friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
	friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
	friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
	friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
	friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
	friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
	friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
	friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
	
	constexpr ModInt pow(calc_type n) const noexcept {
		ModInt res = 1, x = val_;
		if (n < 0) { x = x.inv(); n = -n; }
		while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
		return res;
	}
	
	constexpr ModInt inv() const noexcept {
		value_type a = val_, a1 = 1, b = M, b1 = 0;
		while (b > 0) {
			const value_type q = a / b;
			value_type tmp = a - q * b; a = b; b = tmp;
			tmp = a1 - q * b1; a1 = b1; b1 = tmp;
		}
		assert(a == 1);
		if (a1 < 0) a1 += M;
		return a1;
	}
};


#line 5 "Test/SlidingWindowAggregation.test.cpp"

#include <cstdio>
#include <utility>

int main() {
	int Q;
	scanf("%d", &Q);
	
	using mint = ModInt<998244353>;
	using P = std::pair<mint, mint>;
	
	SlidingWindowAggregation<P> swag({1, 0}, [](const auto & x, const auto & y) -> P {
		return {x.first * y.first, x.second * y.first + y.second};
	});
	
	while (Q--) {
		int q;
		scanf("%d", &q);
		if (q == 0) {
			int a, b;
			scanf("%d %d", &a, &b);
			swag.push({a, b});
		}
		else if (q == 1) swag.pop();
		else {
			int x;
			scanf("%d", &x);
			auto res = swag.fold_all();
			printf("%d\n", (res.first * x + res.second).val());
		}
	}
}

Back to top page