結果

問題 No.3 ビットすごろく
ユーザー tutuztutuz
提出日時 2018-09-22 08:07:14
言語 Java19
(openjdk 21)
結果
AC  
実行時間 134 ms / 5,000 ms
コード長 3,162 bytes
コンパイル時間 4,210 ms
コンパイル使用メモリ 74,612 KB
実行使用メモリ 52,384 KB
最終ジャッジ日時 2023-09-14 01:07:23
合計ジャッジ時間 8,261 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
47,516 KB
testcase_01 AC 46 ms
49,792 KB
testcase_02 AC 45 ms
49,496 KB
testcase_03 AC 66 ms
49,352 KB
testcase_04 AC 57 ms
51,460 KB
testcase_05 AC 81 ms
49,960 KB
testcase_06 AC 63 ms
51,356 KB
testcase_07 AC 60 ms
51,336 KB
testcase_08 AC 73 ms
51,832 KB
testcase_09 AC 95 ms
51,772 KB
testcase_10 AC 109 ms
51,772 KB
testcase_11 AC 88 ms
51,680 KB
testcase_12 AC 79 ms
51,452 KB
testcase_13 AC 62 ms
51,232 KB
testcase_14 AC 105 ms
51,996 KB
testcase_15 AC 131 ms
51,864 KB
testcase_16 AC 120 ms
52,332 KB
testcase_17 AC 133 ms
51,780 KB
testcase_18 AC 60 ms
51,084 KB
testcase_19 AC 134 ms
52,144 KB
testcase_20 AC 55 ms
51,420 KB
testcase_21 AC 47 ms
49,776 KB
testcase_22 AC 109 ms
51,764 KB
testcase_23 AC 132 ms
52,184 KB
testcase_24 AC 133 ms
52,384 KB
testcase_25 AC 131 ms
51,836 KB
testcase_26 AC 46 ms
49,584 KB
testcase_27 AC 63 ms
51,056 KB
testcase_28 AC 119 ms
51,964 KB
testcase_29 AC 90 ms
51,496 KB
testcase_30 AC 46 ms
49,504 KB
testcase_31 AC 47 ms
49,548 KB
testcase_32 AC 82 ms
51,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		long[] a;
		int n;
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			n = in.nextInt();
			a = new long[1 << 16];
			Arrays.fill(a, INF);

			f(1, 1);
			out.println(a[n] == INF ? -1 : a[n]);


		}

		void f(int now, int cnt) {
			if (now > n) return;

			a[now] = cnt;
			int c = Integer.bitCount(now);

			if (a[now] + 1 < a[now - c]) {
				f(now - c, cnt + 1);
			}

			if (a[now] + 1 < a[now + c]) {
				f(now + c, cnt + 1);
			}
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0