[Simulation] swea-2115

Author: Seogeurim

README.md

@@ -67,6 +67,7 @@
 | 28  | ⭐️ | [SWEA-5656 벽돌 깨기](./src/Simulation/swea5656)        |      |
 | 29  |     | [Baekjoon-17406 배열 돌리기 4](./src/Simulation/P17406) |      |
 | 30  |     | [SWEA-9760 Poker Game](./src/Simulation/swea9760)     |      |
+| 31  |     | [SWEA-2115 벌꿀채취](./src/Simulation/swea2115)         |      |
 
 ## String
 

src/Simulation/swea2115/README.md

@@ -0,0 +1,7 @@
+## [SW Expert Academy - 2115] 벌꿀채취
+
+![image](https://user-images.githubusercontent.com/22045163/115662923-a8e74b00-a37a-11eb-8543-5e7fe9010a9d.png)
+![image](https://user-images.githubusercontent.com/22045163/115662963-b3094980-a37a-11eb-89c3-16c47c470ebc.png)
+![image](https://user-images.githubusercontent.com/22045163/115662989-bdc3de80-a37a-11eb-91b0-a1dcf8031160.png)
+
+![image](https://user-images.githubusercontent.com/22045163/115663026-cae0cd80-a37a-11eb-9c9e-3d275d11c79d.png)

src/Simulation/swea2115/Solution.java

@@ -0,0 +1,71 @@
+package Simulation.swea2115;
+
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    static int T, N, M, C;
+    static int[][] map;
+    static int[] select;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Simulation/swea2115/sample_input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        T = Integer.parseInt(br.readLine());
+        for (int t = 1; t <= T; t++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            N = Integer.parseInt(st.nextToken());
+            M = Integer.parseInt(st.nextToken());
+            C = Integer.parseInt(st.nextToken());
+
+            map = new int[N][N];
+            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());
+                }
+            }
+
+            int rcnt = N-M+1;
+            select = new int[N*rcnt];
+            for (int i = 0, cnt = 0; i < N; i++) {
+                for (int j = 0; j < rcnt; j++) {
+                    select[cnt++] = collect(i, j);
+                }
+            }
+
+            int ans = 0;
+            for (int i = 0, size = N*rcnt, r = rcnt; i < size; i++) {
+                int j = i+M;
+                for (; j < r; j++) ans = Math.max(ans, select[i] + select[j]);
+                for (j = r; j < size; j++) ans = Math.max(ans, select[i] + select[j]);
+                if (i == r-1) r += rcnt;
+            }
+
+            sb.append("#").append(t).append(" ").append(ans).append("\n");
+        }
+
+        System.out.println(sb.toString());
+    }
+
+    static int collect(int i, int j) {
+        int res = 0;
+        int[] sub = Arrays.copyOfRange(map[i], j, j+M);
+        Arrays.sort(sub);
+        for (int flag = 1; flag < 1<<M; flag++) {
+            int amt = 0;
+            for (int k = M-1, c = 0; k >= 0; k--) {
+                if ((flag & 1<<k) != 0) {
+                    c += sub[k];
+                    if (c > C) break;
+                    amt += sub[k]*sub[k];
+                }
+            }
+            res = Math.max(res, amt);
+        }
+        return res;
+    }
+}

src/Simulation/swea2115/sample_input.txt

@@ -0,0 +1,71 @@
+10
+4 2 13
+6 1 9 7
+9 8 5 8
+3 4 5 3
+8 2 6 7
+3 3 10
+7 2 9
+6 6 6
+5 5 7
+4 1 10
+8 1 8 2
+4 6 1 6
+4 9 6 3
+7 4 1 3
+4 3 12
+8 8 6 5
+5 2 7 4
+8 5 1 7
+7 8 9 4
+5 2 11
+7 5 9 9 6
+7 3 7 9 3
+1 7 1 4 5
+1 7 9 2 6
+6 6 8 3 8
+6 3 20
+8 5 2 4 3 1
+4 3 6 1 1 8
+4 4 1 2 3 1
+1 7 4 9 6 1
+6 5 1 2 8 4
+3 1 4 5 1 3
+7 2 11
+2 8 2 5 2 8 6
+2 3 7 4 6 4 8
+3 7 8 3 9 4 4
+8 8 5 9 3 6 9
+9 7 6 2 4 1 3
+2 9 2 8 9 7 3
+2 1 7 2 7 8 3
+8 3 12
+9 1 6 7 5 4 6 7
+9 5 1 8 8 3 5 8
+5 2 6 8 6 9 2 1
+9 2 1 8 7 5 2 3
+6 5 5 1 4 5 7 2
+1 7 1 8 1 9 5 5
+6 2 2 9 2 5 1 4
+7 1 1 2 5 9 5 7
+9 4 20
+5 2 4 8 3 7 6 2 1
+7 9 8 5 8 2 6 3 6
+1 9 4 6 7 5 3 1 1
+4 4 7 6 2 2 8 1 7
+9 6 8 5 7 3 7 9 5
+7 3 1 4 1 1 8 5 3
+4 6 8 9 4 5 3 8 8
+1 3 4 2 4 1 1 3 6
+5 9 2 3 5 2 4 8 5
+10 5 30
+7 4 7 5 9 3 6 4 6 7
+8 9 8 4 5 7 8 9 2 9
+6 5 3 4 6 4 7 6 3 2
+4 7 4 3 4 7 3 3 4 3
+3 5 6 4 8 8 2 1 8 6
+3 7 9 7 1 7 6 2 8 9
+3 6 1 6 8 9 7 7 5 1
+4 3 5 6 2 1 2 6 3 6
+3 4 9 2 1 5 9 9 6 3
+9 9 7 3 7 5 5 5 8 4

src/Simulation/swea2115/sample_output.txt

@@ -0,0 +1,10 @@
+#1 174
+#2 131
+#3 145
+#4 155
+#5 166
+#6 239
+#7 166
+#8 172
+#9 291
+#10 464