#define PROBLEM "https://judge.yosupo.jp/problem/queue_operate_all_composite" #include "../../math/mod_int998244353.hpp" #include "../swag.hpp" #include "../../functional/composite.hpp" #include "../../util/template.hpp" int main(){ lint n; cin>>n; swag<pair<mint,mint>,composite<mint>>sw; while(n--){ lint c; cin>>c; if(c==0){ lint s,t; cin>>s>>t; sw.push(make_pair(s,t)); } if(c==1){ sw.pop(); } if(c==2){ lint x; cin>>x; cout<<composite<mint>()(make_pair(0,x),sw.fold().unwrap_or(make_pair(1,0))).second<<endl; } } }
#line 1 "data_structure/test/LC_swag.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/queue_operate_all_composite" #line 2 "math/mod_int.hpp" #include<cstdint> #include<iostream> #include<vector> /** * @brief ModInt */ template<int MOD> struct mod_int { using mint=mod_int<MOD>; using u64 = std::uint_fast64_t; u64 a; constexpr mod_int(const long long x = 0)noexcept:a(x>=0?x%get_mod():get_mod()-(-x)%get_mod()){} constexpr u64 &value()noexcept{return a;} constexpr const u64 &value() const noexcept {return a;} constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;} constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;} constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;} constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;} constexpr mint &operator+=(const mint rhs) noexcept { a += rhs.a; if (a >= get_mod())a -= get_mod(); return *this; } constexpr mint &operator-=(const mint rhs) noexcept { if (a<rhs.a)a += get_mod(); a -= rhs.a; return *this; } constexpr mint &operator*=(const mint rhs) noexcept { a = a * rhs.a % get_mod(); return *this; } constexpr mint operator++(int) noexcept { a += 1; if (a >= get_mod())a -= get_mod(); return *this; } constexpr mint operator--(int) noexcept { if (a<1)a += get_mod(); a -= 1; return *this; } constexpr mint &operator/=(mint rhs) noexcept { u64 exp=get_mod()-2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } constexpr bool operator==(mint x) noexcept { return a==x.a; } constexpr bool operator!=(mint x) noexcept { return a!=x.a; } constexpr bool operator<(mint x) noexcept { return a<x.a; } constexpr bool operator>(mint x) noexcept { return a>x.a; } constexpr bool operator<=(mint x) noexcept { return a<=x.a; } constexpr bool operator>=(mint x) noexcept { return a>=x.a; } constexpr static int root(){ mint root = 2; while(root.pow((get_mod()-1)>>1).a==1)root++; return root.a; } constexpr mint pow(long long n)const{ long long x=a; mint ret = 1; while(n>0) { if(n&1)(ret*=x); (x*=x)%=get_mod(); n>>=1; } return ret; } constexpr mint inv(){ return pow(get_mod()-2); } static std::vector<mint> fac; static std::vector<mint> ifac; static bool init; constexpr static int mx=10000001; void build()const{ init=0; fac.resize(mx); ifac.resize(mx); fac[0]=1,ifac[0]=1; for(int i=1;i<mx;i++)fac[i]=fac[i-1]*i; ifac[mx-1]=fac[mx-1].inv(); for(int i=mx-2;i>=0;i--)ifac[i]=ifac[i+1]*(i+1); } mint comb(long long b){ if(init)build(); if(a<0||b<0)return 0; if(a==0&&b==0)return 1; if((long long)a<b)return 0; return fac[a]*ifac[a-b]*ifac[b]; } mint fact()const{ if(init)build(); return fac[a]; } mint fact_inv()const{ if(init)build(); return ifac[a]; } friend std::ostream& operator<<(std::ostream& lhs, const mint& rhs) noexcept { lhs << rhs.a; return lhs; } friend std::istream& operator>>(std::istream& lhs,mint& rhs) noexcept { lhs >> rhs.a; return lhs; } constexpr static bool is_static=true; constexpr static u64 get_mod(){ return MOD; } }; template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::fac; template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::ifac; template<int MOD>bool mod_int<MOD>::init=1; #line 3 "math/mod_int998244353.hpp" using mint=mod_int<998'244'353>; /** * @brief ModInt(998'244'353) */ #line 2 "data_structure/swag.hpp" #include<stack> #include<tuple> #include<cmath> #line 2 "alga/maybe.hpp" #include<cassert> /** * @brief Maybe * @see https://ja.wikipedia.org/wiki/%E3%83%A2%E3%83%8A%E3%83%89_(%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0)#Maybe%E3%83%A2%E3%83%8A%E3%83%89 */ template<typename T> struct maybe{ bool _is_none; T val; maybe():_is_none(true){} maybe(T val):_is_none(false),val(val){} T unwrap()const{ assert(!_is_none); return val; } T unwrap_or(T e)const{ return _is_none?e:val; } bool is_none()const{return _is_none;} bool is_some()const{return !_is_none;} }; template<typename T,typename F> auto expand(F op){ return [&op](const maybe<T>& s,const maybe<T>& t){ if(s.is_none())return t; if(t.is_none())return s; return maybe<T>(op(s.unwrap(),t.unwrap())); }; } #line 6 "data_structure/swag.hpp" /** * @brief SWAG(Queue) */ template<typename T,typename F> class swag{ std::stack<std::pair<T,T>>front,back; F f; public: swag(F f=F()):f(f){} inline int size(){ return front.size()+back.size(); } inline int empty(){ return front.empty()&&back.empty(); } void push(T val){ if(back.empty()){ back.emplace(val,val); }else{ back.emplace(val,f(back.top().second,val)); } } void pop(){ if(front.empty()){ while(!back.empty()){ const T val=back.top().first; back.pop(); if(front.empty())front.emplace(val,val); else front.emplace(val,f(val,front.top().second)); } } front.pop(); } maybe<T> fold(){ if(front.empty()&&back.empty())return maybe<T>(); else if(front.empty()||back.empty())return front.empty()?back.top().second:front.top().second; return f(front.top().second,back.top().second); } }; #line 3 "functional/composite.hpp" /** * @brief 一次関数の合成 */ template<typename T> struct composite{ //t(s(x)) std::pair<T,T> operator()(const std::pair<T,T>& s,const std::pair<T,T>& t){ return std::make_pair(s.first*t.first,s.second*t.first+t.second); } }; #line 2 "util/template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #include<bits/stdc++.h> using namespace std; struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__; typedef long long lint; #define INF (1LL<<60) #define IINF (1<<30) #define EPS (1e-10) #define endl ('\n') typedef vector<lint> vec; typedef vector<vector<lint>> mat; typedef vector<vector<vector<lint>>> mat3; typedef vector<string> svec; typedef vector<vector<string>> smat; template<typename T>using V=vector<T>; template<typename T>using VV=V<V<T>>; template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;} template<typename T>inline void output2(T t){for(auto i:t)output(i);} template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;} template<typename T>inline void debug2(T t){for(auto i:t)output(i);} #define loop(n) for(long long _=0;_<(long long)(n);++_) #define _overload4(_1,_2,_3,_4,name,...) name #define __rep(i,a) repi(i,0,a,1) #define _rep(i,a,b) repi(i,a,b,1) #define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c) #define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__) #define _overload3_rev(_1,_2,_3,name,...) name #define _rep_rev(i,a) repi_rev(i,0,a) #define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i) #define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__) // #define rep(i,...) for(auto i:range(__VA_ARGS__)) // #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__))) // #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i) // #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i) // #define irep(i) for(lint i=0;;++i) // inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;} // inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;} // inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;} // template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;} #define all(n) begin(n),end(n) template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;} template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;} const vector<lint> dx={1,0,-1,0,1,1,-1,-1}; const vector<lint> dy={0,1,0,-1,1,-1,1,-1}; #define SUM(v) accumulate(all(v),0LL) template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} #define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__})) #define bit(n,a) ((n>>a)&1) vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;} using graph=vector<vector<int>>; template<typename T>using graph_w=vector<vector<pair<int,T>>>; template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;} constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;} #line 6 "data_structure/test/LC_swag.test.cpp" int main(){ lint n; cin>>n; swag<pair<mint,mint>,composite<mint>>sw; while(n--){ lint c; cin>>c; if(c==0){ lint s,t; cin>>s>>t; sw.push(make_pair(s,t)); } if(c==1){ sw.pop(); } if(c==2){ lint x; cin>>x; cout<<composite<mint>()(make_pair(0,x),sw.fold().unwrap_or(make_pair(1,0))).second<<endl; } } }