結果

問題 No.1605 Matrix Shape
ユーザー yakamotoyakamoto
提出日時 2021-07-16 22:12:02
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 787 ms / 2,000 ms
コード長 4,654 bytes
コンパイル時間 18,607 ms
コンパイル使用メモリ 460,140 KB
実行使用メモリ 106,084 KB
最終ジャッジ日時 2024-07-06 09:30:56
合計ジャッジ時間 34,828 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 334 ms
58,528 KB
testcase_01 AC 313 ms
58,136 KB
testcase_02 AC 303 ms
58,464 KB
testcase_03 AC 315 ms
58,232 KB
testcase_04 AC 300 ms
58,268 KB
testcase_05 AC 312 ms
58,516 KB
testcase_06 AC 309 ms
58,356 KB
testcase_07 AC 293 ms
58,380 KB
testcase_08 AC 322 ms
58,348 KB
testcase_09 AC 344 ms
58,248 KB
testcase_10 AC 335 ms
58,380 KB
testcase_11 AC 323 ms
58,448 KB
testcase_12 AC 321 ms
58,332 KB
testcase_13 AC 347 ms
58,316 KB
testcase_14 AC 341 ms
58,312 KB
testcase_15 AC 321 ms
58,196 KB
testcase_16 AC 327 ms
58,376 KB
testcase_17 AC 316 ms
58,288 KB
testcase_18 AC 310 ms
58,288 KB
testcase_19 AC 750 ms
106,008 KB
testcase_20 AC 723 ms
90,216 KB
testcase_21 AC 787 ms
90,228 KB
testcase_22 AC 697 ms
106,000 KB
testcase_23 AC 742 ms
105,784 KB
testcase_24 AC 755 ms
106,084 KB
testcase_25 AC 643 ms
89,984 KB
testcase_26 AC 647 ms
89,912 KB
testcase_27 AC 669 ms
90,400 KB
testcase_28 AC 631 ms
89,780 KB
testcase_29 AC 705 ms
90,540 KB
testcase_30 AC 724 ms
90,304 KB
testcase_31 AC 759 ms
89,988 KB
testcase_32 AC 690 ms
89,724 KB
testcase_33 AC 669 ms
90,344 KB
testcase_34 AC 666 ms
89,960 KB
testcase_35 AC 665 ms
89,168 KB
testcase_36 AC 658 ms
91,640 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:193: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:197: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:201: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:205: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:207: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:214: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: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<BooleanArray>) {
          ^
Main.kt:238: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

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

  fun solve() {
    val N = ni()
    val MAX = 2e5.toInt()
    val degreeIn = IntArray(MAX)
    val degreeOut = IntArray(MAX)
    val uf = UnionFind(MAX)
    val (from, to) = na2(N, -1)
    val unq = mutableSetOf<Int>()
    for (i in 0 until N) {
      val v = from[i]
      val u = to[i]
      degreeIn[v]++
      degreeOut[u]++
      unq += v
      unq += u
      uf.unite(v, u)
    }

    val diff = (0 until MAX).map{ degreeIn[it] - degreeOut[it] }

    debug{"unq:${unq}"}

    fun isSemi() = run {
      diff.count { it == 1 } == 1 &&
          diff.count { it == -1 } == 1 &&
          diff.count { it == 0 } == MAX - 2
    }

    val ans = if (uf.cntNodes(from[0]) < unq.size) 0
    else if (diff.count { it == 0 } == MAX) {
      degreeIn.count { it > 0 }
    }
    else if (isSemi()) 1
    else 0

    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())}
}

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