#include <iostream>
#include <queue>
using namespace std;
struct POSITION {
int x, y;
bool operator == (const POSITION &oth) const {
return x == oth.x && y == oth.y;
}
bool operator != (const POSITION &oth) const {
return !((*this) == oth);
}
};
queue<POSITION> Q;
int n, m, index;
POSITION start, end;
int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int map[100][100];
char c[100];
bool sign[100][100];
POSITION father[100][100], road[1000];
bool law(POSITION a) {
if (a.x >= 0 && a.x < n && a.y >= 0 && a.y < m &&
!sign[a.x][a.y] && !map[a.x][a.y])
return 1;
return 0;
}
bool BFS() {
while (!Q.empty())
Q.pop();
POSITION now, next; //now用于暂时存放队中的头结点;next用于查找可到达的下一个结点;
Q.push(start);
while (!Q.empty()) {
now = Q.front();
if (now == end) return 1;
Q.pop();
for (int i = 0; i < 4; ++i) {
next.x = now.x + dir[i][0];
next.y = now.y + dir[i][1];
if (law(next)) {
Q.push(next);
sign[next.x][next.y] = 1;
father[next.x][next.y] = now;
}
}
}
return 0;
}
void findroad() {
index = 0;
road[index++] = end;
while (road[index-1] != start) {
road[index] = father[road[index-1].x][road[index-1].y];
++index;
}
printf("%d\n",index-1);
}
int main() {
while (scanf("%d %d", &n, &m) != EOF) {
memset(sign,0,sizeof(sign));
for (int i = 0; i <n; ++i)
{
scanf("%s", &c);
for(int j = 0; j < m; j++)
{
if(c[j]=='.')map[i][j]=0;
else map[i][j]=1;
}
}
start.x = 0, start.y = 0;
end.x = n-1, end.y = m-1;
if(BFS())
findroad();
else printf("-1\n");
}
return 0;
}
#include <queue>
using namespace std;
struct POSITION {
int x, y;
bool operator == (const POSITION &oth) const {
return x == oth.x && y == oth.y;
}
bool operator != (const POSITION &oth) const {
return !((*this) == oth);
}
};
queue<POSITION> Q;
int n, m, index;
POSITION start, end;
int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int map[100][100];
char c[100];
bool sign[100][100];
POSITION father[100][100], road[1000];
bool law(POSITION a) {
if (a.x >= 0 && a.x < n && a.y >= 0 && a.y < m &&
!sign[a.x][a.y] && !map[a.x][a.y])
return 1;
return 0;
}
bool BFS() {
while (!Q.empty())
Q.pop();
POSITION now, next; //now用于暂时存放队中的头结点;next用于查找可到达的下一个结点;
Q.push(start);
while (!Q.empty()) {
now = Q.front();
if (now == end) return 1;
Q.pop();
for (int i = 0; i < 4; ++i) {
next.x = now.x + dir[i][0];
next.y = now.y + dir[i][1];
if (law(next)) {
Q.push(next);
sign[next.x][next.y] = 1;
father[next.x][next.y] = now;
}
}
}
return 0;
}
void findroad() {
index = 0;
road[index++] = end;
while (road[index-1] != start) {
road[index] = father[road[index-1].x][road[index-1].y];
++index;
}
printf("%d\n",index-1);
}
int main() {
while (scanf("%d %d", &n, &m) != EOF) {
memset(sign,0,sizeof(sign));
for (int i = 0; i <n; ++i)
{
scanf("%s", &c);
for(int j = 0; j < m; j++)
{
if(c[j]=='.')map[i][j]=0;
else map[i][j]=1;
}
}
start.x = 0, start.y = 0;
end.x = n-1, end.y = m-1;
if(BFS())
findroad();
else printf("-1\n");
}
return 0;
}