結果
問題 | No.1111 コード進行 |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-07-10 21:29:08 |
言語 | D (dmd 2.105.2) |
結果 |
AC
|
実行時間 | 171 ms / 2,000 ms |
コード長 | 3,681 bytes |
コンパイル時間 | 1,535 ms |
コンパイル使用メモリ | 151,984 KB |
実行使用メモリ | 131,972 KB |
最終ジャッジ日時 | 2023-09-04 08:27:01 |
合計ジャッジ時間 | 5,116 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 3 ms
4,376 KB |
testcase_06 | AC | 4 ms
6,268 KB |
testcase_07 | AC | 4 ms
5,056 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 4 ms
4,376 KB |
testcase_10 | AC | 5 ms
8,804 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 5 ms
6,624 KB |
testcase_13 | AC | 3 ms
4,740 KB |
testcase_14 | AC | 5 ms
8,384 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 5 ms
7,356 KB |
testcase_17 | AC | 5 ms
7,824 KB |
testcase_18 | AC | 3 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 3 ms
4,408 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 6 ms
10,204 KB |
testcase_23 | AC | 4 ms
4,776 KB |
testcase_24 | AC | 4 ms
5,316 KB |
testcase_25 | AC | 6 ms
8,548 KB |
testcase_26 | AC | 6 ms
5,288 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 37 ms
62,532 KB |
testcase_29 | AC | 23 ms
31,228 KB |
testcase_30 | AC | 38 ms
42,336 KB |
testcase_31 | AC | 6 ms
10,648 KB |
testcase_32 | AC | 63 ms
43,092 KB |
testcase_33 | AC | 61 ms
28,456 KB |
testcase_34 | AC | 27 ms
51,748 KB |
testcase_35 | AC | 41 ms
71,856 KB |
testcase_36 | AC | 71 ms
63,200 KB |
testcase_37 | AC | 26 ms
19,660 KB |
testcase_38 | AC | 29 ms
19,244 KB |
testcase_39 | AC | 95 ms
52,564 KB |
testcase_40 | AC | 78 ms
64,956 KB |
testcase_41 | AC | 43 ms
71,684 KB |
testcase_42 | AC | 38 ms
34,100 KB |
testcase_43 | AC | 52 ms
34,876 KB |
testcase_44 | AC | 15 ms
16,236 KB |
testcase_45 | AC | 36 ms
50,628 KB |
testcase_46 | AC | 16 ms
6,888 KB |
testcase_47 | AC | 171 ms
131,972 KB |
testcase_48 | AC | 16 ms
6,852 KB |
testcase_49 | AC | 16 ms
8,456 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 = 10^^9 + 7; alias Mint = ModInt!MO; enum L = 305; void main() { try { for (; ; ) { const N = readInt(); const M = readInt(); const K = readInt(); auto P = new int[M]; auto Q = new int[M]; auto C = new int[M]; foreach (i; 0 .. M) { P[i] = readInt() - 1; Q[i] = readInt() - 1; C[i] = readInt(); } auto dp = new Mint[][][](N, L, K + 1); foreach (l; 0 .. L) { dp[0][l][0] = 1; } foreach (n; 0 .. N - 1) { foreach (i; 0 .. M) { foreach (k; 0 .. K - C[i] + 1) { dp[n + 1][Q[i]][k + C[i]] += dp[n][P[i]][k]; } } } Mint ans; foreach (l; 0 .. L) { ans += dp[N - 1][l][K]; } writeln(ans); } } catch (EOFException e) { } }