P3818 小A和uim之大逃离 II

知识点：广度优先搜索

难度：4

这个题是裸的广搜，难点在于状态的选择，因为题目说了最多使用一次跳跃，所以我们除了坐标增加一维，表示到当前的点是跳跃过的还是没有，然后就按照普通的广搜去写就可以了

#include <bits/stdc++.h>

using namespace std;

const int N = 1005;

struct state {
	int x, y, z;
	state() {}
	state(int a, int b, int c): x(a), y(b), z(c) {}
};

int h, w, d, r;
string s[N];

void bfs() {
	int dist[N][N][2];
	memset(dist, -1, sizeof(dist));
	dist[0][0][0] = 0;
	queue<state> q;
	q.push(state(0, 0, 0));
	while (!q.empty()) {
		state now = q.front(); q.pop();
		if (now.x == h - 1 && now.y == w - 1) {
			cout << dist[now.x][now.y][now.z];
			return;
		}
		int dx[4] = {-1, 0, 1, 0};
		int dy[4] = {0, 1, 0, -1};
		for (int i = 0; i < 4; i++) {
			int x1 = now.x + dx[i];
			int y1 = now.y + dy[i];
			if (x1 < 0 || x1 >= h || y1 < 0 || y1 >= w) continue;
			if (dist[x1][y1][now.z] != -1 || s[x1][y1] == '#') continue;
			q.push(state(x1, y1, now.z));
			dist[x1][y1][now.z] = dist[now.x][now.y][now.z] + 1;
		}
		if (now.z) continue;
		int x2 = now.x + d;
		int y2 = now.y + r;
		if (x2 < 0 || x2 >= h || y2 < 0 || y2 >= w) continue;
		if (dist[x2][y2][1] != -1 || s[x2][y2] == '#') continue;
		q.push(state(x2, y2, 1));
		dist[x2][y2][1] = dist[now.x][now.y][0] + 1;
	}
	cout << -1;
}

int main() {
	cin >> h >> w >> d >> r;
	for (int i = 0; i < h; i++) {
		cin >> s[i];
	}
	bfs();
	return 0;
}