結果

問題 No.1607 Kth Maximum Card
ユーザー yakamoto
提出日時 2021-07-16 23:12:59
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 2,079 ms / 3,500 ms
コード長 4,371 bytes
コンパイル時間 17,594 ms
コンパイル使用メモリ 468,292 KB
実行使用メモリ 137,640 KB
最終ジャッジ日時 2024-07-06 10:46:24
合計ジャッジ時間 46,352 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:180: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:184: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:188: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:192: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:194: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:201: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:208: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:225: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 mx
*/
inline fun findMin(mn: Int, mx: Int, f: (Int) -> Boolean): Int {
var low = mn - 1
var high = mx
while(high - low > 1) {
val m = (low + high) / 2
if (f(m)) high = m
else low = m
}
return high
}
data class Edge(val v: Int, val u: Int, val c: Int)
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
private val reader = BufferedReader(InputStreamReader(stream), 32768)
private val N = ni()
private val M = ni()
private val K = ni()
private val D = IntArray(N)
private val g0 = Array(N){ mutableListOf<Edge>()}
val inf = 1e9.toInt() + 100
fun dijk(g: Array<MutableList<Edge>>, s: Int): IntArray {
D.fill(inf)
D[s] = 0
val que = ArrayDeque<Int>()
que.add(s)
while(que.isNotEmpty()) {
val v = que.poll()!!
for (i in 0 until g[v].size) {
val e = g[v][i]
if (D[v] + e.c < D[e.u]) {
D[e.u] = D[v] + e.c
if (e.c == 0) que.addFirst(e.u) else que.addLast(e.u)
}
}
}
return D
}
fun solve() {
val E = Array(M){
val (v, u) = na(2, -1)
val c = ni()
Edge(v, u, c)
}
fun calc(x: Int): IntArray {
for (i in 0 until N) {
g0[i].clear()
}
for (i in E) {
val c = if (i.c > x) 1 else 0
g0[i.v].add(Edge(i.v, i.u, c))
g0[i.u].add(Edge(i.u, i.v, c))
}
return dijk(g0, 0)
}
// KN
if (calc(0)[N - 1] < K) {
out.println(0)
return
}
val ans = findMin(1, 200_000) { x ->
val D = calc(x)
D[N - 1] <= K - 1
}
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())}
}
fun main() {
val out = java.io.PrintWriter(System.out)
Solver(System.`in`, out).solve()
out.flush()
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0