結果
問題 | No.3 ビットすごろく |
ユーザー |
![]() |
提出日時 | 2015-02-02 20:57:26 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 69 ms / 5,000 ms |
コード長 | 3,025 bytes |
コンパイル時間 | 2,286 ms |
コンパイル使用メモリ | 78,216 KB |
実行使用メモリ | 50,512 KB |
最終ジャッジ日時 | 2024-07-01 07:12:44 |
合計ジャッジ時間 | 5,269 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
import java.io.IOException; import java.util.InputMismatchException; import java.util.LinkedList; import java.util.Queue; public class Main { int n; int[] step, memo; int bfs() { class Q implements Comparable<Q> { int pos, dep; Q(int pos, int dep) { this.pos = pos; this.dep = dep; } public int compareTo(Q o) { return this.pos != o.pos ? this.pos - o.pos : this.dep - o.dep; } } Queue<Q> queue = new LinkedList<Q>(); queue.add(new Q(1, 0)); boolean[] visit = new boolean[n]; while (!queue.isEmpty()) { Q q = queue.poll(); int pos = q.pos; int dep = q.dep; if (pos == n) { return dep + 1; } if (visit[pos]) continue; visit[pos] = true; int s = step[pos]; if (0 <= pos - s) queue.add(new Q(pos - s, dep + 1)); if (pos + s <= n) queue.add(new Q(pos + s, dep + 1)); } return -1; } void run() { MyScanner sc = new MyScanner(); n = sc.nextInt(); step = new int[n]; for (int i = 0; i < n; i++) { step[i] = Integer.bitCount(i); } System.out.println(bfs()); } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }