CH2501 矩阵距离 BFS

题目链接

http://noi-test.zzstep.com/contest/0x20%E3%80%8C%E6%90%9C%E7%B4%A2%E3%80%8D%E4%BE%8B%E9%A2%98/2501%20%E7%9F%A9%E9%98%B5%E8%B7%9D%E7%A6%BB

分析

相当于求多个起点，每步可上下左右移动一格，到达矩阵中各个点的最少步数。

将起点全部加入队列，跑BFS即可。

AC代码

#include <cstdio>
#include <cstring>
#include <queue>

using namespace std;

const int maxn = 1e3 + 5;
const int nxt[4][2] = {{0, -1}, {-1, 0}, {0, 1}, {1, 0}};

struct Node {
	int x, y;

	Node(int x = 0, int y = 0) : x(x), y(y) {}
};

int n, m, d[maxn][maxn];
char s[maxn];
queue<Node> q;

inline int judge(int x, int y) {
	return x >= 1 && x <= n && y >= 1 && y <= m;
}

inline void bfs() {
	while (!q.empty()) {
		Node u = q.front(), v;
		q.pop();
		for (int i = 0; i < 4; ++i) {
			v.x = u.x + nxt[i][0], v.y = u.y + nxt[i][1];
			if (!judge(v.x, v.y)) continue;
			if (d[v.x][v.y] == -1) {
				d[v.x][v.y] = d[u.x][u.y] + 1;
				q.push(v);
			}
		}
	}
}

int main() {
	scanf("%d%d", &n, &m);
	memset(d, -1, sizeof(d));
	for (int i = 1; i <= n; ++i) {
		scanf("%s", s + 1);
		for (int j = 1; j <= m; ++j)
			if (s[j] - '0') {
				d[i][j] = 0;
				q.push(Node(i, j));
			}
	}
	bfs();
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) printf("%d ", d[i][j]);
		puts("");
	}
	return 0;
}