-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main1697.java
65 lines (55 loc) · 1.38 KB
/
Main1697.java
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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
public class Main1697 {
static boolean[] visit;
static int cnt = 0;
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int K = Integer.parseInt(st.nextToken());
visit = new boolean[100000 + 1];
if(N==K) {
cnt = 0;
}else {
bfs(N,K);
}
System.out.println(cnt);
}
static void bfs(int N,int K) {
Queue<Info> q = new LinkedList<>();
visit[N] = true;
q.offer(new Info(N,0));
while(!q.isEmpty()) {
Info n = q.poll();
if(n.x -1 == K || n.x+1 == K || n.x*2 == K) {
cnt = n.time+1;
return;
}
if(n.x-1>=0 && !visit[n.x-1]) {
visit[n.x] = true;
q.offer(new Info(n.x-1,n.time+1));
}
if(n.x+1 <=100000 && !visit[n.x+1]) {
visit[n.x+1] = true;
q.offer(new Info(n.x+1,n.time+1));
}
if(n.x*2 >0 && n.x*2 <=100000 && !visit[2*n.x]) {
visit[2*n.x] = true;
q.offer(new Info(2*n.x,n.time+1));
}
}
}
static class Info{
int x,time;
public Info(int x, int time) {
super();
this.x = x;
this.time = time;
}
}
}