結果
問題 | No.2328 Build Walls |
ユーザー | tenten |
提出日時 | 2023-05-30 14:49:57 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,190 bytes |
コンパイル時間 | 3,216 ms |
コンパイル使用メモリ | 95,776 KB |
実行使用メモリ | 52,068 KB |
最終ジャッジ日時 | 2024-12-28 11:54:10 |
合計ジャッジ時間 | 15,218 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
37,336 KB |
testcase_01 | AC | 56 ms
37,272 KB |
testcase_02 | AC | 57 ms
37,488 KB |
testcase_03 | AC | 56 ms
37,348 KB |
testcase_04 | AC | 57 ms
37,116 KB |
testcase_05 | AC | 54 ms
37,184 KB |
testcase_06 | AC | 56 ms
37,272 KB |
testcase_07 | AC | 57 ms
37,464 KB |
testcase_08 | AC | 56 ms
37,228 KB |
testcase_09 | AC | 57 ms
37,264 KB |
testcase_10 | AC | 57 ms
37,292 KB |
testcase_11 | AC | 56 ms
37,488 KB |
testcase_12 | AC | 54 ms
37,336 KB |
testcase_13 | AC | 284 ms
48,016 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 145 ms
42,968 KB |
testcase_20 | WA | - |
testcase_21 | AC | 246 ms
47,500 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 348 ms
49,304 KB |
testcase_29 | WA | - |
testcase_30 | AC | 387 ms
49,544 KB |
testcase_31 | AC | 360 ms
49,508 KB |
testcase_32 | WA | - |
testcase_33 | AC | 747 ms
51,788 KB |
testcase_34 | AC | 394 ms
49,552 KB |
testcase_35 | AC | 709 ms
51,924 KB |
testcase_36 | WA | - |
ソースコード
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 + 1, p.value)); if (r < h - 1) { 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(); } }