結果
問題 |
No.1111 コード進行
|
ユーザー |
|
提出日時 | 2020-07-10 21:49:49 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 1,723 ms / 2,000 ms |
コード長 | 3,584 bytes |
コンパイル時間 | 16,569 ms |
コンパイル使用メモリ | 455,364 KB |
実行使用メモリ | 117,620 KB |
最終ジャッジ日時 | 2024-10-11 08:53:05 |
合計ジャッジ時間 | 42,032 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 48 |
ソースコード
import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.io.PrintWriter import java.util.* // ModInt // region class ModInt(x: Long) { companion object { const val MOD = 1000000007L //const val MOD = 998244353L } val x = (x % MOD + MOD) % MOD operator fun plus(other: ModInt): ModInt { return ModInt(x + other.x) } operator fun minus(other: ModInt): ModInt { return ModInt(x - other.x) } operator fun times(other: ModInt): ModInt { return ModInt(x * other.x) } operator fun div(other: ModInt): ModInt { return this * other.inv() } fun pow(exp: Long): ModInt { if (exp == 0L) return ModInt(1L) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } fun inv(): ModInt { return this.pow(MOD - 2) } override fun equals(other: Any?): Boolean { if (this === other) return true if (javaClass != other?.javaClass) return false other as ModInt if (x != other.x) return false return true } override fun hashCode(): Int { return x.hashCode() } override fun toString(): String { return "$x" } } val fac = mutableListOf<ModInt>() val invfac = mutableListOf<ModInt>() fun fact(n: Long, b: Boolean): ModInt { if (fac.count() == 0) { fac.add(ModInt(1)) invfac.add(ModInt(1)) } while (fac.count() <= n) { fac.add(fac.last() * ModInt(fac.count().toLong())) invfac.add(fac.last().inv()) } return if (b) { fac[n.toInt()] } else { invfac[n.toInt()] } } fun comb(n: Long, k: Long): ModInt { return fact(n, true) * fact(k, false) * fact(n - k, false) } fun comb2(n: Long, k: Long): ModInt { var ans = ModInt(1) for (i in 0 until k) { ans = ans * ModInt(n - i) / ModInt(k - i) } return ans } // endregion fun PrintWriter.solve(sc: FastScanner) { val n = sc.nextInt() val m = sc.nextInt() val k = sc.nextInt() val code = mutableListOf<Triple<Int, Int, Int>>() val next = Array(300) { mutableListOf<Pair<Int, Int>>() } for (i in 0 until m) { val p = sc.nextInt() - 1 val q = sc.nextInt() - 1 val c = sc.nextInt() code.add(Triple(p, q, c)) next[p].add(q to c) } var dp = Array(300) { Array(k + 1) { ModInt(0) } } for (i in 0 until 300) { dp[i][0] = ModInt(1) } for (i in 1 until n) { val newdp = Array(300) { Array(k + 1) { ModInt(0) } } for (j in 0 until 300) { for (s in 0..k) { for ((x, c) in next[j]) { if (s + c > k) continue newdp[x][s + c] += dp[j][s] } } } dp = newdp } var sum = ModInt(0) for (i in 0 until 300) { sum += dp[i][k] } println(sum) } fun main() { val writer = PrintWriter(System.out, false) writer.solve(FastScanner(System.`in`)) writer.flush() } class FastScanner(s: InputStream) { private var st = StringTokenizer("") private val br = BufferedReader(InputStreamReader(s)) fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() fun ready() = br.ready() }