結果

問題 No.1950 片道きゃっちぼーる
ユーザー yakamotoyakamoto
提出日時 2022-05-21 13:06:40
言語 Kotlin
(1.6.10)
結果
AC  
実行時間 1,653 ms / 3,000 ms
コード長 5,268 Byte
コンパイル時間 15,696 ms
使用メモリ 155,684 KB
最終ジャッジ日時 2022-05-21 13:07:31
合計ジャッジ時間 45,122 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 198 ms
45,940 KB
testcase_01 AC 201 ms
46,024 KB
testcase_02 AC 200 ms
46,100 KB
testcase_03 AC 1,586 ms
155,684 KB
testcase_04 AC 1,432 ms
148,388 KB
testcase_05 AC 231 ms
45,792 KB
testcase_06 AC 1,653 ms
137,084 KB
testcase_07 AC 1,299 ms
112,236 KB
testcase_08 AC 1,311 ms
106,428 KB
testcase_09 AC 1,311 ms
128,788 KB
testcase_10 AC 1,298 ms
106,788 KB
testcase_11 AC 1,413 ms
108,596 KB
testcase_12 AC 1,395 ms
108,260 KB
testcase_13 AC 1,435 ms
142,752 KB
testcase_14 AC 1,385 ms
129,868 KB
testcase_15 AC 1,533 ms
126,404 KB
testcase_16 AC 1,385 ms
135,688 KB
testcase_17 AC 230 ms
45,936 KB
testcase_18 AC 1,377 ms
102,948 KB
testcase_19 AC 1,515 ms
128,328 KB
testcase_20 AC 1,190 ms
99,664 KB
testcase_21 AC 1,421 ms
118,656 KB
testcase_22 AC 1,312 ms
104,108 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:207: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:211: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:215: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:219: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:221: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:228: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:235: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:252: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.collections.HashMap
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007
fun packDGraph(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]]
  }
  val g = Array(n){IntArray(p[it])}
  for (i in 0 until m) {
    g[from[i]][--p[from[i]]] = to[i]
  }
  return g
}
class StronglyConnectedComponents(val N: Int, from: IntArray, to: IntArray) {
  private var id = 0
  private val Ti = IntArray(N)
  private val visited = BooleanArray(N)
  val g = packDGraph(N, from, to)
  private val gi = packDGraph(N, to, from)

  fun dfs(u: Int) {
    visited[u] = true
    for (v in g[u]) {
      if (visited[v]) continue
      dfs(v)
    }
    Ti[id++] = u
  }

  fun dfs2(u: Int, nodes: MutableList<Int>) {
    visited[u] = true
    for (v in gi[u]) {
      if (visited[v]) continue
      dfs2(v, nodes)
    }
    nodes += u
  }

  fun build(): List<List<Int>> {
    for (u in 0 until N) {
      if (!visited[u]) dfs(u)
    }

    Arrays.fill(visited, false)
    val res = mutableListOf<MutableList<Int>>()
    for (t in N - 1 downTo 0) {
      if (visited[Ti[t]]) continue
      val nodes = mutableListOf<Int>()
      dfs2(Ti[t], nodes)
      res += nodes
    }
    return res
  }
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  private val reader = BufferedReader(InputStreamReader(stream), 32768)

  fun solve() {
    val th = Thread(null, Runnable {
      solve2()
    },"solve", 1 shl 26)
    th.start()
    th.join()
  }
  
  fun solve2() {
    val N = ni()
    val X = na(N)
    val A = na(N)
    val map = HashMap<Int, Int>()
    for (i in 0 until N) {
      map[X[i]] = i
    }
    val from = mutableListOf<Int>()
    val to = mutableListOf<Int>()
    for (i in 0 until N) {
      val j = map[X[i] + A[i]] ?: continue
      from += i
      to += j
    }
    for (i in 0 until N) {
      val j = map[X[i] - A[i]] ?: continue
      from += i
      to += j
    }
    val scc = StronglyConnectedComponents(N, from.toIntArray(), to.toIntArray())
    val components = scc.build()
    debug { components.toString() }
    val ans = LongArray(N)
    for (ii in components.size - 1 downTo 0) {
      val grp = components[ii]
      var mx = 0L
      for (i in grp) {
        mx = max(mx, X[i].toLong() + A[i])
        for (j in scc.g[i]) {
          mx = max(mx, ans[j] + X[j])
        }
      }
      for (i in grp) {
        ans[i] = mx - X[i]
      }
    }

    ans.forEach { println(it) }
  }













































  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