結果
問題 | No.2664 Prime Sum |
ユーザー | tenten |
提出日時 | 2024-03-12 11:16:11 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 97 ms / 2,000 ms |
コード長 | 2,450 bytes |
コンパイル時間 | 2,017 ms |
コンパイル使用メモリ | 78,328 KB |
実行使用メモリ | 51,868 KB |
最終ジャッジ日時 | 2024-09-29 22:14:44 |
合計ジャッジ時間 | 5,458 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 37 |
ソースコード
import java.io.*;import java.util.*;import java.util.function.*;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();UnionFindTree uft = new UnionFindTree(n);while (m-- > 0) {uft.unite(sc.nextInt() - 1, sc.nextInt() - 1);}System.out.println(uft.isMatch() ? "Yes" : "No");}static class UnionFindTree {int size;int[] parents;public UnionFindTree(int size) {this.size = size;parents = new int[size * 2];for (int i = 0; i < size * 2; 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 + size, y)) {parents[find(x + size)] = find(y);}if (!same(x, y + size)) {parents[find(x)] = find(y + size);}}public boolean isMatch() {for (int i = 0; i < size; i++) {if (same(i, i + size)) {return false;}}return true;}}}class Scanner {BufferedReader br;StringTokenizer st = new StringTokenizer("");StringBuilder sb = new StringBuilder();public Scanner() {try {br = new BufferedReader(new InputStreamReader(System.in));} catch (Exception e) {}}public int nextInt() {return Integer.parseInt(next());}public long nextLong() {return Long.parseLong(next());}public double nextDouble() {return Double.parseDouble(next());}public String next() {try {while (!st.hasMoreTokens()) {st = new StringTokenizer(br.readLine());}} catch (Exception e) {e.printStackTrace();} finally {return st.nextToken();}}}