[JAVA-자바] 14940번: 쉬운 최단거리

 

소스코드:

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

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

    static int N;
    static int M;

    static int targetX;
    static int targetY;

    static int[][] board;
    static boolean[][] visited;
    static int[][] result;

    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());
        N = Integer.parseInt(st.nextToken());
        M = Integer.parseInt(st.nextToken());

        board = new int[N + 2][M + 2];
        visited = new boolean[N + 2][M + 2];
        result = new int[N + 2][M + 2];

        for (int y = 1; y <= N; y++) {
            st = new StringTokenizer(br.readLine());
            for (int x = 1; x <= M; x++) {
                int var = Integer.parseInt(st.nextToken());
                board[y][x] = var;
                if (var == 2) {
                    targetX = x;
                    targetY = y;
                }
            }
        }
        br.close();

        solve();

        for (int y = 1; y <= N; y++) {
            for (int x = 1; x <= M; x++) {
                if (board[y][x] == 1 && !visited[y][x]) {
                    result[y][x] = -1;
                }
                bw.write(result[y][x] + " ");
            }
            bw.newLine();
        }

        bw.close();
    }

    private static void solve() throws IOException {
        Queue<int[]> queue = new LinkedList<>();
        queue.add(new int[]{targetX, targetY, 0});
        visited[targetY][targetX] = true;

        while (!queue.isEmpty()) {
            int[] cur = queue.poll();
            int x = cur[0];
            int y = cur[1];
            int score = cur[2];

            if (board[y][x] == 1 || board[y][x] == 2) {
                result[y][x] = score;
            }

            int[] addX = {0, 0, -1, 1};
            int[] addY = {-1, 1, 0, 0};

            for (int i = 0; i < 4; i++) {
                int nextX = x + addX[i];
                int nextY = y + addY[i];

                if (!visited[nextY][nextX] && board[nextY][nextX] == 1) {
                    queue.add(new int[]{nextX, nextY, score + 1});
                    visited[nextY][nextX] = true;
                }
            }
        }
    }
}

 

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

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