結果
問題 | No.2072 Anatomy |
ユーザー | tenten |
提出日時 | 2023-01-20 10:39:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 416 ms / 2,000 ms |
コード長 | 3,177 bytes |
コンパイル時間 | 3,410 ms |
コンパイル使用メモリ | 90,140 KB |
実行使用メモリ | 67,900 KB |
最終ジャッジ日時 | 2023-09-05 04:57:54 |
合計ジャッジ時間 | 15,473 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,296 KB |
testcase_01 | AC | 46 ms
49,288 KB |
testcase_02 | AC | 52 ms
49,288 KB |
testcase_03 | AC | 56 ms
50,036 KB |
testcase_04 | AC | 50 ms
49,700 KB |
testcase_05 | AC | 55 ms
50,116 KB |
testcase_06 | AC | 53 ms
49,480 KB |
testcase_07 | AC | 56 ms
48,136 KB |
testcase_08 | AC | 382 ms
65,028 KB |
testcase_09 | AC | 394 ms
64,916 KB |
testcase_10 | AC | 408 ms
64,988 KB |
testcase_11 | AC | 399 ms
65,524 KB |
testcase_12 | AC | 374 ms
62,204 KB |
testcase_13 | AC | 410 ms
64,872 KB |
testcase_14 | AC | 339 ms
60,740 KB |
testcase_15 | AC | 314 ms
60,700 KB |
testcase_16 | AC | 415 ms
64,676 KB |
testcase_17 | AC | 397 ms
65,416 KB |
testcase_18 | AC | 299 ms
58,608 KB |
testcase_19 | AC | 390 ms
65,072 KB |
testcase_20 | AC | 393 ms
64,364 KB |
testcase_21 | AC | 416 ms
66,944 KB |
testcase_22 | AC | 410 ms
64,456 KB |
testcase_23 | AC | 416 ms
67,720 KB |
testcase_24 | AC | 416 ms
67,900 KB |
testcase_25 | AC | 408 ms
64,900 KB |
testcase_26 | AC | 45 ms
49,320 KB |
testcase_27 | AC | 413 ms
67,484 KB |
testcase_28 | AC | 388 ms
64,416 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(); ArrayDeque<Bridge> current = new ArrayDeque<>(); for (int i = 0; i < m; i++) { current.addFirst(new Bridge(sc.nextInt() - 1, sc.nextInt() - 1)); } UnionFindTree uft = new UnionFindTree(n); int ans = 0; while (current.size() > 0) { uft.unite(current.poll()); } System.out.println(uft.getCount(0)); } static class UnionFindTree { int[] parents; int[] counts; public UnionFindTree(int size) { parents = new int[size]; counts = 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) { int xx = find(x); int yy = find(y); if (xx == yy) { counts[xx]++; } else { counts[yy] = Math.max(counts[xx], counts[yy]) + 1; parents[xx] = yy; } } public void unite(Bridge x) { unite(x.left, x.right); } public int getCount(int x) { return counts[find(x)]; } } static class Bridge { int left; int right; public Bridge(int left, int right) { this.left = left; this.right = right; } } } 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(); } }