結果
問題 | No.3 ビットすごろく |
ユーザー |
![]() |
提出日時 | 2015-06-20 14:36:36 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 138 ms / 5,000 ms |
コード長 | 2,046 bytes |
コンパイル時間 | 3,645 ms |
コンパイル使用メモリ | 77,608 KB |
実行使用メモリ | 38,608 KB |
最終ジャッジ日時 | 2024-07-01 07:27:01 |
合計ジャッジ時間 | 7,833 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
import java.io.InputStream; import java.io.InputStreamReader; import java.io.BufferedReader; import java.io.OutputStream; import java.io.PrintWriter; import java.io.IOException; import java.util.Arrays; import java.util.StringTokenizer; public class Yuki3 { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Solver solver = new Solver(); solver.solve(1, in, out); out.close(); } static class Solver { final int INF = Integer.MAX_VALUE; public void solve(int testNumber, InputReader in, PrintWriter out) { n = in.nextInt(); moves = new int[n+1]; Arrays.fill(moves, INF); moves[1] = 1; dfs(1, 1); int ans = moves[n] == INF ? -1 : moves[n]; System.out.println(ans); } int n; int[] moves; public void dfs(int cur, int move) { int dist = Integer.bitCount(cur); int next = cur-dist; if (0 < next) { if (move+1 < moves[next]) { moves[next] = move+1; dfs(next, move+1); } } next = cur+dist; if (next <= n) { if (move+1 < moves[next]) { moves[next] = move+1; dfs(next, move+1); } } } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } } }