結果

問題 No.1473 おでぶなおばけさん
ユーザー yakamotoyakamoto
提出日時 2021-04-09 22:07:33
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,468 ms / 2,000 ms
コード長 4,790 bytes
コンパイル時間 18,852 ms
コンパイル使用メモリ 441,736 KB
実行使用メモリ 84,016 KB
最終ジャッジ日時 2023-09-07 11:30:26
合計ジャッジ時間 67,588 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 288 ms
50,212 KB
testcase_01 AC 273 ms
50,248 KB
testcase_02 AC 1,285 ms
84,016 KB
testcase_03 AC 1,105 ms
79,896 KB
testcase_04 AC 989 ms
76,644 KB
testcase_05 AC 682 ms
58,760 KB
testcase_06 AC 1,118 ms
79,360 KB
testcase_07 AC 1,360 ms
83,592 KB
testcase_08 AC 1,468 ms
82,996 KB
testcase_09 AC 1,443 ms
83,476 KB
testcase_10 AC 705 ms
59,776 KB
testcase_11 AC 721 ms
60,272 KB
testcase_12 AC 739 ms
61,216 KB
testcase_13 AC 602 ms
59,944 KB
testcase_14 AC 552 ms
57,708 KB
testcase_15 AC 702 ms
60,840 KB
testcase_16 AC 663 ms
60,084 KB
testcase_17 AC 411 ms
56,420 KB
testcase_18 AC 436 ms
57,124 KB
testcase_19 AC 672 ms
59,956 KB
testcase_20 AC 926 ms
74,560 KB
testcase_21 AC 868 ms
63,284 KB
testcase_22 AC 770 ms
64,032 KB
testcase_23 AC 720 ms
62,084 KB
testcase_24 AC 699 ms
61,984 KB
testcase_25 AC 1,359 ms
80,656 KB
testcase_26 AC 1,389 ms
78,508 KB
testcase_27 AC 847 ms
63,176 KB
testcase_28 AC 1,247 ms
78,512 KB
testcase_29 AC 943 ms
78,252 KB
testcase_30 AC 1,076 ms
65,728 KB
testcase_31 AC 1,116 ms
82,116 KB
testcase_32 AC 972 ms
74,268 KB
testcase_33 AC 905 ms
69,400 KB
testcase_34 AC 724 ms
59,820 KB
testcase_35 AC 688 ms
60,084 KB
testcase_36 AC 1,009 ms
78,568 KB
testcase_37 AC 1,044 ms
77,388 KB
testcase_38 AC 575 ms
58,012 KB
testcase_39 AC 712 ms
60,068 KB
testcase_40 AC 715 ms
60,668 KB
testcase_41 AC 681 ms
60,056 KB
testcase_42 AC 697 ms
59,896 KB
testcase_43 AC 1,024 ms
79,108 KB
testcase_44 AC 999 ms
80,500 KB
testcase_45 AC 970 ms
79,248 KB
testcase_46 AC 1,102 ms
80,956 KB
testcase_47 AC 1,119 ms
80,020 KB
testcase_48 AC 1,171 ms
80,828 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 debug(a: LongArray) {
          ^
Main.kt:193: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:197: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:201: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:203: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:210: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:217: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:234: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()}
          ^

ソースコード

diff #

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

/**
 * 単調減少
 * [l, h) 方式
 * @return マッチするものがなかったらl
 */
inline fun findMax(l: Int, r: Int, f: (Int) -> Boolean): Int {
  var low = l
  var high = r + 1
  while(high - low > 1) {
    val m = (low + high) / 2
    if (f(m)) low = m
    else high = m
  }
  return low
}
fun packUGraph(n: Int, from: MutableList<Int>, to: MutableList<Int>): Array<IntArray> {
  val p = IntArray(n)
  val m = from.size
  for (i in 0 until m) {
    ++p[from[i]]
    ++p[to[i]]
  }
  val g = Array(n){IntArray(p[it])}
  for (i in 0 until m) {
    g[from[i]][--p[from[i]]] = to[i]
    g[to[i]][--p[to[i]]] = from[i]
  }
  return g
}
fun dijk2(g: Array<IntArray>, s: Int, INF: Int): IntArray {
  val n = g.size
  val D = IntArray(n){INF}
  D[s] = 0
  val visited = BooleanArray(n)
  val que = IntArray(n)
  var h = 0
  var t = 0
  que[h++] = s
  while(h > t) {
    val v = que[t++]
    if (visited[v]) continue
    visited[v] = true

    for (i in g[v].indices) {
      val u = g[v][i]
      if (D[v] + 1 < D[u]) {
        D[u] = D[v] + 1
        que[h++] = u
      }
    }
  }
  return D
}
data class Edge(val v: Int, val u: Int, val d: Int)
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  private val reader = BufferedReader(InputStreamReader(stream), 32768)

  fun solve() {
    val (N, M) = na(2)
    val E = Array(M){Edge(ni() - 1, ni() - 1, ni())}
    val inf = 1e9.toInt() + 10

    fun toD(w: Int): IntArray {
      val from = mutableListOf<Int>()
      val to = mutableListOf<Int>()
      for (e in E) {
        if (e.d >= w) {
          from += e.v
          to += e.u
        }
      }
      val g = packUGraph(N, from, to)
      return dijk2(g, 0, inf)
    }

    val w = findMax(1, inf) { w ->
      val D = toD(w)
//      debug{"each($w)"}
//      debug(D)
      D[N - 1] < inf
    }

    debug{"w:$w"}
    val D = toD(w)
    out.println("$w ${D[N - 1]}")
  }













































  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())}
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}
0