結果
問題 | No.1202 お菓子の食べ方 |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-08-28 22:32:39 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 381 ms / 2,000 ms |
コード長 | 4,895 bytes |
コンパイル時間 | 3,635 ms |
コンパイル使用メモリ | 151,684 KB |
実行使用メモリ | 52,204 KB |
最終ジャッジ日時 | 2023-09-04 09:23:26 |
合計ジャッジ時間 | 16,555 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 381 ms
50,704 KB |
testcase_01 | AC | 271 ms
51,688 KB |
testcase_02 | AC | 272 ms
51,652 KB |
testcase_03 | AC | 272 ms
50,416 KB |
testcase_04 | AC | 270 ms
52,204 KB |
testcase_05 | AC | 271 ms
51,656 KB |
testcase_06 | AC | 277 ms
51,124 KB |
testcase_07 | AC | 277 ms
51,144 KB |
testcase_08 | AC | 279 ms
50,912 KB |
testcase_09 | AC | 276 ms
51,368 KB |
testcase_10 | AC | 77 ms
31,344 KB |
testcase_11 | AC | 98 ms
37,052 KB |
testcase_12 | AC | 179 ms
42,312 KB |
testcase_13 | AC | 77 ms
33,124 KB |
testcase_14 | AC | 179 ms
46,164 KB |
testcase_15 | AC | 72 ms
30,344 KB |
testcase_16 | AC | 136 ms
41,508 KB |
testcase_17 | AC | 97 ms
35,008 KB |
testcase_18 | AC | 97 ms
37,092 KB |
testcase_19 | AC | 72 ms
32,712 KB |
testcase_20 | AC | 144 ms
39,124 KB |
testcase_21 | AC | 144 ms
44,228 KB |
testcase_22 | AC | 78 ms
32,736 KB |
testcase_23 | AC | 124 ms
36,864 KB |
testcase_24 | AC | 126 ms
38,776 KB |
testcase_25 | AC | 72 ms
30,084 KB |
testcase_26 | AC | 153 ms
40,004 KB |
testcase_27 | AC | 137 ms
39,172 KB |
testcase_28 | AC | 90 ms
34,476 KB |
testcase_29 | AC | 103 ms
38,596 KB |
testcase_30 | AC | 64 ms
28,936 KB |
testcase_31 | AC | 65 ms
29,268 KB |
testcase_32 | AC | 65 ms
29,752 KB |
testcase_33 | AC | 64 ms
29,948 KB |
testcase_34 | AC | 66 ms
29,464 KB |
testcase_35 | AC | 64 ms
28,900 KB |
testcase_36 | AC | 66 ms
29,464 KB |
testcase_37 | AC | 63 ms
28,976 KB |
testcase_38 | AC | 65 ms
29,856 KB |
testcase_39 | AC | 65 ms
30,076 KB |
testcase_40 | AC | 274 ms
51,232 KB |
testcase_41 | AC | 277 ms
51,196 KB |
testcase_42 | AC | 273 ms
51,180 KB |
testcase_43 | AC | 269 ms
51,468 KB |
testcase_44 | AC | 274 ms
51,144 KB |
ソースコード
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) { } }