結果
問題 | No.1638 Robot Maze |
ユーザー | yakamoto |
提出日時 | 2021-08-06 21:44:39 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 365 ms / 2,000 ms |
コード長 | 4,689 bytes |
コンパイル時間 | 19,342 ms |
コンパイル使用メモリ | 461,768 KB |
実行使用メモリ | 57,312 KB |
最終ジャッジ日時 | 2023-10-17 03:04:19 |
合計ジャッジ時間 | 36,062 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 271 ms
51,968 KB |
testcase_01 | AC | 271 ms
51,968 KB |
testcase_02 | AC | 270 ms
51,968 KB |
testcase_03 | AC | 358 ms
56,424 KB |
testcase_04 | AC | 272 ms
52,048 KB |
testcase_05 | AC | 273 ms
52,056 KB |
testcase_06 | AC | 273 ms
52,060 KB |
testcase_07 | AC | 275 ms
52,060 KB |
testcase_08 | AC | 271 ms
52,052 KB |
testcase_09 | AC | 277 ms
52,068 KB |
testcase_10 | AC | 272 ms
52,060 KB |
testcase_11 | AC | 272 ms
52,060 KB |
testcase_12 | AC | 275 ms
52,060 KB |
testcase_13 | AC | 268 ms
52,068 KB |
testcase_14 | AC | 343 ms
54,332 KB |
testcase_15 | AC | 289 ms
54,172 KB |
testcase_16 | AC | 289 ms
54,176 KB |
testcase_17 | AC | 289 ms
54,172 KB |
testcase_18 | AC | 275 ms
54,128 KB |
testcase_19 | AC | 286 ms
54,168 KB |
testcase_20 | AC | 284 ms
54,168 KB |
testcase_21 | AC | 291 ms
54,148 KB |
testcase_22 | AC | 296 ms
54,160 KB |
testcase_23 | AC | 297 ms
54,160 KB |
testcase_24 | AC | 295 ms
54,152 KB |
testcase_25 | AC | 297 ms
54,160 KB |
testcase_26 | AC | 302 ms
54,248 KB |
testcase_27 | AC | 306 ms
54,252 KB |
testcase_28 | AC | 299 ms
54,244 KB |
testcase_29 | AC | 303 ms
54,248 KB |
testcase_30 | AC | 271 ms
52,044 KB |
testcase_31 | AC | 274 ms
52,048 KB |
testcase_32 | AC | 359 ms
54,376 KB |
testcase_33 | AC | 342 ms
54,316 KB |
testcase_34 | AC | 350 ms
54,336 KB |
testcase_35 | AC | 348 ms
54,336 KB |
testcase_36 | AC | 360 ms
54,328 KB |
testcase_37 | AC | 352 ms
54,336 KB |
testcase_38 | AC | 348 ms
54,328 KB |
testcase_39 | AC | 360 ms
54,384 KB |
testcase_40 | AC | 347 ms
54,340 KB |
testcase_41 | AC | 344 ms
54,324 KB |
testcase_42 | AC | 359 ms
54,372 KB |
testcase_43 | AC | 359 ms
57,312 KB |
testcase_44 | AC | 359 ms
57,276 KB |
testcase_45 | AC | 350 ms
57,300 KB |
testcase_46 | AC | 365 ms
54,388 KB |
testcase_47 | AC | 360 ms
54,368 KB |
testcase_48 | AC | 352 ms
54,336 KB |
testcase_49 | AC | 350 ms
54,340 KB |
testcase_50 | AC | 355 ms
54,368 KB |
testcase_51 | AC | 357 ms
57,276 KB |
コンパイルメッセージ
Main.kt:177:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debug(a: LongArray) { ^ Main.kt:181:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debug(a: IntArray) { ^ Main.kt:185:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debug(a: BooleanArray) { ^ Main.kt:189:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} ^ Main.kt:191:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debugDim(A: Array<LongArray>) { ^ Main.kt:198:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debugDim(A: Array<IntArray>) { ^ Main.kt:205:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debugDim(A: Array<BooleanArray>) { ^ Main.kt:222:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} ^
ソースコード
import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) fun solve() { val (H, W) = na(2) val costs = na(4) val (K, P) = nal(2) val (xs, ys, xt, yt) = na(4, -1) val grid = Array(H){ns()} data class Edge(val v: Int, val weight: Long) data class Visit(val v: Int, val cost: Long) val INF = 1e18.toLong() // U, D, R, L val dirs = arrayOf( intArrayOf(-1, 0), intArrayOf(1, 0), intArrayOf(0, 1), intArrayOf(0, -1) ) fun g(v: Int): MutableList<Edge> { val row = v/W val col = v%W val res = mutableListOf<Edge>() for (i in 0 until 4) { val nrow = row + dirs[i][0] val ncol = col + dirs[i][1] if (nrow in (0 until H) && ncol in (0 until W)) { val cost = when(grid[nrow][ncol]) { '.' -> 0 '#' -> INF else -> P // '@' } + costs[i] val nv = nrow * W + ncol res += Edge(nv, cost) } } return res } fun dijk(N: Int, s: Int): LongArray { val D = LongArray(N){INF} D[s] = 0 val visited = BooleanArray(N) val que = PriorityQueue<Visit>(compareBy { it.cost }) que.add(Visit(s, 0)) while(que.isNotEmpty()) { val v = que.poll()!! if (visited[v.v]) continue visited[v.v] = true val edges = g(v.v) for (i in edges.indices) { val e = edges[i] if (v.cost + e.weight < D[e.v]) { D[e.v] = v.cost + e.weight que.add(Visit(e.v, D[e.v])) } } } return D } val s = xs * W + ys val t = xt * W + yt val dist = dijk(H*W, s) debug{"${dist[t]}"} val ans = if (dist[t] <= K) "Yes" else "No" out.println(ans) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null 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 IntArray(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 debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } /** * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと */ private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array<LongArray>) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array<IntArray>) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array<BooleanArray>) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())} companion object { // TestRunnerから呼びたいので単純なmainじゃだめ fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() } } } /** * judgeから呼ばれる */ fun main() = Solver.main()