[JAVA-자바] 14500번: 테트로미노

 

소스코드:

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class Main {
    static BufferedReader br;
    static BufferedWriter bw;

    static int width, height;
    static int[][] board;
    static boolean[][] visited;
    static int result;

    static int[] dx = new int[]{0, 0, -1, 1};
    static int[] dy = new int[]{-1, 1, 0, 0};


    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        bw = new BufferedWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(br.readLine());
        height = Integer.parseInt(st.nextToken());
        width = Integer.parseInt(st.nextToken());

        board = new int[height][width];
        visited = new boolean[height][width];
        result = 0;

        for (int y = 0; y < height; y++) {
            st = new StringTokenizer(br.readLine());
            for (int x = 0; x < width; x++) {
                board[y][x] = Integer.parseInt(st.nextToken());
            }
        }
        br.close();

        for (int y = 0; y < height; y++) {
            for (int x = 0; x < width; x++) {
                visited[y][x] = true;
                dfs(y, x, board[y][x], 1);
                visited[y][x] = false;
            }
        }
        br.close();

        bw.write(Integer.toString(result));
        bw.close();
    }

    private static void dfs(int y, int x, int score, int depth) {
        if (depth == 4) {
            result = Math.max(result, score);
            return;
        }

        for (int i = 0; i < 4; i++) {
            int nextY = y + dy[i];
            int nextX = x + dx[i];
            if (!isValidPos(nextY, nextX)) {
                continue;
            }
            if (!visited[nextY][nextX]) {
                if (depth == 2) {
                    // ㅗ ㅜ ㅓ ㅏ
                    visited[nextY][nextX] = true;
                    dfs(y, x, score + board[nextY][nextX], depth + 1);
                    visited[nextY][nextX] = false;
                }
                visited[nextY][nextX] = true;
                dfs(nextY, nextX, score + board[nextY][nextX], depth + 1);
                visited[nextY][nextX] = false;
            }
        }
    }

    private static boolean isValidPos(int y, int x) {
        return 0 <= y && y < height &&
                0 <= x && x < width;
    }
}

 

글의 내용 중 잘못된 점이나 수정이 필요한 부분, 혹은 궁금한 사항이 있다면 언제든 댓글로 남겨주시면 감사하겠습니다.

여러분의 피드백은 더 나은 글을 작성하는 데 큰 도움이 됩니다. 감사합니다.