Submission #421085

---

Source Code Expand

import java.util.*;
public class Main {
	public static int[] par = new int[100000];
	public static int[] rank = new int[100000];
	public static void init(int n){
		for(int i = 0; i<n;i++){
			par[i]=i;
			rank[i]=0;
		}
	}
	public static int root(int x){
		if(par[x]==x)return x;
		else{
			int temp = root(par[x]);
			par[x]=temp;
			return temp;
		}
	}
	public static boolean same(int x, int y){
		return root(x)==root(y);
	}
	public static void unite(int x, int y){
		x = root(x);
		y = root(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 void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int N=s.nextInt();
		int Q=s.nextInt();
		init(N);
		for(int i = 0; i<Q;i++){
			int P = s.nextInt();
			if(P==0){
				unite(s.nextInt(),s.nextInt());
			}
			if(P==1){
				if(same(s.nextInt(),s.nextInt())){
					System.out.println("Yes");
				}else System.out.println("No");
			}
		}
	}
}

Submission Info

Judge Result