結果

問題 No.2202 贅沢てりたまチキン
ユーザー yakamotoyakamoto
提出日時 2023-02-03 21:56:22
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 933 ms / 2,000 ms
コード長 6,304 bytes
コンパイル時間 17,524 ms
コンパイル使用メモリ 467,264 KB
実行使用メモリ 107,432 KB
最終ジャッジ日時 2024-07-02 19:51:42
合計ジャッジ時間 36,481 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 290 ms
50,012 KB
testcase_01 AC 287 ms
49,984 KB
testcase_02 AC 292 ms
49,816 KB
testcase_03 AC 291 ms
49,964 KB
testcase_04 AC 285 ms
49,948 KB
testcase_05 AC 295 ms
49,948 KB
testcase_06 AC 290 ms
49,948 KB
testcase_07 AC 288 ms
49,900 KB
testcase_08 AC 286 ms
49,808 KB
testcase_09 AC 287 ms
49,740 KB
testcase_10 AC 414 ms
86,604 KB
testcase_11 AC 286 ms
49,848 KB
testcase_12 AC 292 ms
49,800 KB
testcase_13 AC 293 ms
49,828 KB
testcase_14 AC 888 ms
106,668 KB
testcase_15 AC 885 ms
106,372 KB
testcase_16 AC 874 ms
102,948 KB
testcase_17 AC 895 ms
102,868 KB
testcase_18 AC 710 ms
91,736 KB
testcase_19 AC 735 ms
92,472 KB
testcase_20 AC 848 ms
101,052 KB
testcase_21 AC 852 ms
101,180 KB
testcase_22 AC 742 ms
85,360 KB
testcase_23 AC 782 ms
85,252 KB
testcase_24 AC 750 ms
85,096 KB
testcase_25 AC 898 ms
106,632 KB
testcase_26 AC 858 ms
107,232 KB
testcase_27 AC 933 ms
107,432 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 debug(a: LongArray) {
          ^
Main.kt:256: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:260: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:264: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:266: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:273: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:280: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:297: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
//val MOD = 998244353
class UnionFind(n: Int) {
  private val par = IntArray(n){it}
  private val rank = IntArray(n){1} // 集合の要素数
  private val visits = IntArray(n) // 訪れた場所をfind毎に用意するのがもったいないのでつかいまわす

  fun find(x: Int): Int {
    var ptr = 0
    var i = x
    while(par[i] != i) {
      visits[ptr++] = i
      i = par[i]
    }

    for (j in 0 until ptr) {
      par[visits[j]] = i
    }
    return i
  }

  private fun merge(node: Int, rt: Int): Int {
    par[node] = rt
    rank[rt] += rank[node]
    return rt
  }

  fun unite(x: Int, y: Int): Boolean {
    val x1 = find(x)
    val y1 = find(y)
    return if (x1 == y1) false
    else {
      if (rank[x1] < rank[y1])
        merge(x1, y1)
      else
        merge(y1, x1)

      true
    }
  }

  fun isSame(x: Int, y: Int) = find(x) == find(y)

  fun isRoot(x: Int) = par[x] == x

  /**
   * xを解決する必要がないときは直にrankをみる
   */
  fun cntNodes(x: Int): Int = rank[find(x)]

  fun inspect() = run{par}
}
fun testBipartite(N: Int, g: Array<IntArray>, D: IntArray): Boolean {
  for (v in 0 until N) {
    for (i in g[v].indices) {
      val u = g[v][i]
      if (D[u] % 2 == D[v] % 2) {
        return false
      }
    }
  }

  return true
}
fun packUGraph(n: Int, E: List<Pair<Int, Int>>): Array<IntArray> {
  val p = IntArray(n)
  val m = E.size
  for (i in 0 until m) {
    ++p[E[i].first]
    ++p[E[i].second]
  }
  val g = Array(n){IntArray(p[it])}
  for (i in 0 until m) {
    g[E[i].first][--p[E[i].first]] = E[i].second
    g[E[i].second][--p[E[i].second]] = E[i].first
  }
  return g
}
/**
 * (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)
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  private val reader = BufferedReader(InputStreamReader(stream), 32768)

  fun solve() {
    val (N, M) = na(2)
    val (from, to) = na2(M, -1)
    val uf = UnionFind(N)
    for (i in 0 until M) {
      uf.unite(from[i], to[i])
    }

    val map = IntArray(N)
    val grpSize = IntArray(N)
    for (v in 0 until N) {
      val id = uf.find(v)
      map[v] = grpSize[id]++
    }
    
    val edges = Array(N){ mutableListOf<Pair<Int, Int>>()}
    for (i in 0 until M) {
      edges[uf.find(from[i])].add(Pair(map[from[i]], map[to[i]]))
    }

    var ok = true
    for (i in 0 until N) {
      val n = grpSize[i]
      if (n == 0) continue
      val g = packUGraph(n, edges[i])
      val (D, _, _) = traceBfs(g)
      ok = ok && !testBipartite(n, g, D)
    }
    out.println(if (ok) "Yes" else "No")
  }













































  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(FileOutputStream("./out.txt"))
      val out = java.io.PrintWriter(System.out)
      Solver(System.`in`, out).solve()
      out.flush()
    }
  }
}

/**
 * judgeから呼ばれる
 */
fun main() = Solver.main()
0