-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathBOJ1697.java
More file actions
81 lines (66 loc) · 2.29 KB
/
BOJ1697.java
File metadata and controls
81 lines (66 loc) · 2.29 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class BOJ1697 {
static final int maxIdx = 100000;
static int n, k;
static boolean[] visited;
static int[] distance;
private static void input() throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
n = Integer.parseInt(st.nextToken());
k = Integer.parseInt(st.nextToken());
visited = new boolean[maxIdx + 1];
distance = new int[maxIdx + 1];
}
public static void main(String[] args) throws IOException {
input();
process();
}
private static void process() {
bfs(n);
System.out.println(distance[k]);
}
private static void bfs(int startIdx) {
Queue<Integer> queue = new LinkedList<>();
queue.add(startIdx);
visited[startIdx] = true;
while (!queue.isEmpty()) {
int thisIdx = queue.poll();
int nextIdx = thisIdx - 1;
if (nextIdx >= 0 && nextIdx <= maxIdx && !visited[nextIdx]) {
queue.add(nextIdx);
visited[nextIdx] = true;
distance[nextIdx] = distance[thisIdx] + 1;
}
nextIdx = thisIdx + 1;
if (nextIdx >= 0 && nextIdx <= maxIdx && !visited[nextIdx]) {
queue.add(nextIdx);
visited[nextIdx] = true;
distance[nextIdx] = distance[thisIdx] + 1;
}
nextIdx = thisIdx * 2;
if (nextIdx >= 0 && nextIdx <= maxIdx && !visited[nextIdx]) {
queue.add(nextIdx);
visited[nextIdx] = true;
distance[nextIdx] = distance[thisIdx] + 1;
}
}
}
private static void printArray(int[][] array) {
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array[i].length; j++) {
System.out.print(array[i][j] + " ");
}
System.out.println();
}
}
private static void printArray(int[] array) {
for (int i = 0; i < array.length; i++) {
System.out.print(array[i]);
}
System.out.println();
}
}