結果
問題 | No.2412 YOU Grow Bigger! |
ユーザー | tenten |
提出日時 | 2023-08-17 09:20:59 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,507 bytes |
コンパイル時間 | 2,372 ms |
コンパイル使用メモリ | 89,616 KB |
実行使用メモリ | 46,616 KB |
最終ジャッジ日時 | 2024-05-04 16:12:08 |
合計ジャッジ時間 | 8,603 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
37,100 KB |
testcase_01 | AC | 48 ms
36,644 KB |
testcase_02 | AC | 46 ms
36,956 KB |
testcase_03 | AC | 485 ms
46,616 KB |
testcase_04 | AC | 492 ms
46,048 KB |
testcase_05 | AC | 351 ms
46,240 KB |
testcase_06 | AC | 430 ms
46,200 KB |
testcase_07 | AC | 465 ms
46,588 KB |
testcase_08 | AC | 446 ms
46,352 KB |
testcase_09 | AC | 49 ms
37,116 KB |
testcase_10 | AC | 126 ms
44,584 KB |
testcase_11 | AC | 45 ms
37,320 KB |
testcase_12 | AC | 45 ms
36,904 KB |
testcase_13 | AC | 153 ms
45,680 KB |
testcase_14 | AC | 47 ms
37,088 KB |
testcase_15 | AC | 45 ms
36,904 KB |
testcase_16 | AC | 45 ms
37,132 KB |
testcase_17 | AC | 49 ms
37,240 KB |
testcase_18 | AC | 316 ms
46,256 KB |
testcase_19 | AC | 47 ms
37,124 KB |
testcase_20 | AC | 45 ms
36,992 KB |
testcase_21 | WA | - |
testcase_22 | AC | 141 ms
44,576 KB |
testcase_23 | AC | 206 ms
46,236 KB |
testcase_24 | AC | 293 ms
46,196 KB |
testcase_25 | WA | - |
testcase_26 | AC | 110 ms
42,616 KB |
testcase_27 | AC | 89 ms
40,500 KB |
testcase_28 | AC | 179 ms
45,812 KB |
testcase_29 | AC | 46 ms
37,140 KB |
testcase_30 | AC | 45 ms
36,864 KB |
ソースコード
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(); char[][] field = new char[h][]; for (int i = 0; i < h; i++) { field[i] = sc.next().toCharArray(); } ArrayDeque<Integer> deq = new ArrayDeque<>(); boolean[][] visited = new boolean[h][w]; deq.add(w + 1); while (deq.size() > 0) { int x = deq.poll(); int r = x / w; int c = x % w; if (visited[r][c]) { continue; } visited[r][c] = true; boolean hasDef = false; for (int i = -1; i <= 1 && !hasDef; i++) { for (int j = -1; j <= 1 && !hasDef; j++) { hasDef = (field[r + i][c + j] == '#'); } } if (hasDef) { continue; } if (r > 1) { deq.add(x - w); } if (r < h - 2) { deq.add(x + w); } if (c > 1) { deq.add(x - 1); } if (c < w - 2) { deq.add(x + 1); } } if (!visited[h - 2][w - 2]) { System.out.println(0); return; } for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { if (i <= 2 && j <= 2) { continue; } if (i >= h - 3 && j >= w - 3) { continue; } if (field[i][j] == '#') { continue; } field[i][j] = '#'; deq.add(w + 1); for (boolean[] arr : visited) { Arrays.fill(arr, false); } while (deq.size() > 0) { int x = deq.poll(); int r = x / w; int c = x % w; if (visited[r][c]) { continue; } visited[r][c] = true; boolean hasDef = false; for (int a = -1; a <= 1 && !hasDef; a++) { for (int b = -1; b <= 1 && !hasDef; b++) { hasDef = (field[r + a][c + b] == '#'); } } if (hasDef) { continue; } if (r > 1) { deq.add(x - w); } if (r < h - 2) { deq.add(x + w); } if (c > 1) { deq.add(x - 1); } if (c < w - 2) { deq.add(x + 1); } } if (!visited[h - 2][w - 2]) { System.out.println(1); return; } field[i][j] = '.'; } } System.out.println(2); } } 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(); } }