【2021牛客多校2】I－Penguins 搜索、BFS

本文链接：https://blog.csdn.net/weixin_45717583/article/details/118916573

2021牛客多校2－I

I－Penguins

题目大意

一张地图被分成左右两部分，每部分的大小都是 $20 \times 20$
两只企鹅分别从 $(19, 19)$ 和 $(19, 0)$ 出发，要到达 $(0, 19)$ 和 $(0, 0)$
企鹅的移动是受玩家控制的，但是两只企鹅的移动是左右镜像的
若企鹅的下一个位置是墙或者超出地图范围，则该企鹅不动，只移动另外一直企鹅（如果可以移动）
求最短路径的长度、路径、并在图中标记出来
若有多种路径，输出字典序最小的结果
Time : 1000 ms
Memory: 262144 kB

解题思路及分析

暴搜，因为麻烦一点的搜索做的不多所以这里记录一下这道题
每个节点中存储路径，找到了直接将路径返回，然后按照路径去图里标A
另外这题WA了一发（ $80\%$ ），这里给出一组数据大家可以看看是不是自己的WA点，具体为什么回导致WA标注在代码里面了

.................... ....................
.................... ....................
.................... ....................
.................... ######..............
.................... ....................
.................... ....................
.................... ....................
.................... ....................
.................... ....................
.................... ....................
################.... ....................
......#...#......... ....................
..##..#............. ....................
..#...#............. ....................
..#...#............. ....................
..#...#...#......... ....................
..#.####..#......... ....................
..#................. ....................
..################## ....................
.................... ....................

标准输出如下：

75
LLLLLLLLLLLLLLLLLLUUUUUUUURRRDDDDLDDLLLRRRRRRRRRRRRRUUUUUUUUUUUUUUURRRRRRUU
...................A A...................
...................A A...................
................AAAA AAAAAAA.............
................A... ######A.............
................A... ......A.............
................A... ......A.............
................A... ......A.............
................A... ......A.............
................A... ......A.............
................A... ......A.............
################A... ......A.............
.AAAA.#...#.....A... ......A........AAAA.
.A##A.#.........A... ......A........A..A.
.A#.A.#.........A... ......A........A..A.
.A#.A.#.........A... ......A........A..A.
.A#AA.#...#.....A... ......A........AA.A.
.A#A####..#.....A... ......A.........A.A.
.A#AAAAAAAAAAAAAA... ......AAAAAAAAAAAAAA
.A################## ..................A.
.AAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAA.

(具体为什么是这样的结果可以分析一下，主要是在第二个图里快到终点的时候拦截了一下，因为要按字典序最小所以提前绕开了，虽然右下角看上去有点怪，但是可以根据上面的路径来分析是怎么走的)

AC代码

#include <bits/stdc++.h>
typedef long long llong;
const int N = 1e5 + 5;
using namespace std;

string dir = "DLRU";
int dx[2][4] = {{1, 0, 0, -1}, {1, 0, 0, -1}};
int dy[2][4] = {{0, -1, 1, 0}, {0, 1, -1, 0}};
char mp[2][30][30];
bool vis[30][30][30][30];

struct AC {
    int x[2], y[2];
    string path;
    AC(int x = 0, int y = 0, int x1 = 0, int y1 = 0, string path = "") : x{x, x1}, y{y, y1}, path(path) { }
};

bool judge(int x, int y) {
    return 0 <= x && x < 20 && 0 <= y && y < 20;
}

bool judge2(int x, int y, int k) {
    return mp[k][x][y] != '#';	// 这里如果用mp[k][x][y] == '.'就WA了,因为在后面标A的时候有些'.'被标记成'A'了,导致标出的路径出错
}

string bfs() {
    queue<AC> q;
    memset(vis, false, sizeof(vis));
    q.push(AC(19, 19, 19, 0, ""));
    vis[19][19][19][0] = true;
    while (!q.empty()) {
        int x0 = q.front().x[0];
        int y0 = q.front().y[0];
        int x1 = q.front().x[1];
        int y1 = q.front().y[1];
        string path = q.front().path;
        q.pop();
        if (x0 == 0 && y0 == 19 && x1 == 0 && y1 == 0) {
            return path;
        }
        for (int i = 0; i < 4; i++) {
            int xx0 = x0 + dx[0][i];
            int yy0 = y0 + dy[0][i];
            int xx1 = x1 + dx[1][i];
            int yy1 = y1 + dy[1][i];
            bool f1 = judge(xx0, yy0) && judge2(xx0, yy0, 0);
            bool f2 = judge(xx1, yy1) && judge2(xx1, yy1, 1);
            if (!f1 && !f2) {
                continue;
            }
            if (!f1) {
                xx0 = x0;   yy0 = y0;
            } else if (!f2) {
                xx1 = x1;   yy1 = y1;
            }
            if (!vis[xx0][yy0][xx1][yy1]) {
                vis[xx0][yy0][xx1][yy1] = true;
                q.push(AC(xx0, yy0, xx1, yy1, path + dir[i]));
            }
        }
    }
    return "";
}

int main() {
    #ifdef LOCAL
        freopen("E:/code/ACM/in.in", "r", stdin);
        freopen("E:/code/ACM/out.out", "w", stdout);
    #endif
    for (int i = 0; i < 20; i++) {
        for (int k = 0; k < 2; k++) {
            for (int j = 0; j < 20; j++) {
                scanf(" %c", &mp[k][i][j]);
            }
        }
    }
    string ans = bfs();
    cout << ans.size() << endl;
    cout << ans << endl;
    int x0 = 19;
    int y0 = 19;
    int x1 = 19;
    int y1 = 0;
    mp[0][x0][y0] = 'A';
    mp[1][x1][y1] = 'A';
    for (int i = 0; i < ans.size(); i++) {
        for (int j = 0; j < 4; j++) {
            if (dir[j] == ans[i]) {
                int xx0 = x0 + dx[0][j];
                int yy0 = y0 + dy[0][j];
                int xx1 = x1 + dx[1][j];
                int yy1 = y1 + dy[1][j];
                bool f1 = judge(xx0, yy0) && judge2(xx0, yy0, 0);
                bool f2 = judge(xx1, yy1) && judge2(xx1, yy1, 1);
                if (!f1) {
                    xx0 = x0;   yy0 = y0;
                } else if (!f2) {
                    xx1 = x1;   yy1 = y1;
                }
                mp[0][xx0][yy0] = 'A';
                mp[1][xx1][yy1] = 'A';
                x0 = xx0;   y0 = yy0;
                x1 = xx1;   y1 = yy1;
                break;
            }
        }
    }
    for (int i = 0; i < 20; i++) {
        for (int k = 0; k < 2; k++) {
            for (int j = 0; j < 20; j++) {
                cout << mp[k][i][j];
            }
            cout << ' ';
        }
        cout << endl;
    }
    return 0;
}