結果
問題 | No.1390 Get together |
ユーザー | tzyvrn |
提出日時 | 2021-02-13 00:15:47 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 1,305 ms / 2,000 ms |
コード長 | 2,821 bytes |
コンパイル時間 | 15,390 ms |
コンパイル使用メモリ | 429,764 KB |
実行使用メモリ | 82,628 KB |
最終ジャッジ日時 | 2023-09-27 08:05:14 |
合計ジャッジ時間 | 41,347 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 296 ms
53,548 KB |
testcase_01 | AC | 284 ms
53,552 KB |
testcase_02 | AC | 296 ms
53,512 KB |
testcase_03 | AC | 442 ms
57,300 KB |
testcase_04 | AC | 424 ms
56,976 KB |
testcase_05 | AC | 432 ms
56,912 KB |
testcase_06 | AC | 418 ms
57,104 KB |
testcase_07 | AC | 422 ms
56,956 KB |
testcase_08 | AC | 424 ms
57,024 KB |
testcase_09 | AC | 424 ms
57,116 KB |
testcase_10 | AC | 299 ms
53,476 KB |
testcase_11 | AC | 290 ms
53,480 KB |
testcase_12 | AC | 291 ms
53,756 KB |
testcase_13 | AC | 300 ms
53,668 KB |
testcase_14 | AC | 295 ms
53,632 KB |
testcase_15 | AC | 282 ms
53,960 KB |
testcase_16 | AC | 1,131 ms
78,376 KB |
testcase_17 | AC | 1,140 ms
82,628 KB |
testcase_18 | AC | 1,073 ms
73,368 KB |
testcase_19 | AC | 1,093 ms
79,336 KB |
testcase_20 | AC | 1,152 ms
79,864 KB |
testcase_21 | AC | 1,176 ms
81,304 KB |
testcase_22 | AC | 1,085 ms
77,580 KB |
testcase_23 | AC | 1,109 ms
76,540 KB |
testcase_24 | AC | 1,122 ms
76,604 KB |
testcase_25 | AC | 1,199 ms
81,016 KB |
testcase_26 | AC | 1,124 ms
77,612 KB |
testcase_27 | AC | 1,305 ms
81,132 KB |
testcase_28 | AC | 1,166 ms
76,204 KB |
testcase_29 | AC | 1,191 ms
80,440 KB |
testcase_30 | AC | 1,191 ms
80,944 KB |
testcase_31 | AC | 1,163 ms
80,960 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 dsu = DSU(m) val color_leaders = MutableList(n) { -1 } for ((box, color) in slimes) { if (color_leaders[color] == -1) { color_leaders[color] = box } else { dsu.merge(box, color_leaders[color]) } } val seen = mutableSetOf<Int>() var ans = 0 for (i in 0 until m) { if (seen.contains(dsu.leader(i))) { continue } ans += dsu.size(i) - 1 seen.add(dsu.leader(i)) } 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 } }