結果

問題 No.2003 Frog on Grid
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-07-09 00:22:05
言語 D
(dmd 2.106.1)
結果
TLE  
実行時間 -
コード長 4,703 bytes
コンパイル時間 1,726 ms
コンパイル使用メモリ 153,556 KB
実行使用メモリ 142,148 KB
最終ジャッジ日時 2024-06-22 15:44:01
合計ジャッジ時間 5,858 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
13,764 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 1 ms
6,944 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 1 ms
6,940 KB
testcase_12 AC 1 ms
6,944 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 1 ms
6,944 KB
testcase_16 AC 1 ms
6,944 KB
testcase_17 AC 30 ms
11,340 KB
testcase_18 AC 79 ms
15,592 KB
testcase_19 AC 42 ms
19,844 KB
testcase_20 TLE -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
権限があれば一括ダウンロードができます

ソースコード

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(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 H = readInt;
      const W = readInt;
      const K = readInt;
      auto C = new string[H];
      foreach (x; 0 .. H) {
        C[x] = readToken;
      }
      
      auto dp = new Mint[][](H, W);
      auto naname = new Mint[][](H, W);
      auto tate = new Mint[][](H, W);
      foreach (x; 0 .. H) {
        Mint now;
        foreach (y; 0 .. W) {
          if (y == 0) {
            foreach (xx; 0 .. x) if (x - xx <= K) {
              now += dp[xx][0];
            }
          } else {
            now += dp[x][y - 1];
            const s = x + y - 1 - K;
            if (s >= 0) {
              const xx = min(x, s);
              now -= naname[xx][s - xx];
              if (x - K - 1 >= 0) {
                now += naname[x - K - 1][y];
              }
            }
            if (x - 1 >= 0) {
              now += tate[x - 1][y];
            }
            if (x - K - 1 >= 0) {
              now -= tate[x - K - 1][y];
            }
          }
          if (C[x][y] == '.') {
            dp[x][y] = now;
            if (x == 0 && y == 0) {
              dp[x][y] += 1;
            }
          }
          naname[x][y] = dp[x][y];
          if (x - 1 >= 0 && y + 1 < W) {
            naname[x][y] += naname[x - 1][y + 1];
          }
          tate[x][y] = dp[x][y];
          if (x - 1 >= 0) {
            tate[x][y] += tate[x - 1][y];
          }
        }
      }
      debug {
        foreach (x; 0 .. H) {
          writeln(dp[x]);
        }
      }
      
      writeln(dp[H - 1][W - 1]);
    }
  } catch (EOFException e) {
  }
}
0