[BruteForce] swea-1247

Author: Seogeurim

README.md

@@ -64,6 +64,7 @@
 | 04  |     | [Baekjoon-3040 백설 공주와 일곱 난쟁이](./src/BruteForce/P3040)    |      |
 | 05  |     | [Baekjoon-14889 스타트와 링크](./src/BruteForce/P14889)   | 삼성 SW 역량 테스트 기출 |
 | 06  |     | [Baekjoon-16637 괄호 추가하기](./src/BruteForce/P16637)   | 삼성 A형 기출 |
+| 07  |     | [SWEA-1247 최적 경로](./src/BruteForce/swea1247)         |      |
 
 ## DFS & BFS
 

src/BruteForce/swea1247/README.md

@@ -0,0 +1,6 @@
+## [SW Expert Academy - 1247] 최적 경로
+
+![image](https://user-images.githubusercontent.com/22045163/108326561-bca4f280-720d-11eb-98af-2da95f3c42b3.png)
+![image](https://user-images.githubusercontent.com/22045163/108326630-cd556880-720d-11eb-9e73-146f69667ff1.png)
+
+![image](https://user-images.githubusercontent.com/22045163/108326410-8bc4bd80-720d-11eb-9144-75cce182cc4e.png)

src/BruteForce/swea1247/Solution.java

@@ -0,0 +1,69 @@
+package BruteForce.swea1247;
+
+import java.io.*;
+import java.util.StringTokenizer;
+
+public class Solution {
+
+    static int T, N, min;
+    static Position start, end;
+    static Position[] people;
+    static boolean[] visited;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/BruteForce/swea1247/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        T = stoi(br.readLine());
+        for (int t = 1; t <= T; t++) {
+            N = stoi(br.readLine());
+            people = new Position[N];
+            visited = new boolean[N];
+            min = Integer.MAX_VALUE;
+
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            start = new Position(stoi(st.nextToken()), stoi(st.nextToken()));
+            end = new Position(stoi(st.nextToken()), stoi(st.nextToken()));
+            for (int i = 0; i < N; i++) {
+                people[i] = new Position(stoi(st.nextToken()), stoi(st.nextToken()));
+            }
+
+            dfs(start, 0, 0);
+
+            sb.append("#").append(t).append(" ").append(min).append("\n");
+        }
+        System.out.println(sb.toString());
+    }
+
+    static void dfs(Position cur, int count, int dist) {
+        if (dist > min) return;
+        if (count == N) {
+            min = Math.min(min, dist + end.getDist(cur));
+            return;
+        }
+
+        for (int i = 0; i < N; i++) {
+            if (!visited[i]) {
+                visited[i] = true;
+                dfs(people[i], count+1, dist + people[i].getDist(cur));
+                visited[i] = false;
+            }
+        }
+    }
+
+    static int stoi(String s) { return Integer.parseInt(s); }
+
+    static class Position {
+        int x, y;
+
+        public Position(int x, int y) {
+            this.x = x;
+            this.y = y;
+        }
+
+        public int getDist(Position p) {
+            return Math.abs(this.x - p.x) + Math.abs(this.y - p.y);
+        }
+    }
+}

src/BruteForce/swea1247/input.txt

@@ -0,0 +1,21 @@
+10
+5
+0 0 100 100 70 40 30 10 10 5 90 70 50 20
+6
+88 81 85 80 19 22 31 15 27 29 30 10 20 26 5 14
+7
+22 47 72 42 61 93 8 31 72 54 0 64 26 71 93 87 84 83
+8
+30 20 43 14 58 5 91 51 55 87 40 91 14 55 28 80 75 24 74 63
+9
+3 9 100 100 16 52 18 19 35 67 42 29 47 68 59 38 68 81 80 37 94 92
+10
+39 9 97 61 35 93 62 64 96 39 36 36 9 59 59 96 61 7 64 43 43 58 1 36
+10
+26 100 72 2 71 100 29 48 74 51 27 0 58 0 35 2 43 47 50 49 44 100 66 96
+10
+46 25 16 6 48 82 80 21 49 34 60 25 93 90 26 96 12 100 44 69 28 15 57 63
+10
+94 83 72 42 43 36 59 44 52 57 34 49 65 79 14 20 41 9 0 39 100 94 53 3
+10
+32 79 0 0 69 58 100 31 67 67 58 66 83 22 44 24 68 3 76 85 63 87 7 86

src/BruteForce/swea1247/output.txt

@@ -0,0 +1,10 @@
+#1 200
+#2 304
+#3 265
+#4 307
+#5 306
+#6 366
+#7 256
+#8 399
+#9 343
+#10 391