[Simulation] baekjoon-21608

Author: Seogeurim

README.md

@@ -69,6 +69,7 @@
 | 30  |     | [SWEA-9760 Poker Game](./src/Simulation/swea9760)     |      |
 | 31  |     | [SWEA-2115 벌꿀채취](./src/Simulation/swea2115)         |      |
 | 32  |     | [Baekjoon-15686 치킨 배달](./src/Simulation/P15686)     |      |
+| 33  |     | [Baekjoon-21608 상어 초등학교](./src/Simulation/P21608)   |      |
 
 ## String
 
@@ -519,4 +520,4 @@
 | 02  |     | [수식 최대화](./src/_2020_카카오_인턴십/P2)         |  구현  |
 | 03  |     | [보석 쇼핑](./src/_2020_카카오_인턴십/P3)          |  2-pointer |
 | 04  |     | [경주로 건설](./src/_2020_카카오_인턴십/P4)          |  dfs + dp  |
-| 05  |     | [동굴 탐험](./src/_2020_카카오_인턴십/P5)           |  graph (cycle check : stack overflow)  |
+| 05  | ⭐️ | [동굴 탐험](./src/_2020_카카오_인턴십/P5)           |  graph (cycle check : stack overflow)  |

src/Simulation/P21608/Main.java

@@ -0,0 +1,109 @@
+package Simulation.P21608;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N;
+    static int[][] map, like;
+    static int[] di = {-1, 0, 1, 0};
+    static int[] dj = {0, 1, 0, -1};
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Simulation/P21608/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        N = Integer.parseInt(br.readLine());
+        map = new int[N][N];
+        like = new int[N*N+1][4];
+
+        for (int i = 0; i < N*N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int s = Integer.parseInt(st.nextToken());
+            for (int j = 0; j < 4; j++) like[s][j] = Integer.parseInt(st.nextToken());
+            setSeat(s);
+        }
+
+        int score = 0;
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j < N; j++) {
+                int cnt = 0;
+                for (int k = 0; k < 4; k++) {
+                    int to_i = i + di[k];
+                    int to_j = j + dj[k];
+                    if (!isValidPath(to_i, to_j)) continue;
+                    for (int l = 0; l < 4; l++) {
+                        if (map[to_i][to_j] == like[map[i][j]][l]) {
+                            cnt ++;
+                            break;
+                        }
+                    }
+                }
+                score += getScore(cnt);
+            }
+        }
+
+        System.out.println(score);
+    }
+
+    static void setSeat(int student) {
+        PriorityQueue<Seat> pq = new PriorityQueue<>();
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j < N; j++) {
+                if (map[i][j] > 0) continue;
+                Seat s = new Seat(i, j);
+                for (int k = 0; k < 4; k++) {
+                    int to_i = i + di[k];
+                    int to_j = j + dj[k];
+                    if (!isValidPath(to_i, to_j)) continue;
+                    if (map[to_i][to_j] == 0) {
+                        s.emptyCnt ++;
+                        continue;
+                    }
+                    for (int l = 0; l < 4; l++) {
+                        if (map[to_i][to_j] == like[student][l]) {
+                            s.likeCnt ++;
+                            break;
+                        }
+                    }
+                }
+                pq.offer(s);
+            }
+        }
+        Seat target = pq.poll();
+        map[target.i][target.j] = student;
+    }
+
+    static boolean isValidPath(int i, int j) {
+        return 0 <= i && i < N && 0 <= j && j < N;
+    }
+
+    static int getScore(int cnt) {
+        if (cnt == 2) return 10;
+        else if (cnt == 3) return 100;
+        else if (cnt == 4) return 1000;
+        else return cnt;
+    }
+
+    static class Seat implements Comparable<Seat> {
+        int i, j, emptyCnt, likeCnt;
+
+        public Seat(int i, int j) {
+            this.i = i;
+            this.j = j;
+        }
+
+        @Override
+        public int compareTo(Seat o) {
+            if (this.likeCnt == o.likeCnt) {
+                if (this.emptyCnt == o.emptyCnt) {
+                    if (this.i == o.i) return Integer.compare(this.j, o.j);
+                    return Integer.compare(this.i, o.i);
+                }
+                return Integer.compare(o.emptyCnt, this.emptyCnt);
+            }
+            return Integer.compare(o.likeCnt, this.likeCnt);
+        }
+    }
+}

src/Simulation/P21608/README.md

@@ -0,0 +1,7 @@
+## [baekjoon-21608] 상어 초등학교
+
+![image](https://user-images.githubusercontent.com/22045163/116638010-502e3880-a9a0-11eb-8cbe-c1864d635d3d.png)
+![image](https://user-images.githubusercontent.com/22045163/116638037-5d4b2780-a9a0-11eb-9fc8-8acdf4b549f6.png)
+![image](https://user-images.githubusercontent.com/22045163/116638051-66d48f80-a9a0-11eb-8066-a61bd54f6684.png)
+
+![image](https://user-images.githubusercontent.com/22045163/116638061-70f68e00-a9a0-11eb-90db-e80207d7e18b.png)

src/Simulation/P21608/input.txt

@@ -0,0 +1,10 @@
+3
+4 2 5 1 7
+2 1 9 4 5
+5 8 1 4 3
+1 2 9 3 4
+7 2 3 4 8
+9 8 4 5 7
+6 5 2 3 4
+8 4 9 2 1
+3 9 2 1 4