結果
問題 | No.1037 exhausted |
ユーザー | yakamoto |
提出日時 | 2020-04-24 23:37:58 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 521 ms / 2,000 ms |
コード長 | 3,065 bytes |
コンパイル時間 | 17,671 ms |
コンパイル使用メモリ | 451,840 KB |
実行使用メモリ | 111,400 KB |
最終ジャッジ日時 | 2024-10-15 03:55:03 |
合計ジャッジ時間 | 26,138 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 289 ms
53,272 KB |
testcase_01 | AC | 281 ms
53,180 KB |
testcase_02 | AC | 288 ms
53,232 KB |
testcase_03 | AC | 288 ms
53,244 KB |
testcase_04 | AC | 282 ms
53,448 KB |
testcase_05 | AC | 275 ms
53,292 KB |
testcase_06 | AC | 284 ms
53,280 KB |
testcase_07 | AC | 291 ms
53,228 KB |
testcase_08 | AC | 282 ms
53,284 KB |
testcase_09 | AC | 284 ms
53,420 KB |
testcase_10 | AC | 289 ms
53,252 KB |
testcase_11 | AC | 288 ms
53,252 KB |
testcase_12 | AC | 516 ms
110,420 KB |
testcase_13 | AC | 510 ms
111,400 KB |
testcase_14 | AC | 511 ms
111,212 KB |
testcase_15 | AC | 505 ms
110,972 KB |
testcase_16 | AC | 521 ms
111,348 KB |
testcase_17 | AC | 516 ms
111,000 KB |
testcase_18 | AC | 516 ms
111,012 KB |
testcase_19 | AC | 520 ms
111,376 KB |
testcase_20 | AC | 476 ms
111,376 KB |
testcase_21 | AC | 470 ms
111,340 KB |
testcase_22 | AC | 469 ms
111,112 KB |
ソースコード
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 Station(val x: Int, val v: Int, val w: Long) class Solver(stream: InputStream, private val out: java.io.PrintWriter) { fun solve() { val N = ni() val V = ni() val L = ni() val S = mutableListOf<Station>() for (i in 0 until N) { S += Station(ni(), ni(), nl()) } S += Station(L, 0, 100) val INF = Long.MAX_VALUE / 2 val dp = Array(N + 2){LongArray(V + 1){INF} } dp[0][V] = 0 var preX = 0 for (i in 0 .. N) { for (v in 0 .. V) { if (dp[i][v] == INF) continue val remain = v - (S[i].x - preX) if (remain < 0) continue dp[i + 1][remain] = min(dp[i + 1][remain], dp[i][v]) val filled = min(V, remain + S[i].v) dp[i + 1][filled] = min(dp[i + 1][filled], dp[i][v] + S[i].w) } preX = S[i].x } val ans = dp[N + 1].min() if (ans == INF) out.println(-1) else out.println(ans) } 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<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() }