深度搜索（用结构体）

#include<iostream>
using namespace std;
const int maxn = 100 ;


int n,m;
int map[maxn][maxn],sign[maxn][maxn];
int startx,starty,endx,endy;
int dir[4][2] = {-1,0,0,1,1,0,0,-1};




struct POSITION
{
int x,y;
bool operator == (const POSITION &other)
{
return x==other.x && y==other.y ;
}
bool operator != (const POSITION &other)
{
return !((*this) == other);
}
}; 




POSITION end;


bool law(POSITION a)
{
if(a.x<n && a.x>=0 &&a.y<m && a.y>=0 && !map[a.x][a.y] && !sign[a.x][a.y])
return 1;
return 0;
}


bool DFS(POSITION now)
{
if(now==end) return 1;
sign[now.x][now.y]=1;


    POSITION next;
for(int i=0;i<4;i++)
{
next.x = now.x + dir[i][0];
next.y = now.y + dir[i][1];
if(law(next))
if(DFS(next)) 
return 1;
}

return 0;
}


int main() 
{
POSITION start,end;


    while (scanf("%d %d", &n, &m) != EOF) {
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                scanf("%d", &map[i][j]);
        scanf("%d %d %d %d", &start.x, &start.y, &end.x, &end.y);
        if (DFS(start))
            printf("God bless me!\n");
        else
            printf("Oh, shit!\n"); 
    }
    return 0;
}