結果
問題 |
No.1111 コード進行
|
ユーザー |
![]() |
提出日時 | 2020-07-10 22:06:07 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 627 ms / 2,000 ms |
コード長 | 3,304 bytes |
コンパイル時間 | 17,104 ms |
コンパイル使用メモリ | 453,808 KB |
実行使用メモリ | 60,708 KB |
最終ジャッジ日時 | 2024-10-11 09:20:30 |
合計ジャッジ時間 | 38,739 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 48 |
ソースコード
import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007L data class Trans(val p: Int, val q: Int, val c: Int) class Solver(stream: InputStream, private val out: java.io.PrintWriter) { fun solve() { val N = ni() val M = ni() val K = ni() val T = Array(M){Trans(ni() - 1, ni() - 1, ni())} val map = Array(300){mutableListOf<Trans>()} for (t in T) { map[t.p].add(t) } var best = Array(K + 1){LongArray(300)} var next = Array(K + 1){LongArray(300)} for (i in 0 until 300) { best[0][i] = 1 } for (times in 0 until N - 1) { for (k in 0 .. K) { Arrays.fill(next[k], 0) } for (k in 0 .. K) { for (p in 0 until 300) { for (i in 0 until map[p].size) { val t = map[p][i] if (k + t.c <= K) { next[k + t.c][t.q] += best[k][p] next[k + t.c][t.q] %= MOD } } } } debug{"$times"} debugDim(next) val tmp = best best = next next = tmp } out.println(best[K].sum() % MOD) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private val reader = BufferedReader(InputStreamReader(stream), 32768) private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return map(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array<IntArray> { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun map(n: Int, f: (Int) -> Int): IntArray { val res = IntArray(n) for (i in 0 until n) { res[i] = f(i) } return res } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } private fun debug(a: LongArray) { debug { a.joinToString(" ") } } private fun debug(a: IntArray) { debug { a.joinToString(" ") } } private fun debug(a: BooleanArray) { debug { a.map { if (it) 1 else 0 }.joinToString("") } } private fun debugDim(A: Array<LongArray>) { if (isDebug) { for (a in A) { debug(a) } } } private fun debugDim(A: Array<IntArray>) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }