Repository navigation
Expand file tree
/
Copy pathbeer_walk.java
More file actions
72 lines (61 loc) · 1.8 KB
/
Copy pathbeer_walk.java
File metadata and controls
72 lines (61 loc) · 1.8 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
import java.io.*;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.StringTokenizer;
public class beer_walk {
static int n = 0, sx = 0, sy = 0, dx = 0, dy = 0;
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st;
int t = Integer.parseInt(br.readLine()); // 테스트 케이스 개수
for(int j = 0; j < t; j++) {
n = Integer.parseInt(br.readLine()); // 편의점 개수
List<int[]> list = new ArrayList<>();
for(int i = 0; i < n + 2; i++) {
st = new StringTokenizer(br.readLine());
int x = Integer.parseInt(st.nextToken());
int y = Integer.parseInt(st.nextToken());
if(i == 0) { // sx ,sy : 상근이네 집 좌표
sx = x;
sy = y;
}
else if(i == n + 1) { // dx, dy : 페스티벌 좌표
dx = x;
dy = y;
}
else {
list.add(new int[]{x, y}); // 편의점 좌표
}
}
bw.write(bfs(list)? "happy\n" : "sad\n");
}
bw.flush();
bw.close();
}
static boolean bfs(List<int[]> list) {
Queue<int[]> q = new LinkedList<>();
boolean[] visited = new boolean[n];
q.add(new int[] {sx, sy});
while(!q.isEmpty()) {
int[] pos = q.poll();
int px = pos[0], py = pos[1];
if(Math.abs(px - dx) + Math.abs(py - dy) <= 1000) { // 편의점을 안거치고 20병 만으로 도착
return true;
}
for(int i = 0; i < n; i++) {
if(!visited[i]) {
int nx = list.get(i)[0], ny = list.get(i)[1];
int dis = Math.abs(px - nx) + Math.abs(py - ny);
if(dis <= 1000) {
visited[i] = true;
q.add(new int[]{nx, ny});
}
}
}
}
return false;
}
}