結果
問題 | No.1576 織姫と彦星 |
ユーザー | watarimaycry2 |
提出日時 | 2022-08-11 23:36:48 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 89 ms / 2,000 ms |
コード長 | 4,961 bytes |
コンパイル時間 | 2,602 ms |
コンパイル使用メモリ | 87,192 KB |
実行使用メモリ | 53,988 KB |
最終ジャッジ日時 | 2024-09-22 06:06:28 |
合計ジャッジ時間 | 8,191 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,328 KB |
testcase_01 | AC | 53 ms
50,380 KB |
testcase_02 | AC | 55 ms
50,696 KB |
testcase_03 | AC | 53 ms
50,584 KB |
testcase_04 | AC | 53 ms
50,696 KB |
testcase_05 | AC | 55 ms
50,428 KB |
testcase_06 | AC | 53 ms
50,608 KB |
testcase_07 | AC | 59 ms
50,672 KB |
testcase_08 | AC | 57 ms
50,548 KB |
testcase_09 | AC | 56 ms
50,624 KB |
testcase_10 | AC | 83 ms
51,696 KB |
testcase_11 | AC | 55 ms
50,296 KB |
testcase_12 | AC | 76 ms
50,908 KB |
testcase_13 | AC | 78 ms
51,220 KB |
testcase_14 | AC | 88 ms
53,988 KB |
testcase_15 | AC | 82 ms
51,616 KB |
testcase_16 | AC | 64 ms
50,736 KB |
testcase_17 | AC | 80 ms
51,184 KB |
testcase_18 | AC | 59 ms
50,612 KB |
testcase_19 | AC | 64 ms
50,940 KB |
testcase_20 | AC | 60 ms
50,348 KB |
testcase_21 | AC | 80 ms
51,392 KB |
testcase_22 | AC | 61 ms
50,996 KB |
testcase_23 | AC | 55 ms
50,292 KB |
testcase_24 | AC | 59 ms
50,508 KB |
testcase_25 | AC | 70 ms
50,992 KB |
testcase_26 | AC | 77 ms
51,152 KB |
testcase_27 | AC | 54 ms
50,632 KB |
testcase_28 | AC | 78 ms
51,228 KB |
testcase_29 | AC | 67 ms
51,116 KB |
testcase_30 | AC | 54 ms
50,312 KB |
testcase_31 | AC | 65 ms
50,696 KB |
testcase_32 | AC | 71 ms
51,208 KB |
testcase_33 | AC | 89 ms
51,976 KB |
testcase_34 | AC | 56 ms
50,696 KB |
testcase_35 | AC | 78 ms
51,232 KB |
testcase_36 | AC | 58 ms
50,380 KB |
testcase_37 | AC | 80 ms
51,728 KB |
testcase_38 | AC | 75 ms
51,724 KB |
testcase_39 | AC | 79 ms
51,252 KB |
testcase_40 | AC | 65 ms
50,556 KB |
testcase_41 | AC | 78 ms
50,816 KB |
testcase_42 | AC | 56 ms
50,664 KB |
testcase_43 | AC | 58 ms
50,160 KB |
testcase_44 | AC | 88 ms
51,976 KB |
testcase_45 | AC | 61 ms
50,564 KB |
testcase_46 | AC | 82 ms
51,608 KB |
testcase_47 | AC | 56 ms
50,656 KB |
testcase_48 | AC | 81 ms
51,568 KB |
testcase_49 | AC | 81 ms
51,472 KB |
testcase_50 | AC | 54 ms
50,692 KB |
testcase_51 | AC | 56 ms
50,660 KB |
testcase_52 | AC | 64 ms
50,712 KB |
testcase_53 | AC | 78 ms
52,160 KB |
testcase_54 | AC | 82 ms
51,392 KB |
testcase_55 | AC | 82 ms
51,928 KB |
testcase_56 | AC | 86 ms
52,068 KB |
testcase_57 | AC | 55 ms
50,572 KB |
testcase_58 | AC | 59 ms
50,608 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(); int S = nextInt(); int T = nextInt(); int tmpL = S; int tmpR = T; int tmpC = 0; while(tmpL > 0 || tmpR > 0){ if(tmpL % 2 != tmpR % 2){ tmpC++; } tmpL /= 2; tmpR /= 2; } if(tmpC <= 1){ myout(0); return; } HashSet<Integer> list = new HashSet<>(nextIntArray(N)); list.add(S); list.add(T); HashMap<Integer, Integer> access = new HashMap<>(); ArrayDeque<Integer> queue = new ArrayDeque<>(); queue.add(S); access.put(S, 0); while(queue.size() > 0){ int now = queue.pollFirst(); int size = 31; for(int i = 0; i < size; i++){ int nx = now ^ (1 << i); if(list.contains(nx) && !access.containsKey(nx)){ queue.add(nx); access.put(nx, access.get(now) + 1); } } } if(access.containsKey(T)){ myout(access.get(T) - 1); }else{ myout(-1); } } //メソッド追加エリア ここから static class Node{ int V; ArrayList<Integer> child = new ArrayList<>(); int access = -1; Node(int V){ this.V = V; } public String toString(){ return child.toString(); } } //メソッド追加エリア ここまで }