結果
問題 | No.3 ビットすごろく |
ユーザー | threepipes_s |
提出日時 | 2015-02-21 03:04:48 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 54 ms / 5,000 ms |
コード長 | 2,627 bytes |
コンパイル時間 | 2,397 ms |
コンパイル使用メモリ | 78,340 KB |
実行使用メモリ | 52,852 KB |
最終ジャッジ日時 | 2023-09-13 23:03:55 |
合計ジャッジ時間 | 5,480 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,200 KB |
testcase_01 | AC | 43 ms
49,256 KB |
testcase_02 | AC | 41 ms
49,280 KB |
testcase_03 | AC | 43 ms
49,528 KB |
testcase_04 | AC | 42 ms
49,512 KB |
testcase_05 | AC | 47 ms
49,488 KB |
testcase_06 | AC | 44 ms
49,468 KB |
testcase_07 | AC | 43 ms
49,444 KB |
testcase_08 | AC | 46 ms
49,572 KB |
testcase_09 | AC | 52 ms
51,204 KB |
testcase_10 | AC | 54 ms
49,636 KB |
testcase_11 | AC | 51 ms
51,052 KB |
testcase_12 | AC | 46 ms
50,044 KB |
testcase_13 | AC | 44 ms
49,992 KB |
testcase_14 | AC | 54 ms
52,852 KB |
testcase_15 | AC | 52 ms
51,216 KB |
testcase_16 | AC | 53 ms
50,832 KB |
testcase_17 | AC | 52 ms
51,384 KB |
testcase_18 | AC | 40 ms
49,252 KB |
testcase_19 | AC | 52 ms
51,004 KB |
testcase_20 | AC | 40 ms
49,748 KB |
testcase_21 | AC | 39 ms
49,244 KB |
testcase_22 | AC | 52 ms
48,932 KB |
testcase_23 | AC | 53 ms
51,312 KB |
testcase_24 | AC | 52 ms
51,200 KB |
testcase_25 | AC | 52 ms
51,168 KB |
testcase_26 | AC | 40 ms
49,484 KB |
testcase_27 | AC | 43 ms
49,236 KB |
testcase_28 | AC | 50 ms
51,592 KB |
testcase_29 | AC | 51 ms
51,636 KB |
testcase_30 | AC | 40 ms
49,540 KB |
testcase_31 | AC | 42 ms
49,404 KB |
testcase_32 | AC | 52 ms
51,316 KB |
ソースコード
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()); } }