結果
問題 | No.1390 Get together |
ユーザー | tzyvrn |
提出日時 | 2021-02-12 23:45:13 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 822 ms / 2,000 ms |
コード長 | 2,966 bytes |
コンパイル時間 | 17,325 ms |
コンパイル使用メモリ | 436,564 KB |
実行使用メモリ | 73,276 KB |
最終ジャッジ日時 | 2023-09-27 07:31:42 |
合計ジャッジ時間 | 33,314 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 260 ms
53,008 KB |
testcase_01 | AC | 256 ms
53,080 KB |
testcase_02 | AC | 262 ms
53,000 KB |
testcase_03 | AC | 398 ms
57,428 KB |
testcase_04 | AC | 385 ms
56,724 KB |
testcase_05 | AC | 385 ms
57,704 KB |
testcase_06 | AC | 376 ms
56,736 KB |
testcase_07 | AC | 381 ms
56,632 KB |
testcase_08 | AC | 379 ms
56,676 KB |
testcase_09 | AC | 399 ms
57,976 KB |
testcase_10 | AC | 263 ms
52,920 KB |
testcase_11 | AC | 266 ms
52,980 KB |
testcase_12 | AC | 259 ms
53,012 KB |
testcase_13 | AC | 260 ms
53,080 KB |
testcase_14 | AC | 268 ms
52,920 KB |
testcase_15 | AC | 260 ms
53,064 KB |
testcase_16 | AC | 788 ms
68,780 KB |
testcase_17 | AC | 766 ms
72,744 KB |
testcase_18 | AC | 776 ms
70,708 KB |
testcase_19 | AC | 772 ms
71,044 KB |
testcase_20 | AC | 803 ms
70,868 KB |
testcase_21 | AC | 783 ms
71,180 KB |
testcase_22 | AC | 756 ms
72,800 KB |
testcase_23 | AC | 765 ms
72,796 KB |
testcase_24 | AC | 755 ms
72,868 KB |
testcase_25 | AC | 754 ms
72,872 KB |
testcase_26 | AC | 822 ms
73,012 KB |
testcase_27 | AC | 791 ms
71,036 KB |
testcase_28 | AC | 757 ms
70,648 KB |
testcase_29 | AC | 747 ms
72,840 KB |
testcase_30 | AC | 787 ms
73,276 KB |
testcase_31 | AC | 751 ms
73,096 KB |
ソースコード
import java.util.* fun main() { // val sc = Scanner(System.`in`) // val n = sc.nextInt() // val m = sc.nextInt() // val slimes = List(n) { Pair(sc.nextInt() - 1, sc.nextInt() - 1) } val (n, m) = readLine()!!.split(" ").map { it.toInt() } val slimes = mutableListOf<Pair<Int, Int>>() for (i in 0 until n) { val (b, c) = readLine()!!.split(" ").map { it.toInt() } slimes.add(Pair(b - 1, c - 1)) } val dsu = DSU(m) val color_leaders = MutableList(n) { -1 } var ans = 0 for ((box, color) in slimes) { if (color_leaders[color] == -1) { color_leaders[color] = box } else { if (!dsu.same(box, color_leaders[color])) { dsu.merge(box, color_leaders[color]) ans += 1 } } } println(ans) } fun eprintln(obj: Any) = System.err.println(obj.toString()) /** * Disjoint set union. * * convert from [AtCoderLibraryForJava - DSU](https://github.com/NASU41/AtCoderLibraryForJava/blob/8b3a3b599790a9ca8c7dd92e036af4ddc5be1b05/DSU/DSU.java) */ class DSU(private val n: Int) { private val parentOrSize: IntArray = IntArray(n) { -1 } /** * Merge nodes. */ fun merge(a: Int, b: Int): Int { if (a !in 0 until n) throw IndexOutOfBoundsException("a=$a") if (b !in 0 until n) throw IndexOutOfBoundsException("b=$b") var x = leader(a) var y = leader(b) if (x == y) return x if (-parentOrSize[x] < -parentOrSize[y]) { val tmp = x x = y y = tmp } parentOrSize[x] += parentOrSize[y] parentOrSize[y] = x return x } /** * True if two nodes are connected. */ fun same(a: Int, b: Int): Boolean { if (a !in 0 until n) throw IndexOutOfBoundsException("a=$a") if (b !in 0 until n) throw IndexOutOfBoundsException("b=$b") return leader(a) == leader(b) } /** * Get its leader node. */ fun leader(a: Int): Int { return if (parentOrSize[a] < 0) { a } else { parentOrSize[a] = leader(parentOrSize[a]) parentOrSize[a] } } /** * A group's size. */ fun size(a: Int): Int { if (a !in 0 until n) throw IndexOutOfBoundsException("" + a) return -parentOrSize[leader(a)] } /** * Group by leader. */ fun groups(): ArrayList<ArrayList<Int>> { val leaderBuf = IntArray(n) val groupSize = IntArray(n) for (i in 0 until n) { leaderBuf[i] = leader(i) groupSize[leaderBuf[i]]++ } val result = ArrayList<ArrayList<Int>>(n) for (i in 0 until n) { result.add(ArrayList(groupSize[i])) } for (i in 0 until n) { result[leaderBuf[i]].add(i) } result.removeIf { it.isEmpty() } return result } }