結果
問題 | No.2418 情報通だよ!Nafmoくん |
ユーザー |
![]() |
提出日時 | 2023-08-17 10:01:06 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 291 ms / 2,000 ms |
コード長 | 2,822 bytes |
コンパイル時間 | 3,189 ms |
コンパイル使用メモリ | 92,312 KB |
実行使用メモリ | 58,668 KB |
最終ジャッジ日時 | 2024-11-14 12:25:11 |
合計ジャッジ時間 | 8,511 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
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() * 2;int m = sc.nextInt();UnionFindTree uft = new UnionFindTree(n);while (m-- > 0) {uft.unite(sc.nextInt() - 1, sc.nextInt() - 1);}System.out.println(uft.getAns());}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;counts[i] = 1;}}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) {parents[xx] = yy;counts[yy] += counts[xx];}}public int getAns() {int ans = 0;for (int i = 0; i < parents.length; i++) {if (parents[i] == i) {ans += counts[i] % 2;}}return ans / 2;}}}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();}}