[JAVA/백준] SW 역량 테스트 준비-기초 | 그래프와 BFS: 이모티콘

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
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

/**
 * @author HEESOO
 *
 */
public class Main {
	static int s;
	static boolean[][] visit;
	public static int bfs() {
		Queue<Node> q=new LinkedList<>();
		visit[1][0]=true;
		q.offer(new Node(1, 0, 0));
		
		while(!q.isEmpty()) {
			Node node=q.poll();
			if(node.len==s) return node.cnt;
			
			if(!visit[node.len][node.len]) {//복사
				visit[node.len][node.len]=true;
				q.offer(new Node(node.len, node.len, node.cnt+1));
			}				
			if(node.buf!=0 && !visit[node.len+node.buf][node.buf] && node.len+node.buf<=1000) {//붙여넣기
				visit[node.len+node.buf][node.buf]=true;
				q.offer(new Node(node.len+node.buf, node.buf, node.cnt+1));
			}
			if(node.len>0 && !visit[node.len-1][node.buf]) {
				visit[node.len-1][node.buf]=true;
				q.offer(new Node(node.len-1, node.buf, node.cnt+1));
			}
		}
		return -1;
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		s=scan.nextInt();
		visit=new boolean[2002][2002];
		
		System.out.println(bfs());
	}
}
class Node{
	int len;
	int buf;
	int cnt;
	public Node(int l, int b, int c) {
		this.len=l;
		this.buf=b;
		this.cnt=c;
	}
}