結果
問題 | No.3 ビットすごろく |
ユーザー | kusomushi |
提出日時 | 2018-12-18 19:59:49 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,202 bytes |
コンパイル時間 | 2,378 ms |
コンパイル使用メモリ | 80,896 KB |
実行使用メモリ | 57,220 KB |
最終ジャッジ日時 | 2023-10-25 23:42:31 |
合計ジャッジ時間 | 6,915 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
53,400 KB |
testcase_01 | AC | 52 ms
53,400 KB |
testcase_02 | AC | 53 ms
52,332 KB |
testcase_03 | AC | 70 ms
54,264 KB |
testcase_04 | AC | 57 ms
53,420 KB |
testcase_05 | AC | 93 ms
55,008 KB |
testcase_06 | AC | 85 ms
54,304 KB |
testcase_07 | AC | 63 ms
54,040 KB |
testcase_08 | AC | 89 ms
54,308 KB |
testcase_09 | AC | 95 ms
57,220 KB |
testcase_10 | AC | 102 ms
57,112 KB |
testcase_11 | AC | 95 ms
57,052 KB |
testcase_12 | AC | 90 ms
54,832 KB |
testcase_13 | AC | 83 ms
54,040 KB |
testcase_14 | AC | 103 ms
57,140 KB |
testcase_15 | AC | 107 ms
57,036 KB |
testcase_16 | AC | 94 ms
57,080 KB |
testcase_17 | AC | 105 ms
57,044 KB |
testcase_18 | AC | 69 ms
54,048 KB |
testcase_19 | AC | 108 ms
57,044 KB |
testcase_20 | AC | 56 ms
53,424 KB |
testcase_21 | AC | 53 ms
53,400 KB |
testcase_22 | AC | 105 ms
55,180 KB |
testcase_23 | AC | 104 ms
56,680 KB |
testcase_24 | AC | 124 ms
56,876 KB |
testcase_25 | AC | 105 ms
57,056 KB |
testcase_26 | AC | 53 ms
53,400 KB |
testcase_27 | AC | 80 ms
54,304 KB |
testcase_28 | AC | 109 ms
57,048 KB |
testcase_29 | AC | 93 ms
57,056 KB |
testcase_30 | AC | 55 ms
53,416 KB |
testcase_31 | AC | 56 ms
53,420 KB |
testcase_32 | WA | - |
ソースコード
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[] A = new int[N*2]; int[] B = new int[N*2]; for (int i = 0; i < N; i++) { int n = i+1; int cnt = Integer.bitCount(n); if( n + cnt <= N ) { A[i*2] = n; B[i*2] = n + cnt; } if( n - cnt >= 1 ) { A[i*2+1] = n; B[i*2+1] = n - cnt; } } int[][] G = adjD(N+1, A, B); ArrayDeque<Integer> q = new ArrayDeque<>(); q.add(1); int[] dist = new int[N+1]; Arrays.fill(dist, Integer.MAX_VALUE); dist[1] = 0; while( !q.isEmpty() ) { int a = q.poll(); for (int next : G[a]) { if( dist[next] > dist[a] + 1 ) { dist[next] = dist[a] + 1; q.add(next); } } } if( dist[N] == Integer.MAX_VALUE ) { return -1; } else { return dist[N] + 1; } } static int[][] adjD(int n, int[] from, int[] to) { Set<Integer> set = new HashSet<>(); int[][] adj = new int[n][]; int[] cnt = new int[n]; for (int i = 0; i < from.length; i++) { int f = from[i]; int t = to[i]; if( f == t ) continue; int key = Math.min(f, t) * 10000 + Math.max(f, t); if( set.contains(key) ) continue; cnt[f]++; set.add(key); } for (int i = 0; i < n; i++) { adj[i] = new int[cnt[i]]; } set.clear(); for (int i = 0; i < from.length; i++) { int f = from[i]; int t = to[i]; if( f == t ) continue; int key = Math.min(f, t) * 10000 + Math.max(f, t); if( set.contains(key) ) continue; adj[from[i]][--cnt[from[i]]] = to[i]; set.add(key); } return adj; } @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()); } }