結果

問題 No.1513 simple 門松列 problem
コンテスト
ユーザー hos.lyric
提出日時 2021-05-21 22:02:46
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 450 ms / 3,000 ms
コード長 4,230 bytes
コンパイル時間 1,764 ms
コンパイル使用メモリ 155,112 KB
実行使用メモリ 72,292 KB
最終ジャッジ日時 2024-06-22 11:21:15
合計ジャッジ時間 4,615 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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; }
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 ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readInt();
      
      auto dp0 = new Mint[][][](N + 1, K, K);
      auto dp1 = new Mint[][][](N + 1, K, K);
      foreach (b; 0 .. K) foreach (a; 0 .. K) {
        dp0[2][b][a] = 1;
        dp1[2][b][a] = a + b;
      }
      auto sum0 = new Mint[K + 1];
      auto sum1 = new Mint[K + 1];
      foreach (n; 3 .. N + 1) {
        foreach (b; 0 .. K) {
          foreach (a; 0 .. K) {
            sum0[a + 1] = sum0[a] + dp0[n - 1][b][a];
            sum1[a + 1] = sum1[a] + dp1[n - 1][b][a];
          }
          foreach (c; 0 .. b) {
            // [0, b) \ {c}
            dp0[n][c][b] = (sum0[b] - dp0[n - 1][b][c]);
            dp1[n][c][b] = (sum1[b] - dp1[n - 1][b][c]) + (sum0[b] - dp0[n - 1][b][c]) * c;
          }
          foreach (c; b + 1 .. K) {
            // (b, K) \ {c}
            dp0[n][c][b] = (sum0[K] - sum0[b + 1] - dp0[n - 1][b][c]);
            dp1[n][c][b] = (sum1[K] - sum1[b + 1] - dp1[n - 1][b][c]) + (sum0[K] - sum0[b + 1] - dp0[n - 1][b][c]) * c;
          }
        }
      }
      
      Mint ans0, ans1;
      foreach (b; 0 .. K) {
        foreach (a; 0 .. K) {
          ans0 += dp0[N][b][a];
          ans1 += dp1[N][b][a];
        }
      }
      writeln(ans0, " ", ans1);
    }
  } catch (EOFException e) {
  }
}
0