結果
問題 | No.1572 XI |
ユーザー | tenten |
提出日時 | 2023-04-12 13:21:37 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,644 bytes |
コンパイル時間 | 2,842 ms |
コンパイル使用メモリ | 89,228 KB |
実行使用メモリ | 122,080 KB |
最終ジャッジ日時 | 2024-04-17 02:27:53 |
合計ジャッジ時間 | 49,758 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
36,936 KB |
testcase_01 | AC | 47 ms
36,752 KB |
testcase_02 | AC | 49 ms
36,700 KB |
testcase_03 | AC | 48 ms
36,940 KB |
testcase_04 | AC | 752 ms
60,988 KB |
testcase_05 | AC | 1,250 ms
81,460 KB |
testcase_06 | AC | 1,441 ms
89,608 KB |
testcase_07 | AC | 122 ms
44,620 KB |
testcase_08 | AC | 1,138 ms
82,332 KB |
testcase_09 | AC | 736 ms
63,012 KB |
testcase_10 | AC | 1,074 ms
69,932 KB |
testcase_11 | AC | 180 ms
48,028 KB |
testcase_12 | AC | 575 ms
56,268 KB |
testcase_13 | AC | 224 ms
48,680 KB |
testcase_14 | AC | 588 ms
55,592 KB |
testcase_15 | AC | 183 ms
48,272 KB |
testcase_16 | AC | 476 ms
55,028 KB |
testcase_17 | AC | 125 ms
44,080 KB |
testcase_18 | AC | 652 ms
61,196 KB |
testcase_19 | AC | 1,273 ms
84,412 KB |
testcase_20 | AC | 948 ms
67,456 KB |
testcase_21 | AC | 1,360 ms
90,104 KB |
testcase_22 | AC | 1,261 ms
80,556 KB |
testcase_23 | AC | 96 ms
42,852 KB |
testcase_24 | AC | 45 ms
36,940 KB |
testcase_25 | AC | 46 ms
37,248 KB |
testcase_26 | AC | 46 ms
37,072 KB |
testcase_27 | AC | 44 ms
36,888 KB |
testcase_28 | AC | 47 ms
37,260 KB |
testcase_29 | AC | 48 ms
37,020 KB |
testcase_30 | AC | 47 ms
37,260 KB |
testcase_31 | AC | 47 ms
37,076 KB |
testcase_32 | AC | 47 ms
36,700 KB |
testcase_33 | AC | 45 ms
37,208 KB |
testcase_34 | TLE | - |
testcase_35 | TLE | - |
testcase_36 | TLE | - |
testcase_37 | TLE | - |
testcase_38 | TLE | - |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | TLE | - |
testcase_42 | TLE | - |
testcase_43 | TLE | - |
testcase_44 | TLE | - |
testcase_45 | TLE | - |
testcase_46 | TLE | - |
testcase_47 | AC | 312 ms
95,972 KB |
testcase_48 | TLE | - |
ソースコード
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(); int w = sc.nextInt(); int srr = sc.nextInt() - 1; int scc = sc.nextInt() - 1; int grr = sc.nextInt() - 1; int gcc = sc.nextInt() - 1; char[][] field = new char[h][]; for (int i = 0; i < h; i++) { field[i] = sc.next().toCharArray(); } PriorityQueue<Path> queue = new PriorityQueue<>(); queue.add(new Path(srr, scc, 0, 0)); int[][][] costs = new int[h][w][6]; for (int[][] arr1 : costs) { for (int[] arr2 : arr1) { Arrays.fill(arr2, Integer.MAX_VALUE); } } while (queue.size() > 0) { Path p = queue.poll(); if (costs[p.r][p.c][p.type] <= p.value || field[p.r][p.c] == '#') { continue; } costs[p.r][p.c][p.type] = p.value; if (p.r > 0 && field[p.r - 1][p.c] == '.') { queue.add(p.add(-1, 0)); } if (p.r < h - 1 && field[p.r + 1][p.c] == '.') { queue.add(p.add(1, 0)); } if (p.c > 0 && field[p.r][p.c - 1] == '.') { queue.add(p.add(0, -1)); } if (p.c < w - 1 && field[p.r][p.c + 1] == '.') { queue.add(p.add(0, 1)); } } if (costs[grr][gcc][0] == Integer.MAX_VALUE) { System.out.println(-1); } else { System.out.println(costs[grr][gcc][0]); } } static class Path implements Comparable<Path> { int r; int c; int type; int value; public Path(int r, int c, int type, int value) { this.r = r; this.c = c; this.type = type; this.value = value; } public int compareTo(Path another) { return value - another.value; } public Path add(int x, int y) { int next; if (x == -1) { if (type < 4) { next = (type + 3) % 4; } else { next = type; } } else if (x == 1) { if (type < 4) { next = (type + 1) % 4; } else { next = type; } } else if (y == -1) { if (type == 1 || type == 3) { next = type; } else if (type == 0) { next = 4; } else if (type == 2) { next = 5; } else if (type == 4) { next = 2; } else { next = 0; } } else { if (type == 1 || type == 3) { next = type; } else if (type == 0) { next = 5; } else if (type == 2) { next = 4; } else if (type == 4) { next = 0; } else { next = 2; } } return new Path(r + x, c + y, next, value + 1); } } } 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(); } }