結果
問題 |
No.3 ビットすごろく
|
ユーザー |
![]() |
提出日時 | 2015-02-21 03:04:48 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 67 ms / 5,000 ms |
コード長 | 2,627 bytes |
コンパイル時間 | 2,325 ms |
コンパイル使用メモリ | 79,764 KB |
実行使用メモリ | 52,392 KB |
最終ジャッジ日時 | 2024-07-01 07:15:19 |
合計ジャッジ時間 | 5,345 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
import java.awt.Point; import java.io.BufferedReader; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Comparator; import java.util.LinkedList; import java.util.List; import java.util.Queue; public class Main { public static final int INF = 1 << 30; public static int[] dp; public static int n; public static void main(String[] args) throws NumberFormatException, IOException{ ContestScanner in = new ContestScanner(); n = in.nextInt(); dp = new int[n+1]; for(int i=0; i<=n; i++){ dp[i] = INF; } dp[1] = 1; dfs(1, 1); if(dp[n] == INF) System.out.println(-1); else System.out.println(dp[n]); } public static void dfs(int pos, int turn){ int bit = Integer.bitCount(pos); int nxt = pos + bit; if(0 < nxt && nxt <= n){ if(dp[nxt] > turn+1){ dp[nxt] = turn+1; dfs(nxt, turn+1); } } nxt = pos - bit; if(0 < nxt && nxt <= n){ if(dp[nxt] > turn+1){ dp[nxt] = turn+1; dfs(nxt, turn+1); } } } } class Pair{ int cost; int time; public Pair(int cost, int time){ this.cost = cost; this.time = time; } } class MyComp implements Comparator<int[]>{ public int compare(int[] a, int[] b) { return a[0] - b[0]; } } class Reverse implements Comparator<Integer>{ public int compare(Integer arg0, Integer arg1) { return arg1 - arg0; } } class Node{ int color; boolean checked; List<Integer> to = new ArrayList<Integer>(); public Node(){ checked = false; } } //class Node{ // int id; // List<Node> edge = new ArrayList<Node>(); // public Node(int id){ // this.id = id; // } // public void createEdge(Node node){ // edge.add(node); // } //} class ContestScanner{ private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(System.in)); } public ContestScanner(String filename) throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename))); } public String nextToken() throws IOException{ if(line == null || line.length <= idx){ line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } public long nextLong() throws IOException, NumberFormatException{ return Long.parseLong(nextToken()); } public int nextInt() throws NumberFormatException, IOException{ return (int)nextLong(); } public double nextDouble() throws NumberFormatException, IOException{ return Double.parseDouble(nextToken()); } }