[Simulation] baekjoon-19236

Author: Seogeurim

README.md

@@ -70,6 +70,7 @@
 | 31  |     | [SWEA-2115 벌꿀채취](./src/Simulation/swea2115)         |      |
 | 32  |     | [Baekjoon-15686 치킨 배달](./src/Simulation/P15686)     |      |
 | 33  |     | [Baekjoon-21608 상어 초등학교](./src/Simulation/P21608)   |      |
+| 34  |     | [Baekjoon-19236 청소년 상어](./src/Simulation/P19236)     |      |
 
 ## String
 

src/Simulation/P19236/Main.java

@@ -0,0 +1,111 @@
+package Simulation.P19236;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    final static int[] di = {0, -1, -1, 0, 1, 1, 1, 0, -1};
+    final static int[] dj = {0, 0, -1, -1, -1, 0, 1, 1, 1};
+
+    static int ans;
+    static int[][] map;
+    static Pos[] fishes;
+    static boolean[] shark;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Simulation/P19236/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        map = new int[4][4];
+        fishes = new Pos[17];
+        shark = new boolean[17];
+
+        for (int i = 0; i < 4; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < 4; j++) {
+                int v = Integer.parseInt(st.nextToken());
+                int d = Integer.parseInt(st.nextToken());
+                map[i][j] = v;
+                fishes[v] = new Pos(i, j, d);
+            }
+        }
+
+        int start = map[0][0];
+        shark[start] = true;
+        moveFish(0, 0);
+        moveShark(0, 0, fishes[start].d, start);
+
+        System.out.println(ans);
+    }
+
+    static void moveShark(int i, int j, int d, int sum) {
+
+        int tmp = map[i][j];
+        map[i][j] = 0;
+        for (int k = 1; k < 4; k++) {
+            int to_i = i + di[d]*k;
+            int to_j = j + dj[d]*k;
+
+            if (!isValidPath(to_i, to_j) || map[to_i][to_j] == 0) continue;
+
+            Pos[] copyFish = new Pos[17];
+            System.arraycopy(fishes, 1, copyFish, 1, 16);
+
+            shark[map[to_i][to_j]] = true;
+            moveFish(to_i, to_j);
+            moveShark(to_i, to_j, fishes[map[to_i][to_j]].d, sum+map[to_i][to_j]);
+
+            shark[map[to_i][to_j]] = false;
+            System.arraycopy(copyFish, 1, fishes, 1, 16);
+            map = new int[4][4];
+            for (int f = 1; f <= 16; f++) {
+                if (shark[f]) continue;
+                Pos p = fishes[f];
+                map[p.i][p.j] = f;
+            }
+        }
+        map[i][j] = tmp;
+
+        ans = Math.max(ans, sum);
+    }
+
+    static void moveFish(int sh_i, int sh_j) {
+        for (int i = 1; i <= 16; i++) {
+            if (shark[i]) continue;
+            Pos fish = fishes[i];
+            for (int k = fish.d; k < fish.d+8; k++) {
+                int to_d = k > 8 ? k-8 : k;
+                int to_i = fish.i + di[to_d];
+                int to_j = fish.j + dj[to_d];
+                if (!isValidPath(to_i, to_j) || (to_i == sh_i && to_j == sh_j)) continue;
+
+                if (map[to_i][to_j] == 0) {
+                    fishes[i] = new Pos(to_i, to_j, to_d);
+                } else {
+                    Pos tmp = fishes[map[to_i][to_j]];
+                    fishes[i] = new Pos(tmp.i, tmp.j, to_d);
+                    fishes[map[to_i][to_j]] = new Pos(fish.i, fish.j, tmp.d);
+                }
+                int tmpVal = map[fish.i][fish.j];
+                map[fish.i][fish.j] = map[to_i][to_j];
+                map[to_i][to_j] = tmpVal;
+                break;
+            }
+        }
+    }
+
+    static boolean isValidPath(int i, int j) {
+        return 0 <= i && i < 4 && 0 <= j && j < 4;
+    }
+
+    static class Pos {
+        int i, j, d;
+
+        public Pos(int i, int j, int d) {
+            this.i = i;
+            this.j = j;
+            this.d = d;
+        }
+    }
+}

src/Simulation/P19236/README.md

@@ -0,0 +1,6 @@
+## [baekjoon-19236] 청소년 상어
+
+![image](https://user-images.githubusercontent.com/22045163/116815435-82a28600-ab98-11eb-92c7-8049676c3670.png)
+![image](https://user-images.githubusercontent.com/22045163/116815464-a6fe6280-ab98-11eb-9ee3-453c3dd290a3.png)
+
+![image](https://user-images.githubusercontent.com/22045163/116815479-b1b8f780-ab98-11eb-8ff3-cc02f868ab95.png)

src/Simulation/P19236/input.txt

@@ -0,0 +1,47 @@
+2 6 10 8 6 7 9 4
+1 7 16 6 4 2 5 8
+3 7 8 6 7 6 14 8
+12 7 15 4 11 3 13 3
+
+12 6 14 5 4 5 6 7
+15 1 11 3 3 7 7 5
+10 3 8 2 16 6 1 1
+5 8 2 7 13 6 9 4
+
+답 55 또는 76
+
+7 6 2 1 15 1 9 1
+3 1 1 1 14 7 10 3
+6 1 13 6 4 3 11 4
+16 3 8 7 5 2 12 2
+
+답 42
+
+7 6 2 6 15 7 9 3
+3 5 1 4 14 1 10 6
+6 4 13 3 4 6 11 1
+16 5 8 7 5 2 12 2
+
+답 88
+
+7 1 2 6 15 7 9 3
+3 5 1 4 14 1 10 6
+6 4 13 3 4 6 11 1
+16 5 8 7 5 2 12 2
+
+답7
+
+
+(0, 0)에서 (1, 1)로 이동했을 때
+[6, 9, 10, 14]
+[16, 0, 0, 1]
+[5, 2, 13, 8]
+[3, 4, 11, 15]
+
+3 +3
+4 +4
+6 +2
+8 +2
+11 +3
+14 +2
+15 +1