Submission #1692929

---

Source Code Expand

import java.util.*;

class Main{
    
  static class Pair{
      
      int x;
      int y;
      int d;
      
      Pair(int x,int y,int d){
          this.x = x;
          this.y = y;
          this.d = d;
      }
    
 }

   public static void main(String[] args){

      Scanner sc = new Scanner(System.in);
      
      int R = sc.nextInt();
      int C = sc.nextInt();
      
      int sy = sc.nextInt() - 1;
      int sx = sc.nextInt() - 1;
      
      int gy = sc.nextInt() - 1;
      int gx = sc.nextInt() - 1;
      
      char c[][] = new char[R][C];
      
      for(int i = 0;i < R;i++){
         String S = sc.next();
         for(int j = 0;j < C;j++){
             c[i][j] = S.charAt(j);   
         }       
      }
      
      int d[][] = new int[R][C];
      for(int i = 0;i < R;i++){
         Arrays.fill(d[i],-1);
      }
      
      d[sy][sx] = 0;
      
      Deque<Pair> q = new ArrayDeque<Pair>();
      q.add(new Pair(sx,sy,0));

      int dx[] = new int[]{-1,0,1,0};
      int dy[] = new int[]{0 ,1,0,-1};
      
      while(!q.isEmpty()){
          Pair p = q.pollFirst();
          
          if(p.x == gx && p.y == gy){
              break;
          }
          
          for(int i = 0;i < 4;i++){
            int nx = p.x + dx[i];
            int ny = p.y + dy[i];
            if(nx <0 || nx > C || ny < 0 || ny > R)
                continue;
            if(c[ny][nx] != '#' && d[ny][nx] == -1){
              d[ny][nx] = p.d + 1;                
              q.add(new Pair(nx,ny,p.d + 1));
            }
          }                    
      }
      
      
      System.out.println(d[gy][gx]);
                  
   }
}
        
        
        

Submission Info

Judge Result