POJ3009 求最优解的深搜

题目链接：POJ–3009
反正我用的深搜，不过忘了是在求最优解，找到一个解就直接返回了，so。。。查了一晚上没找到。
居然水过了样例以及discuss中的数据。

/*
Problem: 3009       User: ChenyangDu
Memory: 664K        Time: 188MS
Language: G++       Result: Accepted
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int map[2][4] = {1,0,0,-1,0,1,-1,0},INF = 0x7fffffff;
int in[25][25],w,h;

int dfs(int x,int y,int s){
    int ans = INF;
    for(int i=0;i<4;i++){
        int dx = map[0][i],dy = map[1][i];
        int a = dx + x,b = dy + y;
        if(a>=0 && a<h && b>=0 && b<w && in[a][b] != 1){
            while(in[a][b] != 1){
                if(in[a][b] == 3)ans = min(ans,s+1);//就是这句，原来写的 return s+1;
                else if(a<0 || a>=h || b<0 || b>=w)goto next;
                a += dx;
                b += dy;
            }
            if(in[a][b] == 3)return s+1;
            if(s == 10)break;
            in[a][b] = 0;
            ans = min(ans,dfs(a-dx,b-dy,s+1));
            in[a][b] = 1;
        }
        next:;
    }
    return ans;
}

int main(){
    //freopen("in.txt","r",stdin);
    int ans,s_x,s_y;
    scanf("%d%d",&w,&h);
    while(1){
        memset(in,0,sizeof(in));
        for(int i=0;i<h;i++)
            for(int j=0;j<w;j++){
                scanf("%d",&in[i][j]);
                if(in[i][j] == 2){s_x = i;s_y = j;}

            }

        ans = dfs(s_x,s_y,0);
        if(ans<=10)printf("%d",ans);
        else printf("-1");
        scanf("%d%d",&w,&h);
        if(w == 0)break;
        cout<<endl;
    }

    return 0;
}