結果

問題 No.1473 おでぶなおばけさん
ユーザー yakamotoyakamoto
提出日時 2021-04-09 22:07:33
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,176 ms / 2,000 ms
コード長 4,790 bytes
コンパイル時間 18,037 ms
コンパイル使用メモリ 469,156 KB
実行使用メモリ 99,868 KB
最終ジャッジ日時 2024-06-25 05:40:22
合計ジャッジ時間 55,594 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 290 ms
50,108 KB
testcase_01 AC 265 ms
50,160 KB
testcase_02 AC 961 ms
99,868 KB
testcase_03 AC 887 ms
95,796 KB
testcase_04 AC 811 ms
94,000 KB
testcase_05 AC 590 ms
85,464 KB
testcase_06 AC 963 ms
93,360 KB
testcase_07 AC 1,116 ms
98,652 KB
testcase_08 AC 1,036 ms
98,012 KB
testcase_09 AC 1,034 ms
98,004 KB
testcase_10 AC 729 ms
87,348 KB
testcase_11 AC 717 ms
87,272 KB
testcase_12 AC 664 ms
87,276 KB
testcase_13 AC 614 ms
74,940 KB
testcase_14 AC 552 ms
68,240 KB
testcase_15 AC 629 ms
85,360 KB
testcase_16 AC 648 ms
87,456 KB
testcase_17 AC 408 ms
55,284 KB
testcase_18 AC 426 ms
57,932 KB
testcase_19 AC 650 ms
86,732 KB
testcase_20 AC 812 ms
93,592 KB
testcase_21 AC 809 ms
92,656 KB
testcase_22 AC 740 ms
91,952 KB
testcase_23 AC 730 ms
91,100 KB
testcase_24 AC 707 ms
90,380 KB
testcase_25 AC 1,126 ms
98,224 KB
testcase_26 AC 1,176 ms
94,204 KB
testcase_27 AC 759 ms
90,688 KB
testcase_28 AC 873 ms
94,164 KB
testcase_29 AC 797 ms
95,692 KB
testcase_30 AC 1,031 ms
91,800 KB
testcase_31 AC 978 ms
98,728 KB
testcase_32 AC 969 ms
94,516 KB
testcase_33 AC 882 ms
95,916 KB
testcase_34 AC 704 ms
91,232 KB
testcase_35 AC 694 ms
86,276 KB
testcase_36 AC 875 ms
92,840 KB
testcase_37 AC 922 ms
95,108 KB
testcase_38 AC 548 ms
84,396 KB
testcase_39 AC 731 ms
87,292 KB
testcase_40 AC 684 ms
86,812 KB
testcase_41 AC 626 ms
87,200 KB
testcase_42 AC 645 ms
87,144 KB
testcase_43 AC 817 ms
92,624 KB
testcase_44 AC 827 ms
92,816 KB
testcase_45 AC 900 ms
92,704 KB
testcase_46 AC 938 ms
94,784 KB
testcase_47 AC 1,040 ms
97,320 KB
testcase_48 AC 952 ms
96,584 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