hdu2531之BFS (二)

2014-11-23 22:04:20 来源: 作者: 浏览: 22次【大中小】

Tags: hdu2531 BFS

j != size)continue;
if(mark[next.x[0]][next.y[0]] == flag)continue;
next.time=oq.time+1;
mark[next.x[0]][next.y[0]]=flag;
for(j=0;j if(Map[next.x[j]][next.y[j]] == 'Q')return next.time;
q.push(next);
}
}
return -1;
}

int main(){
int num=0;
while(cin>>n>>m,n+m){
size=0;
for(int i=0;i>Map[i];
for(int i=0;i for(int j=0;j if(Map[i][j] == 'D'){
start.x[size]=i;
start.y[size++]=j;
}
}
}
start.time=0;
int temp=BFS(++num);
if(temp == -1)cout<<"Impossible"< else cout< }
return 0;
}