結果
問題 | No.2328 Build Walls |
ユーザー | tenten |
提出日時 | 2023-05-30 14:55:49 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,919 ms / 3,000 ms |
コード長 | 3,624 bytes |
コンパイル時間 | 4,952 ms |
コンパイル使用メモリ | 90,468 KB |
実行使用メモリ | 58,176 KB |
最終ジャッジ日時 | 2024-12-28 11:55:15 |
合計ジャッジ時間 | 24,670 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
37,016 KB |
testcase_01 | AC | 57 ms
37,012 KB |
testcase_02 | AC | 55 ms
36,652 KB |
testcase_03 | AC | 57 ms
36,748 KB |
testcase_04 | AC | 58 ms
36,992 KB |
testcase_05 | AC | 57 ms
36,896 KB |
testcase_06 | AC | 53 ms
36,876 KB |
testcase_07 | AC | 55 ms
37,012 KB |
testcase_08 | AC | 57 ms
36,968 KB |
testcase_09 | AC | 53 ms
36,452 KB |
testcase_10 | AC | 53 ms
36,580 KB |
testcase_11 | AC | 55 ms
36,744 KB |
testcase_12 | AC | 55 ms
36,772 KB |
testcase_13 | AC | 331 ms
47,412 KB |
testcase_14 | AC | 836 ms
52,936 KB |
testcase_15 | AC | 790 ms
52,608 KB |
testcase_16 | AC | 254 ms
45,872 KB |
testcase_17 | AC | 610 ms
51,100 KB |
testcase_18 | AC | 128 ms
39,072 KB |
testcase_19 | AC | 157 ms
42,136 KB |
testcase_20 | AC | 187 ms
42,272 KB |
testcase_21 | AC | 264 ms
47,016 KB |
testcase_22 | AC | 1,082 ms
54,408 KB |
testcase_23 | AC | 1,484 ms
56,980 KB |
testcase_24 | AC | 1,540 ms
57,528 KB |
testcase_25 | AC | 1,919 ms
58,176 KB |
testcase_26 | AC | 1,311 ms
57,620 KB |
testcase_27 | AC | 1,417 ms
57,108 KB |
testcase_28 | AC | 362 ms
49,084 KB |
testcase_29 | AC | 1,381 ms
55,924 KB |
testcase_30 | AC | 433 ms
48,992 KB |
testcase_31 | AC | 400 ms
48,988 KB |
testcase_32 | AC | 1,323 ms
57,112 KB |
testcase_33 | AC | 1,471 ms
53,920 KB |
testcase_34 | AC | 455 ms
51,276 KB |
testcase_35 | AC | 1,155 ms
53,380 KB |
testcase_36 | AC | 54 ms
37,136 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static int MOD; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int h = sc.nextInt() - 2; int w = sc.nextInt(); int[][] field = new int[h][w]; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { field[i][j] = sc.nextInt(); } } PriorityQueue<Path> queue = new PriorityQueue<>(); for (int i = 0; i < h; i++) { queue.add(new Path(i * w, 0)); } int[] costs = new int[h * w]; Arrays.fill(costs, Integer.MAX_VALUE); while (queue.size() > 0) { Path p = queue.poll(); int r = p.idx / w; int c = p.idx % w; if (field[r][c] < 0) { continue; } p.value += field[r][c]; if (costs[p.idx] <= p.value) { continue; } costs[p.idx] = p.value; if (c >= w - 1) { continue; } if (r > 0) { queue.add(new Path(p.idx - w + 1, p.value)); queue.add(new Path(p.idx - w, p.value)); if (c > 0) { queue.add(new Path(p.idx - w - 1, p.value)); } } queue.add(new Path(p.idx + 1, p.value)); if (c > 0) { queue.add(new Path(p.idx - 1, p.value)); } if (r < h - 1) { queue.add(new Path(p.idx + w + 1, p.value)); queue.add(new Path(p.idx + w, p.value)); if (c > 0) { queue.add(new Path(p.idx + w - 1, p.value)); } } } int ans = Integer.MAX_VALUE; for (int i = w - 1; i < h * w; i += w) { ans = Math.min(ans, costs[i]); } if (ans == Integer.MAX_VALUE) { ans = -1; } System.out.println(ans); } static class Path implements Comparable<Path> { int idx; int value; public Path(int idx, int value) { this.idx = idx; 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(); } }