poj3009



package work;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class A3009 {
 static int[][] S;
 static int W, H;
 static int[] Dx = { -1, 0, 1, 0 };
 static int[] Dy = { 0, 1, 0, -1 };
 static int sx, sy, gx, gy, minmove;

 public static void main(String[] args) throws FileNotFoundException {
  /* Scanner sc= new Scanner(System.in); */
  Scanner sc = new Scanner(new File("src/3009"));
  while(true){
   W = sc.nextInt();
   H = sc.nextInt();
   S = new int[H][W];
   for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
     S[i][j] = sc.nextInt();
     if (S[i][j] == 2) {
      sx = i;
      sy = j;
     }
     if (S[i][j] == 3) {
      gx = i;
      gy = j;
     }
    }
   }
   if (W == 0 && H == 0) {
    break;
   }
   minmove = 0xfffffff;
   dfs(1, sx, sy);
   /*
    * for (int k = 0; k < H; k++) { for (int k2 = 0; k2 < W; k2++) {
    * System.out.print(S[k][k2]); }  }
    */
   //System.out.println(sx+" "+sy);
   if(minmove==0xfffffff){System.out.println("-1");}
   else{System.out.println(minmove);}
  }
 }
  private static void dfs(int step, int x, int y) {
  if (step >10) {
   return;
  }
  for (int i = 0; i < 4; i++) {
   int k= x +Dx[i];
   int v= y +Dy[i];
   //int xx=x,yy=y;
   while(k>=0&&k<H&&v>=0&&v<W&&S[k][v]!=1){
    int xx=k;int yy=v;
    if(S[k][v]==3){
     if(step<minmove){minmove=step;}
    }
    k= k +Dx[i];
       v= v +Dy[i];
       if(k<0||k>=H||v<0||v>=W){break;}
       if(S[k][v]==1){
        S[k][v]=0;
        dfs(step+1,xx,yy);
        S[k][v]=1;
       }
   }
  }
 }
}

//

2 1
3 2
6 6
1 0 0 2 1 0
1 1 0 0 0 0
0 0 0 0 0 3
0 0 0 0 0 0
1 0 0 0 0 1
0 1 1 1 1 1
6 1
1 1 2 1 1 3
6 1
1 0 2 1 1 3
12 1
2 0 1 1 1 1 1 1 1 1 1 3
13 1
2 0 1 1 1 1 1 1 1 1 1 1 3
0 0

//

1
4
-1
4
10
-1