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, to: MutableList): Array { 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, 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() val to = mutableListOf() 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 { 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) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { 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() }