[Algorithm] 백준 알고리즘 1697 (숨바꼭질)

 

java 코드

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 HideSeek {
	static int N,K;
	static boolean visited[];
	public static void main(String[] args) 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[100001];
		
		solve();
	}
	static void solve() {
		Queue <int[]> q = new LinkedList<>();
		q.add(new int[] {N, 0});

		visited[N]=true;
		while(!q.isEmpty()) {
			int location[] = q.poll();
			int x = location[0];
			int time = location[1];
			
			if(x==K) {
				System.out.println(time);
			}
			if(x-1>=0&&!visited[x-1]) {
				q.add(new int[] {x-1, time+1});
				visited[x-1]=true;
			}
			if(x+1<=100000&&!visited[x+1]) {
				q.add(new int[] {x+1, time+1});
				visited[x+1]=true;
			}
			if(2*x<=100000&&!visited[2*x]) {
				q.add(new int[] {2*x, time+1});
				visited[2*x]=true;
			}
		}
	}
}