HDU 2102 A计划 广度优先搜索

两层，加上一点剪枝的光搜

贴代码：（AC , 15ms）

#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
const int MAX = 15;
char map[2][MAX][MAX];
int move[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n, m, t;
struct point{
    int x, y, f, step;
}to,tp;
bool bfs(){
    queue<point> tag;
    tag.push((point){0, 0, 0, 0});
    while(!tag.empty()){
        tp = tag.front();
        tag.pop();
        if(tp.step == t)
            return false;
        for(int i = 0; i < 4; ++i){
            to.x = tp.x + move[i][0];
            to.y = tp.y + move[i][1];
            if(to.x <0 || to.y < 0 || to.x >= n || to.y >= m)
                continue;
            if(map[tp.f][to.x][to.y] == '#')
                to.f = tp.f ^ 1;
            else
                to.f = tp.f;
            if(map[to.f][to.x][to.y] == '.'){
                to.step = tp.step + 1;
                map[to.f][to.x][to.y] = '*';
                tag.push(to);
            }
            if(map[to.f][to.x][to.y] == 'P' && tp.step < t)
                return true;
        }
    }
    return false;
}
int main(){
    int ca;
    scanf("%d", &ca);
    while(ca-- && scanf("%d%d%d", &n, &m, &t)){
        for(int i = 0; i < n; ++i)
            scanf("%s", map[0][i]);
        for(int i = 0; i < n; ++i)
            scanf("%s", map[1][i]);
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j){
                if(map[1][i][j] == '*' && map[0][i][j] == '#')
                    map[0][i][j] = '*';
                if(map[0][i][j] == '*' && map[1][i][j] == '#')
                    map[1][i][j] = '*';
                }
        if(bfs())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}