結果

問題 No.2290 UnUnion Find
ユーザー watarimaycry2watarimaycry2
提出日時 2023-06-08 21:54:27
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,277 ms / 2,000 ms
コード長 5,758 bytes
コンパイル時間 3,161 ms
コンパイル使用メモリ 91,232 KB
実行使用メモリ 117,920 KB
最終ジャッジ日時 2024-12-31 06:12:12
合計ジャッジ時間 56,134 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
50,536 KB
testcase_01 AC 57 ms
50,708 KB
testcase_02 AC 666 ms
80,472 KB
testcase_03 AC 925 ms
97,932 KB
testcase_04 AC 991 ms
103,732 KB
testcase_05 AC 967 ms
102,220 KB
testcase_06 AC 971 ms
103,628 KB
testcase_07 AC 976 ms
101,436 KB
testcase_08 AC 984 ms
103,440 KB
testcase_09 AC 990 ms
102,672 KB
testcase_10 AC 994 ms
102,616 KB
testcase_11 AC 979 ms
103,088 KB
testcase_12 AC 969 ms
102,612 KB
testcase_13 AC 993 ms
102,476 KB
testcase_14 AC 991 ms
102,340 KB
testcase_15 AC 976 ms
104,028 KB
testcase_16 AC 968 ms
102,536 KB
testcase_17 AC 984 ms
104,536 KB
testcase_18 AC 1,000 ms
103,412 KB
testcase_19 AC 1,068 ms
104,172 KB
testcase_20 AC 1,258 ms
117,920 KB
testcase_21 AC 783 ms
91,396 KB
testcase_22 AC 910 ms
95,660 KB
testcase_23 AC 927 ms
95,812 KB
testcase_24 AC 1,068 ms
103,976 KB
testcase_25 AC 909 ms
91,820 KB
testcase_26 AC 1,202 ms
104,220 KB
testcase_27 AC 1,152 ms
106,200 KB
testcase_28 AC 1,006 ms
100,616 KB
testcase_29 AC 1,130 ms
110,748 KB
testcase_30 AC 785 ms
88,456 KB
testcase_31 AC 1,226 ms
104,516 KB
testcase_32 AC 931 ms
92,040 KB
testcase_33 AC 1,093 ms
99,772 KB
testcase_34 AC 1,277 ms
117,668 KB
testcase_35 AC 1,202 ms
110,376 KB
testcase_36 AC 922 ms
92,216 KB
testcase_37 AC 990 ms
97,704 KB
testcase_38 AC 919 ms
92,516 KB
testcase_39 AC 953 ms
96,424 KB
testcase_40 AC 1,184 ms
106,156 KB
testcase_41 AC 923 ms
91,388 KB
testcase_42 AC 1,032 ms
101,916 KB
testcase_43 AC 1,001 ms
104,792 KB
testcase_44 AC 983 ms
103,876 KB
testcase_45 AC 999 ms
103,212 KB
testcase_46 AC 1,136 ms
102,784 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ　ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			try{
				BufferedReader br = new BufferedReader(new InputStreamReader(System.in, "UTF-8"));
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object... t){System.err.print("debug:");System.err.println(Arrays.deepToString(t));}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ　ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		int N = nextInt();
		UnionFind uf = new UnionFind(N);
		TreeSet<Integer> set = new TreeSet<>();
		for(int i = 0; i < N; i++){
			set.add(i);
		}
		int Q = nextInt();
		for(int i = 0; i < Q; i++){
			int t = nextInt();
			if(t == 1){
				int L = nextInt() - 1;
				int R = nextInt() - 1;
				int p1 = uf.getRootIndex(L);
				int p2 = uf.getRootIndex(R);
				uf.doUnion(L, R);
				if(p1 != uf.getRootIndex(L)){
					set.remove(p1);
				}
				if(p2 != uf.getRootIndex(R)){
					set.remove(p2);
				}
			}else{
				int V = nextInt() - 1;
				if(set.size() == 1){
					myout("-1");
				}else{
					int p = uf.getRootIndex(V);
					if(set.first() == p){
						myout(set.last() + 1);
					}else{
						myout(set.first() + 1);
					}
				}
			}
		}
	}
	//メソッド追加エリア　ここから

//UnionFind
static class UnionFind{
    int[] list;
    int group;
    UnionFind(int size){
        list = new int[size];
        Arrays.fill(list, -1);
        group = size;
    }
    boolean isSame(int L, int R){
        return getRootIndex(L) == getRootIndex(R);
    }
    int getRootIndex(int index){
        if(list[index] < 0){
            return index;
        }else{
            list[index] = getRootIndex(list[index]);
            return list[index];
        }
    }
    void doUnion(int L, int R){
        int Lroot = getRootIndex(L);
        int Rroot = getRootIndex(R);
        if(Lroot != Rroot){
            group--;
            if(getSize(Lroot) >= getSize(Rroot)){
                int tmp = Lroot;
                Lroot = Rroot;
                Rroot = tmp;
            }
            list[Lroot] += list[Rroot];
            list[Rroot] = Lroot;
        }
    }
    int getSize(int index){
        return -list[getRootIndex(index)];
    }
    int getGroupCount(){
        return group;
    }
    boolean isRoot(int index){
        return getRootIndex(index) == index;
    }
}


	//メソッド追加エリア　ここまで
}
0