知识点:最短路
最近在学广搜,发现双端队列广搜很神奇,双端队列广搜和优先队列BFS其实感觉都放到最短路里面讲比较好,毕竟都是拿来解决最短路问题的,做这类的题,首先要看出这是最短路问题,01最短路看似要求很多,但是很多题都可以转化为01最短路的求解,比如这个题,我们转化为01最短路求解,走到空地上距离是0,走到草堆的距离是1,在整个图的外面加一层空地,然后我们求从起点走到外面的一层边的最短路径的长度,就是答案,需要移动的草的堆数,这样题目的求解转化为了01最短路问题,这样就可以使用01最短路的专用算法,双端队列BFS来求解,这类题的难点还是看出,或者把题目给的问题转化为01最短路问题,
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
struct node {
int x, y, step;
node() {}
node(int a, int b, int c): x(a), y(b), step(c) {}
};
int n, h, w, a[N][N], vis[N][N];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
void bfs() {
deque<node> q;
q.push_back(node(h, w, 0));
while (!q.empty()) {
node now = q.front(); q.pop_front();
if (!now.x || now.x == 1001 || !now.y || now.y == 1001) { cout << now.step; return; }
if (vis[now.x][now.y]) continue;
vis[now.x][now.y] = 1;
for (int i = 0; i < 4; i++) {
int x1 = now.x + dx[i];
int y1 = now.y + dy[i];
if (x1 < 0 || x1 > 1001 || y1 < 0 || y1 > 1001) continue;
if (a[x1][y1]) q.push_back(node(x1, y1, now.step + 1));
else q.push_front(node(x1, y1, now.step));
}
}
}
int main() {
cin >> n >> w >> h;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &y, &x);
a[x][y] = 1;
}
bfs();
return 0;
}