Submission #1507850
Source Code Expand
import java.util.ArrayDeque; import java.util.Queue; import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int R = Integer.parseInt(sc.next()); int C = Integer.parseInt(sc.next()); int sy = Integer.parseInt(sc.next()); int sx = Integer.parseInt(sc.next()); int gy = Integer.parseInt(sc.next()); int gx = Integer.parseInt(sc.next()); char[][] c = new char[R][C]; int [][] d = new int[R][C]; sc.nextLine(); for(int y=0; y<R; y++) { String tempstr = sc.nextLine(); for(int x=0; x<C; x++) { c[y][x] = tempstr.charAt(x); } } Queue<Integer> qy = new ArrayDeque<Integer>(R); Queue<Integer> qx = new ArrayDeque<Integer>(C); qy.offer(sy-1); qx.offer(sx-1); d[sy][sx] = 0; while(!qy.isEmpty() && !qx.isEmpty()) { int x = qx.poll(); int y = qy.poll(); if(gx-1 == x && gy-1 == y) { System.out.println(d[y][x]); return; } for(int i=-1; i<2; i++) { for(int j=-1; j<2; j++) { if((i!=0 && j!=0) || (i==0 && j==0)) continue; if(c[y+i][x+j] == '.' && d[y+i][x+j] == 0) { d[y+i][x+j] = d[y][x] + 1; qx.offer(x+j); qy.offer(y+i); } } } c[y][x] = '#'; } } }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | ponpon05 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 1317 Byte |
Status | AC |
Exec Time | 102 ms |
Memory | 23252 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | 90 ms | 19412 KB |
subtask0_sample02.txt | AC | 91 ms | 21716 KB |
subtask0_sample03.txt | AC | 98 ms | 21460 KB |
subtask1_01.txt | AC | 97 ms | 19028 KB |
subtask1_02.txt | AC | 96 ms | 21844 KB |
subtask1_03.txt | AC | 96 ms | 19924 KB |
subtask1_04.txt | AC | 96 ms | 21844 KB |
subtask1_05.txt | AC | 96 ms | 18900 KB |
subtask1_06.txt | AC | 98 ms | 21460 KB |
subtask1_07.txt | AC | 90 ms | 19924 KB |
subtask1_08.txt | AC | 97 ms | 18628 KB |
subtask1_09.txt | AC | 95 ms | 20692 KB |
subtask1_10.txt | AC | 95 ms | 21076 KB |
subtask1_11.txt | AC | 100 ms | 16976 KB |
subtask1_12.txt | AC | 97 ms | 21716 KB |
subtask1_13.txt | AC | 96 ms | 21716 KB |
subtask1_14.txt | AC | 94 ms | 18644 KB |
subtask1_15.txt | AC | 97 ms | 23252 KB |
subtask1_16.txt | AC | 99 ms | 19796 KB |
subtask1_17.txt | AC | 97 ms | 21716 KB |
subtask1_18.txt | AC | 96 ms | 19796 KB |
subtask1_19.txt | AC | 97 ms | 19540 KB |
subtask1_20.txt | AC | 97 ms | 16980 KB |
subtask1_21.txt | AC | 97 ms | 19924 KB |
subtask1_22.txt | AC | 102 ms | 21588 KB |