Submission #1511769
Source Code Expand
import java.util.ArrayDeque; import java.util.Deque; import java.util.Scanner; public class Main { static int r; static int c; static int sy; static int sx; static int gy; static int gx; static int[][] m; static int[] x = { 0, 1, 0, -1 }; static int[] y = { -1, 0, 1, 0 }; public static void main(String[] args) { Scanner scan = new Scanner(System.in); r = scan.nextInt(); c = scan.nextInt(); sy = scan.nextInt(); sx = scan.nextInt(); gy = scan.nextInt(); gx = scan.nextInt(); m = new int[r + 2][c + 2]; for (int i = 1; i <= r; i++) { String temp = scan.next(); for (int j = 1; j <= c; j++) { if (temp.charAt(j - 1) == '.') { m[i][j] = -1; } else { m[i][j] = -2; } } } m[sy][sx] = 0; bfs(sy, sx); int ans = Integer.MIN_VALUE; for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { if (m[i][j] > ans) { ans = m[i][j]; } } } System.out.println(ans); } static void bfs(int ny, int nx) { Deque<int[]> q = new ArrayDeque<>(); for (int i = 0; i < 4; i++) { if (m[ny + y[i]][nx + x[i]] == -1) { m[ny + y[i]][nx + x[i]] = m[ny][nx] + 1; int[] a = { ny + y[i], nx + x[i] }; q.offer(a); } } while (!q.isEmpty()) { int[] b = q.pollFirst(); bfs(b[0], b[1]); } } }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | edna |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 1365 Byte |
Status | WA |
Exec Time | 123 ms |
Memory | 23252 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 92 ms | 18900 KB |
subtask0_sample02.txt | AC | 95 ms | 21716 KB |
subtask0_sample03.txt | WA | 98 ms | 21972 KB |
subtask1_01.txt | AC | 99 ms | 18896 KB |
subtask1_02.txt | AC | 100 ms | 21844 KB |
subtask1_03.txt | WA | 123 ms | 21588 KB |
subtask1_04.txt | WA | 101 ms | 19924 KB |
subtask1_05.txt | WA | 103 ms | 21972 KB |
subtask1_06.txt | WA | 100 ms | 18900 KB |
subtask1_07.txt | AC | 92 ms | 19796 KB |
subtask1_08.txt | AC | 97 ms | 18644 KB |
subtask1_09.txt | WA | 109 ms | 17620 KB |
subtask1_10.txt | WA | 100 ms | 17492 KB |
subtask1_11.txt | WA | 110 ms | 19668 KB |
subtask1_12.txt | WA | 100 ms | 19924 KB |
subtask1_13.txt | WA | 99 ms | 18900 KB |
subtask1_14.txt | AC | 97 ms | 20692 KB |
subtask1_15.txt | WA | 100 ms | 23252 KB |
subtask1_16.txt | WA | 114 ms | 21716 KB |
subtask1_17.txt | WA | 105 ms | 21844 KB |
subtask1_18.txt | WA | 114 ms | 17876 KB |
subtask1_19.txt | WA | 101 ms | 21460 KB |
subtask1_20.txt | WA | 97 ms | 20052 KB |
subtask1_21.txt | WA | 101 ms | 21460 KB |
subtask1_22.txt | WA | 114 ms | 19924 KB |