結果
問題 | No.2290 UnUnion Find |
ユーザー | watarimaycry2 |
提出日時 | 2023-06-08 21:54:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,314 ms / 2,000 ms |
コード長 | 5,758 bytes |
コンパイル時間 | 3,893 ms |
コンパイル使用メモリ | 89,992 KB |
実行使用メモリ | 117,524 KB |
最終ジャッジ日時 | 2023-08-30 01:34:44 |
合計ジャッジ時間 | 55,530 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
49,800 KB |
testcase_01 | AC | 46 ms
33,844 KB |
testcase_02 | AC | 622 ms
83,688 KB |
testcase_03 | AC | 893 ms
98,264 KB |
testcase_04 | AC | 931 ms
103,496 KB |
testcase_05 | AC | 911 ms
102,264 KB |
testcase_06 | AC | 917 ms
105,408 KB |
testcase_07 | AC | 919 ms
103,032 KB |
testcase_08 | AC | 919 ms
103,220 KB |
testcase_09 | AC | 925 ms
98,668 KB |
testcase_10 | AC | 941 ms
102,704 KB |
testcase_11 | AC | 945 ms
102,072 KB |
testcase_12 | AC | 937 ms
103,816 KB |
testcase_13 | AC | 935 ms
104,560 KB |
testcase_14 | AC | 909 ms
102,484 KB |
testcase_15 | AC | 929 ms
104,972 KB |
testcase_16 | AC | 931 ms
102,284 KB |
testcase_17 | AC | 958 ms
105,060 KB |
testcase_18 | AC | 939 ms
100,912 KB |
testcase_19 | AC | 974 ms
104,128 KB |
testcase_20 | AC | 1,101 ms
110,428 KB |
testcase_21 | AC | 720 ms
90,348 KB |
testcase_22 | AC | 878 ms
96,496 KB |
testcase_23 | AC | 901 ms
96,032 KB |
testcase_24 | AC | 1,080 ms
106,288 KB |
testcase_25 | AC | 848 ms
92,092 KB |
testcase_26 | AC | 1,122 ms
112,444 KB |
testcase_27 | AC | 1,057 ms
111,088 KB |
testcase_28 | AC | 948 ms
103,404 KB |
testcase_29 | AC | 1,009 ms
104,880 KB |
testcase_30 | AC | 748 ms
89,292 KB |
testcase_31 | AC | 1,015 ms
105,632 KB |
testcase_32 | AC | 867 ms
92,840 KB |
testcase_33 | AC | 929 ms
101,116 KB |
testcase_34 | AC | 1,314 ms
117,524 KB |
testcase_35 | AC | 1,207 ms
115,012 KB |
testcase_36 | AC | 869 ms
92,712 KB |
testcase_37 | AC | 933 ms
98,888 KB |
testcase_38 | AC | 880 ms
92,544 KB |
testcase_39 | AC | 904 ms
96,672 KB |
testcase_40 | AC | 1,079 ms
111,808 KB |
testcase_41 | AC | 892 ms
92,284 KB |
testcase_42 | AC | 1,001 ms
106,960 KB |
testcase_43 | AC | 990 ms
104,872 KB |
testcase_44 | AC | 933 ms
101,428 KB |
testcase_45 | AC | 929 ms
100,928 KB |
testcase_46 | AC | 968 ms
101,688 KB |
ソースコード
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; } } //メソッド追加エリア ここまで }