結果
問題 | No.2563 色ごとのグループ |
ユーザー | tenten |
提出日時 | 2023-12-04 16:00:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,002 ms / 2,000 ms |
コード長 | 3,011 bytes |
コンパイル時間 | 2,928 ms |
コンパイル使用メモリ | 85,132 KB |
実行使用メモリ | 104,472 KB |
最終ジャッジ日時 | 2023-12-04 16:00:47 |
合計ジャッジ時間 | 18,132 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
53,980 KB |
testcase_01 | AC | 54 ms
53,984 KB |
testcase_02 | AC | 55 ms
53,964 KB |
testcase_03 | AC | 53 ms
53,988 KB |
testcase_04 | AC | 58 ms
53,964 KB |
testcase_05 | AC | 56 ms
53,996 KB |
testcase_06 | AC | 56 ms
53,980 KB |
testcase_07 | AC | 56 ms
53,996 KB |
testcase_08 | AC | 55 ms
53,968 KB |
testcase_09 | AC | 60 ms
53,984 KB |
testcase_10 | AC | 57 ms
53,984 KB |
testcase_11 | AC | 60 ms
53,968 KB |
testcase_12 | AC | 57 ms
54,012 KB |
testcase_13 | AC | 57 ms
53,976 KB |
testcase_14 | AC | 96 ms
55,272 KB |
testcase_15 | AC | 121 ms
55,552 KB |
testcase_16 | AC | 110 ms
55,912 KB |
testcase_17 | AC | 123 ms
55,916 KB |
testcase_18 | AC | 96 ms
54,892 KB |
testcase_19 | AC | 148 ms
58,040 KB |
testcase_20 | AC | 206 ms
61,004 KB |
testcase_21 | AC | 157 ms
60,548 KB |
testcase_22 | AC | 160 ms
58,460 KB |
testcase_23 | AC | 185 ms
58,956 KB |
testcase_24 | AC | 556 ms
71,848 KB |
testcase_25 | AC | 621 ms
80,512 KB |
testcase_26 | AC | 764 ms
85,480 KB |
testcase_27 | AC | 1,002 ms
103,536 KB |
testcase_28 | AC | 820 ms
87,164 KB |
testcase_29 | AC | 930 ms
104,472 KB |
testcase_30 | AC | 918 ms
104,332 KB |
testcase_31 | AC | 947 ms
104,344 KB |
testcase_32 | AC | 968 ms
104,364 KB |
testcase_33 | AC | 645 ms
67,192 KB |
testcase_34 | AC | 668 ms
66,804 KB |
testcase_35 | AC | 646 ms
66,100 KB |
testcase_36 | AC | 651 ms
67,176 KB |
testcase_37 | AC | 652 ms
67,180 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); int[] colors = new int[n]; for (int i = 0; i < n; i++) { colors[i] = sc.nextInt(); } UnionFindTree uft = new UnionFindTree(n); for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; if (colors[a] == colors[b]) { uft.unite(a, b); } } HashMap<Integer, HashSet<Integer>> parents = new HashMap<>(); for (int i = 0; i < n; i++) { if (!parents.containsKey(colors[i])) { parents.put(colors[i], new HashSet<>()); } parents.get(colors[i]).add(uft.find(i)); } int ans = 0; for (HashSet<Integer> x : parents.values()) { ans += x.size() - 1; } System.out.println(ans); } static class UnionFindTree { int[] parents; public UnionFindTree(int size) { parents = new int[size]; for (int i = 0; i < size; i++) { parents[i] = i; } } public int find(int x) { if (x == parents[x]) { return x; } else { return parents[x] = find(parents[x]); } } public boolean same(int x, int y) { return find(x) == find(y); } public void unite(int x, int y) { if (!same(x, y)) { parents[find(x)] = find(y); } } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }