結果

問題 No.1202 お菓子の食べ方
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-08-28 22:32:39
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 259 ms / 2,000 ms
コード長 4,895 bytes
コンパイル時間 1,385 ms
コンパイル使用メモリ 155,720 KB
実行使用メモリ 51,940 KB
最終ジャッジ日時 2024-06-22 08:27:25
合計ジャッジ時間 11,455 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 237 ms
51,572 KB
testcase_01 AC 259 ms
50,868 KB
testcase_02 AC 236 ms
49,280 KB
testcase_03 AC 237 ms
50,344 KB
testcase_04 AC 234 ms
51,716 KB
testcase_05 AC 232 ms
51,668 KB
testcase_06 AC 238 ms
50,532 KB
testcase_07 AC 234 ms
51,652 KB
testcase_08 AC 234 ms
50,832 KB
testcase_09 AC 252 ms
51,940 KB
testcase_10 AC 65 ms
32,412 KB
testcase_11 AC 82 ms
35,772 KB
testcase_12 AC 155 ms
43,336 KB
testcase_13 AC 63 ms
31,484 KB
testcase_14 AC 145 ms
45,192 KB
testcase_15 AC 58 ms
32,844 KB
testcase_16 AC 116 ms
40,164 KB
testcase_17 AC 86 ms
35,036 KB
testcase_18 AC 83 ms
36,636 KB
testcase_19 AC 64 ms
32,148 KB
testcase_20 AC 126 ms
39,760 KB
testcase_21 AC 131 ms
43,096 KB
testcase_22 AC 65 ms
31,920 KB
testcase_23 AC 109 ms
39,160 KB
testcase_24 AC 110 ms
40,284 KB
testcase_25 AC 65 ms
29,224 KB
testcase_26 AC 135 ms
40,456 KB
testcase_27 AC 119 ms
40,012 KB
testcase_28 AC 76 ms
34,332 KB
testcase_29 AC 90 ms
36,512 KB
testcase_30 AC 60 ms
28,808 KB
testcase_31 AC 60 ms
29,708 KB
testcase_32 AC 56 ms
29,612 KB
testcase_33 AC 58 ms
28,904 KB
testcase_34 AC 55 ms
28,596 KB
testcase_35 AC 57 ms
28,504 KB
testcase_36 AC 54 ms
29,464 KB
testcase_37 AC 56 ms
29,808 KB
testcase_38 AC 60 ms
28,612 KB
testcase_39 AC 60 ms
29,116 KB
testcase_40 AC 249 ms
51,780 KB
testcase_41 AC 237 ms
50,312 KB
testcase_42 AC 236 ms
50,200 KB
testcase_43 AC 236 ms
51,452 KB
testcase_44 AC 243 ms
49,644 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; }
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 = 1000000007;
alias Mint = ModInt!MO;

enum LIM = 2 * 10^^6 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
  } else {
    return Mint(0);
  }
}


void main() {
  prepare;
  
  try {
    for (; ; ) {
      const M = readInt();
      const N = readInt();
      auto S = new int[][](M, N);
      foreach (x; 0 .. M) foreach (y; 0 .. N) {
        S[x][y] = readInt();
      }
      
      Mint ans;
      foreach (x; 0 .. M + 1) foreach (y; 0 .. N + 1) {
        Mint here;
        if (x == 0 && y == 0) {
          here += 1;
        } else {
          if (x > 0 && y < N) {
            here += binom(x + y - 1, x - 1) * binom((x + y) + (S[x - 1][y] - 1), x + y);
          }
          if (x < M && y > 0) {
            here += binom(x + y - 1, x) * binom((x + y) + (S[x][y - 1] - 1), x + y);
          }
        }
        debug {
          writeln(x, " ", y, ": ", here);
        }
        ans += here;
      }
      writeln(ans);
      
      debug {
        if (S[0][0] <= 4) {
          int brt;
          auto brts = new int[][](M + 1, N + 1);
          void dfs(int x, int y, int d, string s) {
            if (x == M || y == N || S[x][y] - d <= 0) {
              writeln(x, " ", y, " ", s);
              ++brt;
              ++brts[x][y];
            } else {
              dfs(x + 1, y, d, s ~ "x");
              dfs(x, y + 1, d, s ~ "y");
              dfs(x, y, d + 1, s ~ "y");
            }
          }
          dfs(0, 0, 0, "");
          writeln("brt = ", brt);
          writeln("brts = ", brts);
        }
      }
    }
  } catch (EOFException e) {
  }
}
0