結果

問題 No.1576 織姫と彦星
ユーザー watarimaycry2watarimaycry2
提出日時 2022-08-11 23:23:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 131 ms / 2,000 ms
コード長 5,246 bytes
コンパイル時間 2,935 ms
コンパイル使用メモリ 89,072 KB
実行使用メモリ 56,104 KB
最終ジャッジ日時 2023-10-22 04:37:47
合計ジャッジ時間 10,503 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
53,756 KB
testcase_01 AC 51 ms
51,756 KB
testcase_02 AC 51 ms
53,768 KB
testcase_03 AC 52 ms
53,760 KB
testcase_04 AC 51 ms
53,768 KB
testcase_05 AC 52 ms
53,760 KB
testcase_06 AC 52 ms
52,684 KB
testcase_07 AC 90 ms
55,824 KB
testcase_08 AC 86 ms
55,816 KB
testcase_09 AC 54 ms
53,784 KB
testcase_10 AC 114 ms
54,028 KB
testcase_11 AC 55 ms
53,772 KB
testcase_12 AC 98 ms
54,012 KB
testcase_13 AC 127 ms
55,840 KB
testcase_14 AC 105 ms
56,056 KB
testcase_15 AC 106 ms
56,064 KB
testcase_16 AC 110 ms
56,028 KB
testcase_17 AC 101 ms
56,056 KB
testcase_18 AC 83 ms
55,776 KB
testcase_19 AC 88 ms
56,048 KB
testcase_20 AC 107 ms
55,812 KB
testcase_21 AC 105 ms
56,068 KB
testcase_22 AC 111 ms
56,060 KB
testcase_23 AC 80 ms
55,772 KB
testcase_24 AC 84 ms
55,776 KB
testcase_25 AC 108 ms
55,804 KB
testcase_26 AC 96 ms
55,904 KB
testcase_27 AC 68 ms
53,780 KB
testcase_28 AC 105 ms
55,804 KB
testcase_29 AC 91 ms
56,104 KB
testcase_30 AC 53 ms
53,764 KB
testcase_31 AC 90 ms
53,860 KB
testcase_32 AC 102 ms
56,060 KB
testcase_33 AC 131 ms
56,104 KB
testcase_34 AC 56 ms
53,780 KB
testcase_35 AC 101 ms
56,100 KB
testcase_36 AC 85 ms
55,760 KB
testcase_37 AC 122 ms
56,084 KB
testcase_38 AC 107 ms
56,076 KB
testcase_39 AC 97 ms
56,040 KB
testcase_40 AC 94 ms
55,788 KB
testcase_41 AC 96 ms
55,896 KB
testcase_42 AC 60 ms
53,768 KB
testcase_43 AC 82 ms
55,840 KB
testcase_44 AC 120 ms
56,080 KB
testcase_45 AC 94 ms
55,840 KB
testcase_46 AC 107 ms
56,084 KB
testcase_47 AC 82 ms
55,772 KB
testcase_48 AC 99 ms
56,100 KB
testcase_49 AC 96 ms
56,048 KB
testcase_50 AC 57 ms
53,784 KB
testcase_51 AC 89 ms
55,772 KB
testcase_52 AC 115 ms
55,852 KB
testcase_53 AC 106 ms
56,064 KB
testcase_54 AC 111 ms
56,072 KB
testcase_55 AC 116 ms
56,076 KB
testcase_56 AC 123 ms
56,080 KB
testcase_57 AC 53 ms
53,772 KB
testcase_58 AC 88 ms
55,788 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();
		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();
	}
}

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