백준 4485 녹색 옷 입은 애가 젤다

그냥 BFS 로 다 더해서 최소값 집어 넣고 [N-1][N-1] 값 읽음

import java.util.LinkedList;
 
import java.util.Queue;
 
import java.util.Scanner;
 
 
 
public class baek4485 {
 
 
 
    static int N, cnt;
 
    static int[][] map, map1;
 
    static boolean[][] visit;
 
    static int[] dx = { -1, 1, 0, 0 };
 
    static int[] dy = { 0, 0, -1, 1 };
 
    static int min = Integer.MAX_VALUE;
 
    static boolean exitflag;
 
    static int tocnt;
 
 
 
    public static void main(String[] args) {
 
        Scanner sc = new Scanner(System.in);
 
        
 
        while(!exitflag) {
 
            
 
            N = sc.nextInt();
 
            if(N ==0) {
 
                exitflag = true;
 
                continue;
 
            }
 
            map = new int[N][N];
 
            map1 = new int[N][N];
 
            visit = new boolean[N][N];
 
 
 
            for (int i = 0; i < N; i++) {
 
                for (int j = 0; j < N; j++) {
 
                    map[i][j] = sc.nextInt();
 
                    map1[i][j] = min;
 
                }
 
            }
 
 
 
            BFS(0, 0);
 
//            for (int i = 0; i < N; i++) {
 
//                for (int j = 0; j < N; j++) {
 
//                    System.out.print(map[i][j] + " ");
 
//                }
 
//                System.out.println();
 
//            }
 
//            System.out.println("!!!");
 
//            for (int i = 0; i < N; i++) {
 
//                for (int j = 0; j < N; j++) {
 
//                    System.out.print(map1[i][j] + " ");
 
//                }
 
//                System.out.println();
 
//            }
 
    //
 
//            for (int i = 0; i < N; i++) {
 
//                for (int j = 0; j < N; j++) {
 
//                    System.out.print(visit[i][j] + "\t");
 
//                }
 
//                System.out.println();
 
//            }
 
 
 
            System.out.println("Problem " + (++tocnt)+": " + map1[N-1][N-1]);
 
            
 
        }
 
        sc.close();
 
    }
 
 
 
    private static void BFS(int x, int y) {
 
        Queue<Point> q = new LinkedList<Point>();
 
        q.add(new Point(x, y));
 
        map1[x][y] = map[x][y];
 
        visit[x][y] = true;
 
        while (!q.isEmpty()) {
 
            Point p = q.remove();
 
 
 
            
 
            for (int i = 0; i < 4; i++) {
 
                int xx = p.x + dx[i];
 
                int yy = p.y + dy[i];
 
                if (xx >= 0 && yy >= 0 && xx < N && yy < N && map1[xx][yy] > map1[p.x][p.y] + map[xx][yy]) {
 
                    map1[xx][yy] = Math.min(map1[xx][yy], map1[p.x][p.y] + map[xx][yy]);
 
                    visit[xx][yy] = true;
 
                    q.add(new Point(xx, yy));
 
                }
 
            }
 
        }
 
 
 
    }
 
 
 
    private static class Point {
 
        int x;
 
        int y;
 
 
 
        Point(int x, int y) {
 
            this.x = x;
 
            this.y = y;
 
        }
 
    }
 
 
 
}