結果
問題 | No.2302 Carry X Times |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-05-12 21:30:08 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 15 ms / 2,000 ms |
コード長 | 4,391 bytes |
コンパイル時間 | 1,351 ms |
コンパイル使用メモリ | 151,964 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 17:54:59 |
合計ジャッジ時間 | 2,335 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 24 |
ソースコード
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; }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 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 = cast(uint)(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;void main() {try {for (; ; ) {const numCases = readInt;foreach (caseId; 0 .. numCases) {const N = readLong;const X = readInt;const S = N.to!string;const L = cast(int)(S.length);// <=?, <=?, carryauto dp = new Mint[][][][][](L + 1, 2, 2, L + 1, 2);dp[0][1][1][0][0] = 1;foreach (i; 0 .. L) {const s = S[L - 1 - i] - '0';foreach (a; 0 .. 2) foreach (b; 0 .. 2) foreach (k; 0 .. i + 1) foreach (c; 0 .. 2) {const f = dp[i][a][b][k][c];if (f) {debug {if (N <= 10) {writeln(i, " ", a, " ", b, " ", k, " ", c, ": ", f);}}foreach (x; 0 .. 10) foreach (y; 0 .. 10) {const aa = (x < s) ? 1 : (x == s) ? a : 0;const bb = (y < s) ? 1 : (y == s) ? b : 0;const cc = (c + x + y >= 10) ? 1 : 0;const kk = k + cc;dp[i + 1][aa][bb][kk][cc] += f;}}}}Mint ans;if (X <= L) {foreach (c; 0 .. 2) {ans += dp[L][1][1][X][c];}}writeln(ans);}}} catch (EOFException e) {}}