結果

問題 No.1098 LCAs
ユーザー yakamotoyakamoto
提出日時 2020-06-26 22:41:12
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 976 ms / 2,000 ms
コード長 3,913 bytes
コンパイル時間 19,383 ms
コンパイル使用メモリ 432,416 KB
実行使用メモリ 71,128 KB
最終ジャッジ日時 2023-09-18 06:19:58
合計ジャッジ時間 35,836 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 268 ms
52,532 KB
testcase_01 AC 269 ms
52,452 KB
testcase_02 AC 268 ms
52,644 KB
testcase_03 AC 271 ms
52,484 KB
testcase_04 AC 269 ms
52,520 KB
testcase_05 AC 268 ms
52,488 KB
testcase_06 AC 267 ms
52,488 KB
testcase_07 AC 270 ms
52,580 KB
testcase_08 AC 271 ms
52,456 KB
testcase_09 AC 268 ms
52,424 KB
testcase_10 AC 269 ms
52,564 KB
testcase_11 AC 269 ms
52,604 KB
testcase_12 AC 270 ms
52,580 KB
testcase_13 AC 300 ms
52,648 KB
testcase_14 AC 300 ms
52,804 KB
testcase_15 AC 303 ms
52,656 KB
testcase_16 AC 303 ms
52,764 KB
testcase_17 AC 296 ms
52,648 KB
testcase_18 AC 791 ms
68,492 KB
testcase_19 AC 825 ms
68,844 KB
testcase_20 AC 976 ms
71,128 KB
testcase_21 AC 884 ms
68,972 KB
testcase_22 AC 842 ms
70,052 KB
testcase_23 AC 906 ms
68,732 KB
testcase_24 AC 856 ms
68,896 KB
testcase_25 AC 851 ms
68,360 KB
testcase_26 AC 844 ms
69,252 KB
testcase_27 AC 928 ms
68,424 KB
testcase_28 AC 863 ms
68,408 KB
testcase_29 AC 881 ms
68,420 KB
testcase_30 AC 870 ms
68,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007L

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
}
/**
 * (dist, parent, queue)
 */
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 cur = 0
  var last = 1
  p[rt] = -1
  q[0] = rt
  d[rt] = 0
  while (cur < last) {
    val v = q[cur++]
    for (u in g[v]) {
      if (p[u] == -2) {
        p[u] = v
        q[last++] = u
        d[u] = d[v] + 1
      }
    }
  }
  return arrayOf(d, p, q)
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    val N = ni()
    val (from, to) = na2(N - 1, -1)
    val g = packUGraph(N, from, to)
    val (_, par, que) = traceBfs(g)
    val dp = IntArray(N)
    for (i in N - 1 downTo 0) {
      val u = que[i]
      dp[u]++
      for (v in g[u]) {
        if (par[u] == v) continue
        dp[u] += dp[v]
      }
    }
    debug(dp)

    val ans = LongArray(N)
    for (u in 0 until N) {
      var comb = 1L
      val children = mutableListOf<Long>()
      for (v in g[u]) {
        if (par[u] == v) continue
        children.add(dp[v].toLong())
      }

      var dbl = 0L
      val s = children.sum()
      dbl += s * 2
      for (i in children) {
        dbl += i * (s - i)
      }
      comb += dbl
      ans[u] = comb
    }

    for (i in ans) {
      out.println(i)
    }
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  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 map(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 map(n: Int, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
}

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