結果
問題 | No.1576 織姫と彦星 |
ユーザー | watarimaycry2 |
提出日時 | 2022-08-11 23:23:23 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 140 ms / 2,000 ms |
コード長 | 5,246 bytes |
コンパイル時間 | 2,647 ms |
コンパイル使用メモリ | 81,824 KB |
実行使用メモリ | 52,980 KB |
最終ジャッジ日時 | 2024-09-22 05:57:12 |
合計ジャッジ時間 | 10,222 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,688 KB |
testcase_01 | AC | 54 ms
50,624 KB |
testcase_02 | AC | 53 ms
50,624 KB |
testcase_03 | AC | 54 ms
50,624 KB |
testcase_04 | AC | 53 ms
50,716 KB |
testcase_05 | AC | 56 ms
50,688 KB |
testcase_06 | AC | 57 ms
50,720 KB |
testcase_07 | AC | 96 ms
52,312 KB |
testcase_08 | AC | 94 ms
52,332 KB |
testcase_09 | AC | 57 ms
50,688 KB |
testcase_10 | AC | 123 ms
52,668 KB |
testcase_11 | AC | 58 ms
50,696 KB |
testcase_12 | AC | 105 ms
52,592 KB |
testcase_13 | AC | 128 ms
52,232 KB |
testcase_14 | AC | 116 ms
52,508 KB |
testcase_15 | AC | 113 ms
52,356 KB |
testcase_16 | AC | 121 ms
52,576 KB |
testcase_17 | AC | 111 ms
52,476 KB |
testcase_18 | AC | 92 ms
52,352 KB |
testcase_19 | AC | 98 ms
52,572 KB |
testcase_20 | AC | 123 ms
52,532 KB |
testcase_21 | AC | 114 ms
52,492 KB |
testcase_22 | AC | 121 ms
52,748 KB |
testcase_23 | AC | 88 ms
52,624 KB |
testcase_24 | AC | 92 ms
52,452 KB |
testcase_25 | AC | 120 ms
52,492 KB |
testcase_26 | AC | 103 ms
52,636 KB |
testcase_27 | AC | 63 ms
50,468 KB |
testcase_28 | AC | 118 ms
52,216 KB |
testcase_29 | AC | 101 ms
52,372 KB |
testcase_30 | AC | 56 ms
50,496 KB |
testcase_31 | AC | 96 ms
52,548 KB |
testcase_32 | AC | 111 ms
52,520 KB |
testcase_33 | AC | 137 ms
52,620 KB |
testcase_34 | AC | 58 ms
50,340 KB |
testcase_35 | AC | 104 ms
52,724 KB |
testcase_36 | AC | 89 ms
52,456 KB |
testcase_37 | AC | 140 ms
52,600 KB |
testcase_38 | AC | 119 ms
52,600 KB |
testcase_39 | AC | 104 ms
52,600 KB |
testcase_40 | AC | 102 ms
52,672 KB |
testcase_41 | AC | 104 ms
52,696 KB |
testcase_42 | AC | 70 ms
51,708 KB |
testcase_43 | AC | 90 ms
52,460 KB |
testcase_44 | AC | 134 ms
52,672 KB |
testcase_45 | AC | 97 ms
52,444 KB |
testcase_46 | AC | 120 ms
52,980 KB |
testcase_47 | AC | 99 ms
52,556 KB |
testcase_48 | AC | 106 ms
52,688 KB |
testcase_49 | AC | 103 ms
52,576 KB |
testcase_50 | AC | 61 ms
50,344 KB |
testcase_51 | AC | 99 ms
52,496 KB |
testcase_52 | AC | 134 ms
52,692 KB |
testcase_53 | AC | 114 ms
52,584 KB |
testcase_54 | AC | 119 ms
52,524 KB |
testcase_55 | AC | 128 ms
52,552 KB |
testcase_56 | AC | 136 ms
52,480 KB |
testcase_57 | AC | 57 ms
50,288 KB |
testcase_58 | AC | 94 ms
52,420 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; } Node[] list = new Node[N + 2]; for(int i = 0; i < N; i++){ list[i] = new Node(nextInt()); } list[N] = new Node(S); list[N + 1] = new Node(T); for(int i = 0; i < N + 2; i++){ for(int j = i + 1; j < N + 2; j++){ int L = list[i].V; int R = list[j].V; int C = 0; while(L > 0 || R > 0){ if(L % 2 != R % 2){ C++; } L /= 2; R /= 2; } if(C <= 1){ list[i].child.add(j); list[j].child.add(i); } } } ArrayDeque<Integer> queue = new ArrayDeque<>(); queue.add(N); list[N].access = 0; while(queue.size() > 0){ int now = queue.pollFirst(); Node node = list[now]; ArrayList<Integer> child = node.child; for(int nx : child){ if(list[nx].access == -1){ list[nx].access = list[now].access + 1; queue.add(nx); } } } myout(Math.max(list[N + 1].access - 1, -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(); } } //メソッド追加エリア ここまで }