結果
問題 | No.3 ビットすごろく |
ユーザー | kusomushi |
提出日時 | 2018-12-18 20:18:43 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 546 ms / 5,000 ms |
コード長 | 4,956 bytes |
コンパイル時間 | 3,224 ms |
コンパイル使用メモリ | 76,816 KB |
実行使用メモリ | 66,480 KB |
最終ジャッジ日時 | 2023-09-14 01:10:15 |
合計ジャッジ時間 | 8,851 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,316 KB |
testcase_01 | AC | 44 ms
49,704 KB |
testcase_02 | AC | 44 ms
49,532 KB |
testcase_03 | AC | 59 ms
50,644 KB |
testcase_04 | AC | 48 ms
49,636 KB |
testcase_05 | AC | 90 ms
52,116 KB |
testcase_06 | AC | 60 ms
50,632 KB |
testcase_07 | AC | 57 ms
50,440 KB |
testcase_08 | AC | 87 ms
53,680 KB |
testcase_09 | AC | 139 ms
55,152 KB |
testcase_10 | AC | 209 ms
60,936 KB |
testcase_11 | AC | 121 ms
54,572 KB |
testcase_12 | AC | 86 ms
53,800 KB |
testcase_13 | AC | 59 ms
50,480 KB |
testcase_14 | AC | 191 ms
59,340 KB |
testcase_15 | AC | 419 ms
64,812 KB |
testcase_16 | AC | 239 ms
61,092 KB |
testcase_17 | AC | 391 ms
64,572 KB |
testcase_18 | AC | 59 ms
50,712 KB |
testcase_19 | AC | 546 ms
66,192 KB |
testcase_20 | AC | 49 ms
49,384 KB |
testcase_21 | AC | 44 ms
49,424 KB |
testcase_22 | AC | 189 ms
58,812 KB |
testcase_23 | AC | 525 ms
66,148 KB |
testcase_24 | AC | 534 ms
66,480 KB |
testcase_25 | AC | 427 ms
64,876 KB |
testcase_26 | AC | 44 ms
49,404 KB |
testcase_27 | AC | 60 ms
50,260 KB |
testcase_28 | AC | 231 ms
60,996 KB |
testcase_29 | AC | 121 ms
54,804 KB |
testcase_30 | AC | 45 ms
49,188 KB |
testcase_31 | AC | 45 ms
49,256 KB |
testcase_32 | AC | 110 ms
54,928 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.function.Function; public class Main { static int N; public static void main(String[] args) { FastScanner sc = new FastScanner(System.in); N = sc.nextInt(); System.out.println(solve()); } static int solve() { int[] dist = new int[N+1]; Arrays.fill(dist, Integer.MAX_VALUE); dist[1] = 0; ArrayDeque<Integer> q = new ArrayDeque<>(); q.add(1); while( !q.isEmpty() ) { int a = q.poll(); int cnt = Integer.bitCount(a); if( a + cnt <= N && dist[a+cnt] >= dist[a] + 1) { dist[a+cnt] = dist[a]+1; q.add(a+cnt); } if( a - cnt >= 1 && dist[a-cnt] >= dist[a] + 1) { dist[a-cnt] = dist[a]+1; q.add(a-cnt); } } if( dist[N] == Integer.MAX_VALUE ) { return -1; } else { return dist[N] + 1; } } @SuppressWarnings("unused") static class FastScanner { private BufferedReader reader; private StringTokenizer tokenizer; FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } long nextLong() { return Long.parseLong(next()); } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } int[] nextIntArray(int n, int delta) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt() + delta; return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } } static <A> void writeLines(A[] as, Function<A, String> f) { PrintWriter pw = new PrintWriter(System.out); for (A a : as) pw.println(f.apply(a)); pw.flush(); } static void writeLines(int[] as) { PrintWriter pw = new PrintWriter(System.out); for (int a : as) pw.println(a); pw.flush(); } static void writeLines(long[] as) { PrintWriter pw = new PrintWriter(System.out); for (long a : as) pw.println(a); pw.flush(); } static void writeSingleLine(int[] as) { PrintWriter pw = new PrintWriter(System.out); for (int i = 0; i < as.length; i++) { if (i != 0) pw.print(" "); pw.print(i); } pw.println(); pw.flush(); } static int max(int... as) { int max = Integer.MIN_VALUE; for (int a : as) max = Math.max(a, max); return max; } static int min(int... as) { int min = Integer.MAX_VALUE; for (int a : as) min = Math.min(a, min); return min; } static int lowerBound(int[] array, int value) { int low = 0; int high = array.length; int mid; while (low < high) { mid = ((high - low) >>> 1) + low; if (array[mid] < value) low = mid + 1; else high = mid; } return low; } static int upperBound(long[] array, long value) { int low = 0; int high = array.length; int mid; while (low < high) { mid = ((high - low) >>> 1) + low; if (array[mid] <= value) low = mid + 1; else high = mid; } return low; } static void debug(Object... args) { StringJoiner j = new StringJoiner(" "); for (Object arg : args) { if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg)); else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg)); else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg)); else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg)); else j.add(arg.toString()); } System.err.println(j.toString()); } }