H - A计划 HDU - 2102 （BFS搜索）

题目

复习搜索的时候做的，发现老WA，神烦啊
WA在两边不能同时为#传送门，要不勇士会不停的传送

AC代码：

#include <bits/stdc++.h>
using namespace std;
#define maxn 100
#define inf 0x3f3f3f3f
#define met(a, b) memset(a, b, sizeof(a))
bool vis1[maxn][maxn], vis2[maxn][maxn];
char MAP1[maxn][maxn], MAP2[maxn][maxn];
int Time;
int T, n, m, k;
struct node{
    int k, x, y, f;
    node(){};
    node(int _x, int _y, int _k, int _f){
        x = _x;
        y = _y;
        k = _k;
        f = _f;
    }
};
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
void bfs();
int main(){
    scanf("%d", &T);
    while(T--){
        met(vis1, 0);
        met(vis2, 0);
        scanf("%d%d%d", &n, &m, &k);
        Time = k;
        for(int i = 0; i < n; i++){
            scanf("%s", MAP1[i]);
        }
        for(int i = 0; i < n; i++){
            scanf("%s", MAP2[i]);
        }
        vis1[0][0] = 1;
        bfs();
    }
    return 0;
}
void bfs(){
    node s(0, 0, 0, 1);
    queue<node> q;
    q.push(s);
    while(!q.empty()){
        node now = q.front();
        q.pop();
//        cout << now.x << " " << now.y << " " << now.k << " " << MAP2[now.x][now.y] << endl;
//        cout << "f:" << now.f  <<endl;
        if((now.f == 1 && MAP1[now.x][now.y] == 'P') || (now.f == 2 && MAP2[now.x][now.y] == 'P')){
            if(now.k <= Time){
                puts("YES");
                return;
            }
        }
        for(int i = 0; i < 4; i++){
            int X = now.x + dx[i];
            int Y = now.y + dy[i];
            if(X >= 0 && X < n && Y >= 0 && Y < m){
                node tmp;
                if(now.f == 1 && MAP1[X][Y] != '*' && !vis1[X][Y] && MAP1[X][Y] !='S'){
                    //vis1[X][Y] = 1;
                    if(MAP1[X][Y] == '.' || MAP1[X][Y] == 'P'){
                        tmp.x = X;
                        tmp.y = Y;
                        vis1[X][Y] = 1;
                        tmp.k = now.k + 1;
                        tmp.f = 1;
                        q.push(tmp);
                    }
                    else if(MAP1[X][Y] == '#' && MAP2[X][Y] != '*' && !vis2[X][Y] && MAP2[X][Y] != '#'){
                        tmp.x = X;
                        tmp.y = Y;
                        vis1[X][Y] = 1;
                        vis2[X][Y] = 1;
                        tmp.k = now.k + 1;
                        tmp.f = 2;
                        q.push(tmp);
                    }
                }
                else if(now.f == 2 && MAP2[X][Y] != '*' && !vis2[X][Y]){
                    //vis2[X][Y] = 1;
                    if(MAP2[X][Y] == '.' || MAP2[X][Y] == 'P'){
                        tmp.x = X;
                        vis2[X][Y] = 1;
                        tmp.y = Y;
                        tmp.k = now.k + 1;
                        tmp.f = 2;
                        q.push(tmp);
                    }
                    else if(MAP2[X][Y] == '#'  && !vis1[X][Y] && MAP1[X][Y] != '*' && MAP1[X][Y] != '#'){
                        tmp.x = X;
                        tmp.y = Y;
                        vis2[X][Y] = 1;
                        vis1[X][Y] = 1;
                        tmp.k = now.k + 1;
                        tmp.f = 1;
                        q.push(tmp);
                    }
                }
            }
            else continue;
        }
    }
    puts("NO");
}