# POJ（3984）：迷宫问题

 ime Limit: 1000MS Memory Limit: 65536K Total Submissions: 33752 Accepted: 19211

Description

int maze[5][5] = {

0, 1, 0, 0, 0,

0, 1, 0, 1, 0,

0, 0, 0, 0, 0,

0, 1, 1, 1, 0,

0, 0, 0, 1, 0,

};

Input

Output

Sample Input

0 1 0 0 0
0 1 0 1 0
0 0 0 0 0
0 1 1 1 0
0 0 0 1 0

Sample Output

(0, 0)
(1, 0)
(2, 0)
(2, 1)
(2, 2)
(2, 3)
(2, 4)
(3, 4)
(4, 4)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>

using namespace std;

struct pos{
int r,c;
int father;
pos (int rr=0,int cc=0,int ff=0):r(rr),c(cc),father(ff){}//必须设初值，因为下面定义结构体数组类型。
};
pos dir[4] = {pos(-1,0),pos(1,0),pos(0,-1),pos(0,1)};
pos que[30];
int maze[8][8];
int main()
{
memset(maze,0xff,sizeof(maze));//只能赋值为0，1赋值为其他数要用for
for(int i = 1;i <= 5;i++)
for(int j = 1;j <= 5;j++)
scanf("%d",&maze[i][j]);
int tail = 0;
que[tail] = pos(1,1,-1);
tail++;
if(ps.r == 5 && ps.c == 5){
vector <pos> vt;
while(true){
vt.push_back(pos(ps.r,ps.c,0));
if(ps.father == -1)
break;
ps = que[ps.father];
}
for( int i = vt.size()-1; i >= 0; -- i )
cout << "(" << vt[i].r-1 << ", " <<
vt[i].c-1 << ")" << endl;
return 0;
}
else{
for(int i =0;i < 4;i++){
int r = ps.r,c = ps.c;
if(!maze[r+dir[i].r][c+dir[i].c]){
maze[r+dir[i].r][c+dir[i].c] = 1;
}
}
}
}

}


02-21 381
02-14 1465

02-22 1万+
06-08
02-12 84
07-22 27
03-06 458
10-10 19
07-21 334
10-01 11