Submit Info #53888

Problem Lang User Status Time Memory
Queue Operate All Composite d hos AC 241 ms 32.46 MiB

ケース詳細
Name Status Time Memory
example_00 AC 15 ms 2.70 MiB
example_01 AC 3 ms 0.97 MiB
large_max_00 AC 222 ms 31.46 MiB
large_max_01 AC 220 ms 31.72 MiB
large_min_00 AC 218 ms 32.46 MiB
large_min_01 AC 222 ms 32.46 MiB
large_triangle_00 AC 226 ms 32.46 MiB
large_triangle_01 AC 217 ms 32.46 MiB
max_random_00 AC 241 ms 31.96 MiB
max_random_01 AC 239 ms 32.09 MiB
max_random_02 AC 239 ms 32.09 MiB
random_00 AC 182 ms 28.34 MiB
random_01 AC 228 ms 30.84 MiB
random_02 AC 26 ms 3.84 MiB
small_00 AC 3 ms 0.97 MiB
small_01 AC 3 ms 1.07 MiB
small_02 AC 3 ms 1.02 MiB
small_03 AC 3 ms 0.96 MiB
small_04 AC 3 ms 1.08 MiB

import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct Queue(T, alias op) { import std.functional : binaryFun; alias opFun = binaryFun!op; int asLen, bsLen; T[] as, aas, bs, bbs; this(int n) { asLen = bsLen = 0; reserve(n); } void reserve(int n) { assert(asLen + bsLen <= n); as.length = aas.length = bs.length = bbs.length = n; } void reduce() { for (; bsLen != 0; ) { as[asLen] = bs[bsLen - 1]; aas[asLen] = (asLen == 0) ? bs[bsLen - 1] : opFun(bs[bsLen - 1], aas[asLen - 1]); ++asLen; --bsLen; } } void push(T t) { insertBack(t); } void pop() { removeFront(); } T get() { if (asLen == 0) reduce(); assert(asLen != 0); return (bsLen == 0) ? aas[asLen - 1] : opFun(aas[asLen - 1], bbs[bsLen - 1]); } bool empty() const { return (asLen == 0 && bsLen == 0); } void clear() { asLen = bsLen = 0; } T front() { if (asLen == 0) reduce(); assert(asLen != 0); return as[asLen - 1]; } void insertBack(T t) { bs[bsLen] = t; bbs[bsLen] = (bsLen == 0) ? t : opFun(bbs[bsLen - 1], t); ++bsLen; } void removeFront() { if (asLen == 0) reduce(); assert(asLen != 0); --asLen; } } struct ModInt(uint M_) { import std.conv : to; alias M = M_; uint x; this(ModInt a) { x = a.x; } this(uint x_) { x = x_ % M; } this(ulong x_) { x = x_ % M; } this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; } this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); } ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); } ref ModInt opOpAssign(string op, T)(T a) { static if (is(T == ModInt)) { static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; } else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; } else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } else static if (op == "^^") { if (a < 0) return this = inv()^^(-a); ModInt b = this, c = 1U; for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; } return this = c; } else { return mixin("this " ~ op ~ "= ModInt(a)"); } } ModInt inv() const { uint a = M, b = x; int y = 0, z = 1; for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; } assert(a == 1); return ModInt(y); } ModInt opUnary(string op)() const { static if (op == "+") { return this; } else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; } else static assert(false); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0U); } string toString() const { return x.to!string; } } enum MO = 998244353; alias Mint = ModInt!MO; // x -> a x + b struct Func { Mint a, b; // f o this Func opBinary(string op : "*")(in Func f) const { return Func(f.a * a, f.a * b + f.b); } } void main() { try { for (; ; ) { const Q = readInt(); auto que = Queue!(Func, "a * b")(Q); foreach (q; 0 .. Q) { const typ = readInt(); final switch (typ) { case 0: { const Mint a = readInt(); const Mint b = readInt(); que.push(Func(a, b)); } break; case 1: { que.pop(); } break; case 2: { const Mint x = readInt(); const f = que.empty() ? Func(Mint(1), Mint(0)) : que.get(); writeln(f.a * x + f.b); } break; } } } } catch (EOFException e) { } }