#include<cstdio>
#include<string>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
using namespace std;
int a[101][101];
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
struct node{
int x,y,pre;
}q[101];
void print(int i){
if(q[i].pre!=-1){
print(q[i].pre);
cout<<"("<<q[i].x<<","<<" "<<q[i].y<<")"<<endl;
}
}
void bfs(int x1,int y1){
int front=0,rear=1,m,n;
q[front].x=x1;
q[front].y=y1;
q[front].pre=-1;
while(front<rear){
for(int i=0;i<4;i++){
m=q[front].x+dx[i];
n=q[front].y+dy[i];
if(m<0||n<0||m>4||n>4||a[m][n])
continue;
else{
a[m][n]=1;
q[rear].x=m;
q[rear].y=n;
q[rear].pre=front;
rear++;
}
if(m==4&&n==4) print(front);
}
front++;
}
}
int main(){
int i,j,k,m,n;
memset(a,0,sizeof(a));
for(i=0;i<5;i++)
for(j=0;j<5;j++)
cin>>a[i][j];
cout<<"(0, 0)"<<endl;
bfs(0,0);
cout<<"(4, 4)"<<endl;
return 0;
}
poj 3984
最新推荐文章于 2019-09-22 20:23:44 发布