# Submit Info #2637

Problem Lang User Status Time Memory
Queue Operate All Composite cpp tute7627 WA 130 ms 7.84 MiB

ケース詳細
Name Status Time Memory
example_00 AC 7 ms 0.62 MiB
example_01 AC 6 ms 0.54 MiB
large_max_00 WA 117 ms 6.62 MiB
large_max_01 WA 118 ms 6.63 MiB
large_min_00 WA 98 ms 2.21 MiB
large_min_01 WA 99 ms 2.26 MiB
large_triangle_00 WA 97 ms 3.05 MiB
large_triangle_01 WA 97 ms 3.08 MiB
max_random_00 AC 129 ms 7.80 MiB
max_random_01 AC 130 ms 7.83 MiB
max_random_02 AC 128 ms 7.84 MiB
random_00 WA 87 ms 3.24 MiB
random_01 WA 101 ms 3.67 MiB
random_02 WA 17 ms 1.00 MiB
small_00 AC 6 ms 0.62 MiB
small_01 AC 5 ms 0.63 MiB
small_02 AC 7 ms 0.67 MiB
small_03 AC 4 ms 0.62 MiB
small_04 WA 5 ms 0.59 MiB

#include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define test cout<<"test"<<endl; #define fi first #define se second #define MP make_pair #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; //const ll MOD = 1e9+7; const ll MOD = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T> void chmin(T &a,T b){if(a>b)a=b;} template<typename T> void chmax(T &a,T b){if(a<b)a=b;} void pmod(ll &a,ll b){a=(a+b)%MOD;} void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;} void qmod(ll &a,ll b){a=(a*b)%MOD;} void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2> void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++) {for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0]; for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T> vector<vector<T>>vec(ll x, ll y, T w){ vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,0,-1,0,1,1,-1,-1}; vector<ll>dy={0,1,0,-1,1,-1,1,-1}; template<typename T> vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts> auto make_v(size_t a,Ts... ts){ return vector<decltype(make_v(ts...))>(a,make_v(ts...)); } ostream &operator<<(ostream &os, pair<ll, ll>&p){ return os << p.first << " " << p.second; } template< int mod > struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } }; using modint = ModInt< MOD >; modint pow2(int64_t n, int64_t x){ return modint(n).pow(x); } template<typename T> struct SWAG{ stack<pair<T,T>>st_front,st_back; T func(T x, T y){return MP(x.fi*y.fi, x.se*y.fi+y.se);} void push_front(T x){ if(st_front.empty())st_front.emplace(x,x); else st_front.emplace(x,func(x, st_front.top().second)); } void push_back(T x){ if(st_back.empty())st_back.emplace(x,x); else st_back.emplace(x,func(st_back.top().second,x)); } void pop_front(){ if(st_front.empty()){ assert(!st_back.empty()); vector<T>tmp(st_back.size()); for(ll i=(ll)tmp.size()-1;i>=0;i--){ tmp[i] = st_back.top().first; st_back.pop(); } for(ll i=(((ll)tmp.size()-1)>>1);i>=0;i--)push_front(tmp[i]); for(ll i=(((ll)tmp.size()+1)>>1);i<tmp.size();i++)push_back(tmp[i]); } st_front.pop(); } void pop_back(){ if(st_back.empty()){ assert(!st_front.empty()); vector<T>tmp(st_front.size()); for(ll i=(ll)tmp.size()-1;i>=0;i--){ tmp[i] = st_front.top().first; st_front.pop(); } for(ll i=(((ll)tmp.size()-1)>>1);i>=0;i--)push_back(tmp[i]); for(ll i=(((ll)tmp.size()+1)>>1);i<tmp.size();i++)push_front(tmp[i]); } st_back.pop(); } T query(){ assert(!st_front.empty()||!st_back.empty()); if(st_front.empty())return st_back.top().second; else if(st_back.empty())return st_front.top().second; else func(st_front.top().second, st_back.top().second); } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; SWAG<pair<modint,modint>>sw; ll q;cin>>q; while(q--){ ll p;cin>>p; if(p==0){ ll a,b;cin>>a>>b; sw.push_back(MP(a,b)); } if(p==1){ sw.pop_front(); } if(p==2){ ll x;cin>>x; if(sw.st_back.empty()&&sw.st_front.empty())cout<<x<<endl; else{ auto k=sw.query(); cout<<k.fi*x+k.se<<endl; } } } return 0; }