[Silver III] Title: 배열 복원하기, Time: 292 ms, Memory: 26596 KB -BaekjoonHub

Author: chech2

백준/Silver/16967. 배열 복원하기/README.md

@@ -4,15 +4,15 @@
 
 ### 성능 요약
 
-메모리: 41904 KB, 시간: 384 ms
+메모리: 26596 KB, 시간: 292 ms
 
 ### 분류
 
 구현
 
 ### 제출 일자
 
-2025년 12월 8일 00:40:38
+2026년 3월 7일 18:09:27
 
 ### 문제 설명
 

백준/Silver/16967. 배열 복원하기/배열 복원하기.java

@@ -2,41 +2,58 @@
 import java.util.*;
 
 public class Main {
-
-    static int[] info;
-    static int[][] arr, copyArr;
-    static StringTokenizer st;
-    static StringBuilder sb = new StringBuilder();
-    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    static int h, w, x, y;
+    static int[][] A, B;
     public static void main(String[] args) throws Exception {
-        st = new StringTokenizer(br.readLine());
-
-        info = new int[4];
-        for (int i = 0; i < 4; i++) info[i] = Integer.parseInt(st.nextToken());
-        arr = new int[info[0]][info[1]];
-        copyArr = new int[info[0] + info[2]][info[1] + info[3]];
-        int x, y;
-        for (int i = 0; i < info[0] + info[2]; i++) {
-            st = new StringTokenizer(br.readLine());
-            for (int j = 0; j < info[1] + info[3]; j++) {
-                copyArr[i][j] = Integer.parseInt(st.nextToken());
+        preSetting();
+        findOriginArr();
+    }
 
-                x = i - info[2];
-                y = j - info[3];
+    static void findOriginArr(){
+        int[][] origin = new int[h][w];
 
-                if (i < info[0] && j < info[1]) {
-                    if (0 <= x && x < info[0] && 0 <= y && y < info[1]) arr[i][j] = copyArr[i][j] -  arr[x][y];
-                    else arr[i][j] = copyArr[i][j];
+        for(int i = 0; i < x; i++){
+            for(int j = 0; j < w; j++){
+                origin[i][j] = B[i][j];
+            }
+        }
+        for(int i = 0; i < h; i++){
+            for(int j = 0; j < y; j++){
+                origin[i][j] = B[i][j];
+            }
+        }
+        for(int i = x; i < h; i++){
+            for(int j = y; j < w; j++){
+                origin[i][j] = B[i][j] - origin[i - x][j - y];
+            }
+        }
 
-                    if(j < info[1] - 1) sb.append(arr[i][j]).append(" ");
-                    else sb.append(arr[i][j]);
-                }
+        StringBuilder sb = new StringBuilder();
+        for(int i = 0; i < h; i++){
+            for(int j = 0; j < w; j++){
+                sb.append(origin[i][j]).append(" ");
             }
-            if(i < info[0]) sb.append("\n");
+            sb.append("\n");
         }
 
-        bw.append(sb);
-        bw.close();
+        System.out.println(sb.toString());
+    }
+
+    static void preSetting() throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        h = Integer.parseInt(st.nextToken());
+        w = Integer.parseInt(st.nextToken());
+        x = Integer.parseInt(st.nextToken());
+        y = Integer.parseInt(st.nextToken());
+
+        B = new int[h + x][w + y];
+        for(int i = 0; i < h; i++){
+            st = new StringTokenizer(br.readLine());
+            for(int j = 0; j < w; j++){
+                B[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
     }
 }