Submission #5360761

---

Source Code Expand

import java.io.IOException;
import java.io.InputStream;
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();
    	}
    	
    	UnionFindTree uf = new UnionFindTree(n);
    	
    	for(int i=0;i<q;i++){
    		
    		if(p[i]==0){
    			uf.unite(a[i], b[i]);
    		}
    		else{
    			if(uf.isEquivalent(a[i], b[i])){
    				System.out.println("Yes");
    			}
    			else{
    				System.out.println("No");
    			}
    		}
    		
    	}

    }
    
}

class UnionFindTree {
	int[] par;
	int[] rank;
	int[] peers; //仲間の数
	
	public UnionFindTree(int n){
		par = new int[n];
		rank = new int[n];
		peers = new int[n];
		
		for(int i=0;i<n;i++){
			par[i] = i;
			peers[i] = 1;
		}
	}
	
	int find(int x){
		if(par[x] == x){
			return x;
		}
		else{
			return par[x] = find(par[x]);
		}
	}
	
	void unite(int x, int y){
		int px = find(x);
		int py = find(y);
		
		if(px == py){
			return;
		}
		else if(rank[px] < rank[py]){
			peers[py] += peers[px];
			par[px] = py;

		}
		else{
			peers[px] += peers[py];
			par[py] = px;
			if(rank[px]==rank[py]){
				rank[px]++;
			}
		}
		
	}
	
	boolean isEquivalent(int x, int y){
		return find(x) == find(y);
	}
	
	int peersnum(int x){
		return peers[find(x)];
	}
}

Submission Info

Judge Result