結果
問題 | No.3 ビットすごろく |
ユーザー | crazybbb3 |
提出日時 | 2016-11-27 12:25:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 96 ms / 5,000 ms |
コード長 | 3,712 bytes |
コンパイル時間 | 2,318 ms |
コンパイル使用メモリ | 75,804 KB |
実行使用メモリ | 54,540 KB |
最終ジャッジ日時 | 2023-09-14 00:13:38 |
合計ジャッジ時間 | 6,057 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,776 KB |
testcase_01 | AC | 46 ms
49,744 KB |
testcase_02 | AC | 47 ms
49,912 KB |
testcase_03 | AC | 62 ms
50,876 KB |
testcase_04 | AC | 52 ms
49,828 KB |
testcase_05 | AC | 74 ms
52,180 KB |
testcase_06 | AC | 61 ms
50,972 KB |
testcase_07 | AC | 58 ms
49,976 KB |
testcase_08 | AC | 69 ms
51,736 KB |
testcase_09 | AC | 78 ms
51,776 KB |
testcase_10 | AC | 91 ms
54,084 KB |
testcase_11 | AC | 89 ms
52,080 KB |
testcase_12 | AC | 72 ms
52,152 KB |
testcase_13 | AC | 60 ms
50,836 KB |
testcase_14 | AC | 90 ms
51,760 KB |
testcase_15 | AC | 94 ms
54,336 KB |
testcase_16 | AC | 94 ms
54,124 KB |
testcase_17 | AC | 94 ms
54,540 KB |
testcase_18 | AC | 59 ms
49,936 KB |
testcase_19 | AC | 96 ms
54,504 KB |
testcase_20 | AC | 51 ms
49,916 KB |
testcase_21 | AC | 47 ms
50,120 KB |
testcase_22 | AC | 83 ms
54,108 KB |
testcase_23 | AC | 95 ms
54,252 KB |
testcase_24 | AC | 95 ms
53,956 KB |
testcase_25 | AC | 94 ms
54,292 KB |
testcase_26 | AC | 47 ms
49,932 KB |
testcase_27 | AC | 61 ms
51,040 KB |
testcase_28 | AC | 95 ms
54,476 KB |
testcase_29 | AC | 86 ms
51,984 KB |
testcase_30 | AC | 48 ms
49,732 KB |
testcase_31 | AC | 49 ms
49,908 KB |
testcase_32 | AC | 85 ms
51,904 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.PriorityQueue; import java.util.StringTokenizer; public class Main { static BufferedReader in; static PrintWriter out; static StringTokenizer tok; void solve() throws IOException { int n = ni(); ArrayList<ArrayList<Edge>> G = new ArrayList<>(); for (int i = 0; i < n + 1; i++) { G.add(new ArrayList<>()); } for (int i = 1; i <= n; i++) { int bitNum = Integer.bitCount(i); if (i - bitNum >= 1) { G.get(i).add(new Edge(i - bitNum, 1)); } if (i + bitNum <= n) { G.get(i).add(new Edge(i + bitNum, 1)); } } Dijkstra d = new Dijkstra(G); int[] dist = d.getDist(1); int INF = Integer.MAX_VALUE / 3; out.println(dist[n] == INF ? -1 : dist[n] + 1); } class Dijkstra { int n; ArrayList<ArrayList<Edge>> G; int INF = Integer.MAX_VALUE / 3; public Dijkstra(ArrayList<ArrayList<Edge>> G) { n = G.size(); this.G = G; } int[] getDist(int s) { PriorityQueue<Pair> Q = new PriorityQueue<>(); Q.add(new Pair(s, 0)); int[] dist = new int[n]; Arrays.fill(dist, INF); boolean[] used = new boolean[n]; while (!Q.isEmpty()) { Pair p = Q.poll(); if (used[p.x]) continue; used[p.x] = true; dist[p.x] = p.y; for (Edge e : G.get(p.x)) { Q.add(new Pair(e.to, p.y + e.cost)); } } return dist; } public class Pair implements Comparable<Pair> { int x, y; public Pair(int x, int y) { this.x = x; this.y = y; } public int compareTo(Pair p) { return y - p.y; } } } class Edge implements Comparable<Edge> { int to; int cost; public Edge(int to, int cost) { this.to = to; this.cost = cost; } public int compareTo(Edge edge) { return cost - edge.cost; } } String ns() throws IOException { while (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine(), " "); } return tok.nextToken(); } int ni() throws IOException { return Integer.parseInt(ns()); } long nl() throws IOException { return Long.parseLong(ns()); } double nd() throws IOException { return Double.parseDouble(ns()); } String[] nsa(int n) throws IOException { String[] res = new String[n]; for (int i = 0; i < n; i++) { res[i] = ns(); } return res; } int[] nia(int n) throws IOException { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = ni(); } return res; } long[] nla(int n) throws IOException { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nl(); } return res; } public static void main(String[] args) throws IOException { in = new BufferedReader(new InputStreamReader(System.in)); out = new PrintWriter(System.out); tok = new StringTokenizer(""); Main main = new Main(); main.solve(); out.close(); } }