結果

問題 No.1098 LCAs
ユーザー yakamotoyakamoto
提出日時 2020-06-26 22:41:12
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,072 ms / 2,000 ms
コード長 3,913 bytes
コンパイル時間 17,317 ms
コンパイル使用メモリ 466,864 KB
実行使用メモリ 96,948 KB
最終ジャッジ日時 2024-07-04 22:33:39
合計ジャッジ時間 37,452 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 298 ms
50,684 KB
testcase_01 AC 300 ms
50,668 KB
testcase_02 AC 298 ms
50,716 KB
testcase_03 AC 299 ms
50,692 KB
testcase_04 AC 301 ms
50,820 KB
testcase_05 AC 300 ms
50,704 KB
testcase_06 AC 298 ms
50,684 KB
testcase_07 AC 303 ms
50,844 KB
testcase_08 AC 304 ms
50,724 KB
testcase_09 AC 302 ms
50,688 KB
testcase_10 AC 307 ms
50,688 KB
testcase_11 AC 300 ms
50,664 KB
testcase_12 AC 314 ms
50,840 KB
testcase_13 AC 329 ms
51,360 KB
testcase_14 AC 327 ms
51,644 KB
testcase_15 AC 328 ms
51,236 KB
testcase_16 AC 325 ms
51,412 KB
testcase_17 AC 327 ms
51,564 KB
testcase_18 AC 933 ms
95,788 KB
testcase_19 AC 882 ms
95,824 KB
testcase_20 AC 1,072 ms
96,376 KB
testcase_21 AC 993 ms
96,572 KB
testcase_22 AC 854 ms
95,552 KB
testcase_23 AC 955 ms
96,160 KB
testcase_24 AC 963 ms
96,948 KB
testcase_25 AC 964 ms
96,048 KB
testcase_26 AC 944 ms
96,704 KB
testcase_27 AC 918 ms
96,104 KB
testcase_28 AC 910 ms
94,940 KB
testcase_29 AC 884 ms
95,904 KB
testcase_30 AC 924 ms
95,196 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