#243091 (Java21) No.3 ビットすごろく

• 問題: No.3 ビットすごろく
• ユーザー: Tsukasa_Type
• 提出日時: 2018-03-10 17:56:30
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 48 ms / 5,000 ms
• コード長: 2,431 bytes
• コンパイル時間: 2,068 ms
• コンパイル使用メモリ: 74,584 KB
• 実行使用メモリ: 49,596 KB
• 最終ジャッジ日時: 2023-09-14 00:57:23
• 合計ジャッジ時間: 4,797 ms
• ジャッジサーバーID （参考情報）: judge13 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	44 ms; 48,888 KB
testcase_01	AC	45 ms; 49,352 KB
testcase_02	AC	43 ms; 49,076 KB
testcase_03	AC	46 ms; 49,300 KB
testcase_04	AC	44 ms; 49,056 KB
testcase_05	AC	45 ms; 49,128 KB
testcase_06	AC	44 ms; 49,276 KB
testcase_07	AC	44 ms; 49,160 KB
testcase_08	AC	46 ms; 49,212 KB
testcase_09	AC	45 ms; 49,336 KB
testcase_10	AC	47 ms; 49,552 KB
testcase_11	AC	46 ms; 49,168 KB
testcase_12	AC	44 ms; 49,564 KB
testcase_13	AC	43 ms; 49,596 KB
testcase_14	AC	46 ms; 48,888 KB
testcase_15	AC	47 ms; 49,160 KB
testcase_16	AC	46 ms; 48,980 KB
testcase_17	AC	47 ms; 49,144 KB
testcase_18	AC	46 ms; 49,452 KB
testcase_19	AC	48 ms; 49,072 KB
testcase_20	AC	41 ms; 49,120 KB
testcase_21	AC	40 ms; 48,992 KB
testcase_22	AC	44 ms; 49,080 KB
testcase_23	AC	47 ms; 48,932 KB
testcase_24	AC	47 ms; 49,144 KB
testcase_25	AC	47 ms; 48,904 KB
testcase_26	AC	41 ms; 48,888 KB
testcase_27	AC	45 ms; 49,052 KB
testcase_28	AC	47 ms; 49,324 KB
testcase_29	AC	47 ms; 49,164 KB
testcase_30	AC	40 ms; 49,424 KB
testcase_31	AC	41 ms; 49,444 KB
testcase_32	AC	46 ms; 49,360 KB

ソースコード

import java.io.*;
import java.util.*;
import static java.lang.System.*;

public class Main {
	static FastScanner sc = new FastScanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] ar = new int[n+1];
		ar[1] = 1;
		ArrayDeque<Integer> deque = new ArrayDeque<>();
		deque.addLast(1);
		
		int pos,dist;
		int L,R;
		
		while (!deque.isEmpty()) {
			pos = deque.removeFirst();
			dist = Integer.bitCount(pos);
			L = pos-dist;
			R = pos+dist;
			if (L>0 && ar[L]==0) {
				ar[L] = ar[pos]+1;
				deque.addLast(L);
			}
			if (R<=n && ar[R]==0) {
				ar[R] = ar[pos]+1;
				deque.addLast(R);
			}
		}
		
		out.println(ar[n]==0?-1:ar[n]);
	}
}




class FastScanner implements Closeable {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	public FastScanner(InputStream in) {this.in = in;}
	private boolean hasNextByte() {
		if (ptr < buflen) {return true;}
		else{
			ptr = 0;
			try {buflen = in.read(buffer);}
			catch (IOException e) {e.printStackTrace();}
			if (buflen <= 0) {return false;}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {throw new NumberFormatException();}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}
			else{throw new NumberFormatException();}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
		return (int) nl;
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public void close() {
		try {in.close();}
		catch (IOException e) {}
	}
}