結果

問題 No.2328 Build Walls
ユーザー tenten
提出日時 2023-07-27 09:30:16
言語 Java
(openjdk 23)
結果
AC  
実行時間 914 ms / 3,000 ms
コード長 3,187 bytes
コンパイル時間 4,069 ms
コンパイル使用メモリ 85,040 KB
実行使用メモリ 62,860 KB
最終ジャッジ日時 2024-10-04 02:03:25
合計ジャッジ時間 18,213 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int h = sc.nextInt() - 2;
        int w = sc.nextInt();
        int[][] fields = new int[h][w];
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                fields[i][j] = sc.nextInt();
            }
        }
        PriorityQueue<Path> queue = new PriorityQueue<>();
        for (int i = 0; i < h; i++) {
            queue.add(new Path(i, 0, 0));
        }
        int[][] costs = new int[h][w];
        for (int[] arr : costs) {
            Arrays.fill(arr, Integer.MAX_VALUE);
        }
        while (queue.size() > 0) {
            Path p = queue.poll();
            p.value += fields[p.r][p.c];
            if (costs[p.r][p.c] <= p.value || fields[p.r][p.c] == -1) {
                continue;
            }
            costs[p.r][p.c] = p.value;
            for (int i = Math.max(0, p.r - 1); i <= p.r + 1 && i < h; i++) {
                for (int j = Math.max(0, p.c - 1); j <= p.c + 1 && j < w; j++) {
                    if (costs[i][j] == Integer.MAX_VALUE) {
                        queue.add(new Path(i, j, p.value));
                    }
                }
            }
        }
        int ans = Integer.MAX_VALUE;
        for (int[] arr : costs) {
            ans = Math.min(ans, arr[w - 1]);
        }
        if (ans == Integer.MAX_VALUE) {
            System.out.println(-1);
        } else {
            System.out.println(ans);
        }
    }
    
    static class Path implements Comparable<Path> {
        int r;
        int c;
        int value;
        
        public Path(int r, int c, int value) {
            this.r = r;
            this.c = c;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
    }
    
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0