結果
問題 | No.1390 Get together |
ユーザー | tzyvrn |
提出日時 | 2021-02-12 23:47:59 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 769 ms / 2,000 ms |
コード長 | 2,905 bytes |
コンパイル時間 | 14,082 ms |
コンパイル使用メモリ | 428,488 KB |
実行使用メモリ | 70,072 KB |
最終ジャッジ日時 | 2023-09-27 07:36:21 |
合計ジャッジ時間 | 33,120 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 273 ms
52,968 KB |
testcase_01 | AC | 267 ms
52,996 KB |
testcase_02 | AC | 275 ms
52,972 KB |
testcase_03 | AC | 399 ms
57,340 KB |
testcase_04 | AC | 377 ms
57,068 KB |
testcase_05 | AC | 386 ms
57,448 KB |
testcase_06 | AC | 404 ms
56,688 KB |
testcase_07 | AC | 375 ms
56,952 KB |
testcase_08 | AC | 377 ms
56,696 KB |
testcase_09 | AC | 421 ms
57,948 KB |
testcase_10 | AC | 269 ms
52,988 KB |
testcase_11 | AC | 270 ms
53,036 KB |
testcase_12 | AC | 265 ms
53,196 KB |
testcase_13 | AC | 271 ms
53,000 KB |
testcase_14 | AC | 263 ms
53,252 KB |
testcase_15 | AC | 258 ms
52,980 KB |
testcase_16 | AC | 679 ms
68,836 KB |
testcase_17 | AC | 717 ms
68,936 KB |
testcase_18 | AC | 702 ms
68,744 KB |
testcase_19 | AC | 697 ms
68,576 KB |
testcase_20 | AC | 718 ms
68,880 KB |
testcase_21 | AC | 679 ms
69,180 KB |
testcase_22 | AC | 689 ms
70,072 KB |
testcase_23 | AC | 731 ms
68,640 KB |
testcase_24 | AC | 729 ms
69,008 KB |
testcase_25 | AC | 683 ms
68,616 KB |
testcase_26 | AC | 686 ms
68,852 KB |
testcase_27 | AC | 769 ms
68,676 KB |
testcase_28 | AC | 742 ms
68,872 KB |
testcase_29 | AC | 697 ms
69,636 KB |
testcase_30 | AC | 696 ms
69,556 KB |
testcase_31 | AC | 706 ms
69,016 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 = List(n) { val (b, c) = readLine()!!.split(" ").map { it.toInt() } 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 } }