結果

問題 No.1637 Easy Tree Query
ユーザー yakamotoyakamoto
提出日時 2021-08-06 21:27:21
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 815 ms / 2,000 ms
コード長 4,598 bytes
コンパイル時間 19,748 ms
コンパイル使用メモリ 465,276 KB
実行使用メモリ 64,824 KB
最終ジャッジ日時 2023-10-17 04:54:35
合計ジャッジ時間 45,594 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 287 ms
51,836 KB
testcase_01 AC 286 ms
51,840 KB
testcase_02 AC 799 ms
64,824 KB
testcase_03 AC 281 ms
51,840 KB
testcase_04 AC 546 ms
59,864 KB
testcase_05 AC 687 ms
60,308 KB
testcase_06 AC 644 ms
60,248 KB
testcase_07 AC 525 ms
59,112 KB
testcase_08 AC 528 ms
60,056 KB
testcase_09 AC 682 ms
60,400 KB
testcase_10 AC 610 ms
60,060 KB
testcase_11 AC 741 ms
62,564 KB
testcase_12 AC 739 ms
60,476 KB
testcase_13 AC 511 ms
59,536 KB
testcase_14 AC 631 ms
60,200 KB
testcase_15 AC 755 ms
62,048 KB
testcase_16 AC 715 ms
62,520 KB
testcase_17 AC 559 ms
60,008 KB
testcase_18 AC 688 ms
60,028 KB
testcase_19 AC 679 ms
60,096 KB
testcase_20 AC 731 ms
60,236 KB
testcase_21 AC 630 ms
60,076 KB
testcase_22 AC 792 ms
62,704 KB
testcase_23 AC 560 ms
60,276 KB
testcase_24 AC 607 ms
60,196 KB
testcase_25 AC 705 ms
60,064 KB
testcase_26 AC 747 ms
60,556 KB
testcase_27 AC 815 ms
63,540 KB
testcase_28 AC 655 ms
59,948 KB
testcase_29 AC 677 ms
60,712 KB
testcase_30 AC 540 ms
60,156 KB
testcase_31 AC 611 ms
60,080 KB
testcase_32 AC 599 ms
59,916 KB
testcase_33 AC 678 ms
60,120 KB
testcase_34 AC 548 ms
61,872 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:183: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:187: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:191: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:195: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:197: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:204: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:211: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:228: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

/**
 * (dist, parent, queue)
 * @param rt ルートノードを指定する。nullの場合は全ノード辿るまで繰り返す
 */
fun traceBfs(g: Array<IntArray>, rt: Int? = 0): Array<IntArray> {
  val n = g.size
  val q = IntArray(n)
  val d = IntArray(n)
  val p = IntArray(n){-2}
  var h = 0
  var t = 0

  fun bfs(rt: Int) {
    p[rt] = -1
    q[t++] = rt
    d[rt] = 0
    while (h < t) {
      val v = q[h++]
      for (i in g[v].indices) { // List<Int>に変更したときこちらの方法でないとiterator生成して遅くなる
        val u = g[v][i]
        if (p[u] == -2) {
          p[u] = v
          q[t++] = u
          d[u] = d[v] + 1
        }
      }
    }
  }

  if (rt != null) {
    bfs(rt)
  } else {
    for (v in 0 until n) {
      if (p[v] != -2) continue
      bfs(v)
    }
  }
  return arrayOf(d, p, q)
}

fun packUGraph(n: Int, from: IntArray, to: IntArray): 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
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  private val reader = BufferedReader(InputStreamReader(stream), 32768)

  fun solve() {
    val (N, Q) = na(2)
    val (from , to) = na2(N - 1, -1)
    val g = packUGraph(N, from, to)
    val (_, par, que) = traceBfs(g)
    var ans = 0L

    val dp = IntArray(N){1}
    for (i in N - 1 downTo 0) {
      val v = que[i]
      for (u in g[v]) {
        if (u == par[v]) continue
        dp[v] += dp[u]
      }
    }

    for (q in 0 until Q) {
      val p = ni() - 1
      val x = nl()
      ans += dp[p] * x
      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()
0