[Simulation] baekjoon-15686

Author: Seogeurim

Diff for: README.md

@@ -68,6 +68,7 @@
 | 29  |     | [Baekjoon-17406 배열 돌리기 4](./src/Simulation/P17406) |      |
 | 30  |     | [SWEA-9760 Poker Game](./src/Simulation/swea9760)     |      |
 | 31  |     | [SWEA-2115 벌꿀채취](./src/Simulation/swea2115)         |      |
+| 32  |     | [Baekjoon-15686 치킨 배달](./src/Simulation/P15686)     |      |
 
 ## String
 

Diff for: src/Simulation/P15686/Main.java

@@ -0,0 +1,68 @@
+package Simulation.P15686;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N, M, ans = Integer.MAX_VALUE;
+    static int[][] map;
+    static List<Pos> home, chicken;
+    static int[] selected;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Simulation/P15686/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+
+        map = new int[N][N];
+        home = new ArrayList<>();
+        chicken = new ArrayList<>();
+        for (int i = 0; i < N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < N; j++) {
+                map[i][j] = Integer.parseInt(st.nextToken());
+                if (map[i][j] == 1) home.add(new Pos(i, j));
+                else if (map[i][j] == 2) chicken.add(new Pos(i, j));
+            }
+        }
+
+        selected = new int[M];
+        dfs(0, 0);
+
+        System.out.println(ans);
+    }
+
+    static void dfs(int start, int cnt) {
+        if (cnt == M) {
+            int sum = 0;
+            for (Pos h : home) {
+                int dist = Integer.MAX_VALUE;
+                for (int s : selected) {
+                    Pos c = chicken.get(s);
+                    dist = Math.min(dist, Math.abs(h.i - c.i) + Math.abs(h.j - c.j));
+                }
+                sum += dist;
+            }
+            ans = Math.min(ans, sum);
+            return;
+        }
+
+        for (int i = start, size = chicken.size(); i < size; i++) {
+            selected[cnt] = i;
+            dfs(i+1, cnt+1);
+        }
+    }
+
+    static class Pos {
+        int i, j;
+
+        public Pos(int i, int j) {
+            this.i = i;
+            this.j = j;
+        }
+    }
+}

Diff for: src/Simulation/P15686/README.md

@@ -0,0 +1,5 @@
+## [baekjoon-15686] 치킨 배달
+
+![image](https://user-images.githubusercontent.com/22045163/115846031-76158380-a45c-11eb-838c-6db02c4c81ac.png)
+
+![image](https://user-images.githubusercontent.com/22045163/115846082-80d01880-a45c-11eb-8116-5da572d0c834.png)

Diff for: src/Simulation/P15686/input.txt

@@ -0,0 +1,6 @@
+5 1
+1 2 0 2 1
+1 2 0 2 1
+1 2 0 2 1
+1 2 0 2 1
+1 2 0 2 1