广度优先遍历求解 ZOJ 649 （Rescue） - c++编程基础

= hd.y + dir[i][1];
if(x >= 0 && x =0 && y < M && map[x][y] != '#'){
Point t;
t.x = x;
t.y = y;
t.time = hd.time + 1;
if(map[x][y] == 'x') t.time ++;
if(t.time < mintime[x][y]){
mintime[x][y] = t.time;
Q.push(t);
}
}
}
}
return mintime[ax][ay];
}

int main() {

while(scanf("%d %d", &N,&M) != EOF){
for(int i=0; i scanf("%s", map[i]);

int sx,sy;
Point start;
for(int i=0; i for(int j=0; j mintime[i][j] = INF; //mintime初始为最大，不可达
if(map[i][j] == 'a'){
ax = i;
ay = j;
}else if(map[i][j] == 'r'){
sx = i;
sy = j;
}
}
}

start.x = sx;
start.y = sy;
start.time = 0;
mintime[sx][sy] = 0;

int mint = bfs(start);
if(mint < INF)
printf("%d\n",mint);
else
printf("Poor ANGEL has to stay in the prison all his life.\n");
}
return 0;
}

广度优先遍历求解 ZOJ 649 （Rescue） (二)