Submission #3402857

---

Source Code Expand

import java.util.*;

public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int Q = sc.nextInt();
		int P[] = new int[Q];
		int A[] = new int[Q];
		int B[] = new int[Q];
		for(int i = 0; i < Q; i++) {
			P[i] = sc.nextInt();
			A[i] = sc.nextInt();
			B[i] = sc.nextInt();
		}
		
		UnionFind.init(N);
		for(int i = 0; i < Q; i++) {
			if(P[i] == 0) {
				UnionFind.unite(A[i], B[i]);
			} else {
				if(UnionFind.same(A[i], B[i])) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}
			}
		}
	}
}

class UnionFind {
	static int N;
	static int par[];
	static int rank[];
	public static void init(int n) {
		N = n;
		par = new int[N];
		rank = new int[N];
		for(int i = 0; i < N; i++) {
			par[i] = i;
			rank[i] = 0;
		}
	}
	
	public static int find(int x) {
		if(par[x] == x) {
			return x;
		} else {
			return par[x] = find(par[x]);
		}
	}
	
	public static void unite(int x, int y) {
		x = find(x);
		y = find(y);
		if(x == y) return;
		
		if(rank[x] < rank[y]) {
			par[x] = y;
		} else {
			par[y] = x;
			if(rank[x] == rank[y]) rank[x]++;
		}
	}
	
	public static boolean same(int x, int y) {
		return find(x) == find(y);
	}
}

Submission Info

Judge Result