知识点:广搜
第一次做出难度是困难的acwing的题,但是这个题确实不太难,这个题首先思考状态,那么就是坐标和形态,是三维的,形态我的是这样设定的,立着0横着1竖着躺2,然后左边就是取的左上角的左边,也就是通用的,首先输入的时候,我们寻找终点和起点,终点好找,起点稍微麻烦一点,但是按照我的假设,我们遇到X,先把它更新为形态0,也就是立着,然后再看它是不是竖着或者横着躺,这里判断它竖着躺,需要把所有的数据都输入了再判断,因为要用到后面一行,我就是这个错找了好久,要不是很快就过了
然后就是进入了重头戏,广搜的函数,我们还是遍历4个方向,然后3种形态4个方向,那么就是12对增量数组,也很好写,比如说,现在的形态是0,那么向上倒,x的增量是-2,y的增量是0,这个很好写,然后我们得到当前形态当前方向下的立方体的坐标,还有就是得到它现在的形态,这个分类讨论就行了,如果原来是0,那么向上就变成2,向右就变成了1,这个也很好想,然后就是分类讨论,三种形态,有越界或者不符合题意的情况就跳过,最后就是简单的判断,入队就行了,
真的感觉这个题不难,因为acwing的困难题一般都是对标洛谷的紫题黑题的,我觉得这个题没有难到紫题的程度,写了刘汝佳的书的BFS再来写这个还是比较轻松的
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
struct node {
int x, y, z;
node() {}
node(int a, int b, int c): x(a), y(b), z(c) {}
};
int n, m, xs, ys, zs, xe, ye, dist[N][N][3];
int dx[3][4] = {-2, 0, 1, 0, -1, 0, 1, 0, -1, 0, 2, 0};
int dy[3][4] = {0, 1, 0, -2, 0, 2, 0, -1, 0, 1, 0, -1};
string s[N];
void bfs() {
queue<node> q;
q.push(node(xs, ys, zs));
memset(dist, -1, sizeof(dist));
dist[xs][ys][zs] = 0;
while (!q.empty()) {
node now = q.front(); q.pop();
if (now.x == xe && now.y == ye && !now.z) return;
for (int i = 0; i < 4; i++) {
int x1 = now.x + dx[now.z][i];
int y1 = now.y + dy[now.z][i];
int z1;
if (now.z == 0) z1 = ((i == 1 || i == 3) ? 1 : 2);
if (now.z == 1) z1 = ((i == 0 || i == 2) ? 1 : 0);
if (now.z == 2) z1 = ((i == 0 || i == 2) ? 0 : 2);
if (z1 == 0) {
if (x1 < 1 || x1 > n || y1 < 1 || y1 > m) continue;
if (s[x1][y1] == '#' || s[x1][y1] == 'E') continue;
}
if (z1 == 1) {
if (x1 < 1 || x1 > n || y1 < 1 || y1 > m - 1) continue;
if (s[x1][y1] == '#' || s[x1][y1 + 1] == '#') continue;
}
if (z1 == 2) {
if (x1 < 1 || x1 > n - 1 || y1 < 1 || y1 > m) continue;
if (s[x1][y1] == '#' || s[x1 + 1][y1] == '#') continue;
}
if (dist[x1][y1][z1] != -1) continue;
q.push(node(x1, y1, z1));
dist[x1][y1][z1] = dist[now.x][now.y][now.z] + 1;
}
}
}
int main() {
while (cin >> n >> m && n) {
for (int i = 1; i <= n; i++) {
cin >> s[i];
s[i] = " " + s[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (s[i][j] == 'O') { xe = i; ye = j; s[i][j] = '.'; }
if (s[i][j] == 'X') {
xs = i; ys = j; zs = 0; s[i][j] = '.';
if (j < m && s[i][j + 1] == 'X') { zs = 1; s[i][j + 1] = '.'; }
if (i < n && s[i + 1][j] == 'X') { zs = 2; s[i + 1][j] = '.'; }
}
}
}
bfs();
if (dist[xe][ye][0] != -1) cout << dist[xe][ye][0] << endl;
else cout << "Impossible\n";
}
return 0;
}