結果

問題 No.2951 Similar to Mex
ユーザー 👑 hos.lyrichos.lyric
提出日時 2024-10-25 21:58:33
言語 D
(dmd 2.106.1)
結果
RE  
実行時間 -
コード長 4,250 bytes
コンパイル時間 2,711 ms
コンパイル使用メモリ 152,120 KB
実行使用メモリ 132,796 KB
最終ジャッジ日時 2024-10-25 21:58:45
合計ジャッジ時間 11,131 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 3 ms
6,820 KB
testcase_04 AC 1 ms
6,816 KB
testcase_05 AC 3 ms
6,820 KB
testcase_06 RE -
testcase_07 RE -
testcase_08 AC 2 ms
6,820 KB
testcase_09 RE -
testcase_10 AC 2 ms
6,820 KB
testcase_11 AC 54 ms
34,060 KB
testcase_12 RE -
testcase_13 RE -
testcase_14 AC 97 ms
58,840 KB
testcase_15 RE -
testcase_16 AC 61 ms
37,368 KB
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 AC 118 ms
70,300 KB
testcase_22 AC 100 ms
61,176 KB
testcase_23 AC 194 ms
130,300 KB
testcase_24 AC 150 ms
109,312 KB
testcase_25 AC 173 ms
118,652 KB
testcase_26 AC 148 ms
109,124 KB
testcase_27 AC 201 ms
132,392 KB
testcase_28 AC 191 ms
127,080 KB
testcase_29 RE -
testcase_30 AC 204 ms
129,808 KB
testcase_31 AC 198 ms
128,552 KB
testcase_32 RE -
testcase_33 RE -
testcase_34 AC 201 ms
132,112 KB
testcase_35 RE -
testcase_36 AC 1 ms
6,820 KB
testcase_37 RE -
testcase_38 AC 2 ms
6,820 KB
testcase_39 AC 2 ms
6,820 KB
testcase_40 AC 191 ms
132,164 KB
testcase_41 RE -
testcase_42 AC 194 ms
132,796 KB
testcase_43 RE -
testcase_44 AC 200 ms
131,848 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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 N = readInt;
      const M = readInt;
      const K = readInt;
      
      auto fac = new Mint[N + 1];
      fac[0] = 1;
      foreach (i; 1 .. N + 1) fac[i] = fac[i - 1] * i;
      auto S = new Mint[][](N + 1, N + 1);
      foreach (n; 0 .. N + 1) {
        S[n][0] = 0;
        S[n][n] = 1;
        foreach (k; 1 .. n) S[n][k] = S[n - 1][k - 1] + k * S[n - 1][k];
      }
      
      // value, mex, # used
      const lim = max(M, K);
      auto dp = new Mint[][][](lim + 2, M + 2, M + 1);
      dp[lim + 1][lim + 1][0] = 1;
      foreach_reverse (a; 1 .. lim + 1) {
        foreach (m; a + 1 .. lim + 2) foreach (k; 0 .. M + 1) if (dp[a + 1][m][k]) {
          // skip
          dp[a][a][k] += ((a <= K) ? a : 1) * dp[a + 1][m][k];
          // use
          if (a <= M) {
            dp[a][m][k + 1] += ((a <= K) ? m : 1) * dp[a + 1][m][k];
          }
        }
      }
      
      Mint ans;
      foreach (m; 1 .. M + 2) foreach (k; 0 .. M + 1) if (k <= N) {
        ans += dp[1][m][k] * S[N][k] * fac[k];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0