DAY56

冗余连接

import java.util.*;

public class Test {
    private static int[]father;
    public static void findinit(int n){
        father=new int[n];
        for(int i=0;i<n;i++){
            father[i]=i;
        }
    }
    public static int find(int u){
        if(u==father[u])return u;
        return find(father[u]);
    }
    public static void join(int u,int v){
        u=find(u);
        v=find(v);
        if(u==v)return;
        father[u]=v;
    }
    public static boolean isSame(int u,int v){
        u=find(u);
        v=find(v);
        return u==v;
    }
    public static void main(String[] args) {
        Scanner in =new Scanner(System.in);
        int n=in.nextInt();
        
        findinit(n+1);
        for(int i=0;i<n;i++){
            int u=in.nextInt();
            int v=in.nextInt();
            if(!isSame(u, v)){
                join(u, v);
            }else{
                System.out.println(u+" "+v);
            }
            
        }

        
    }
}