马的遍历

落谷 P1443

#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
//#include<bits/stdc++.h>
using namespace std;
int n, m;
int x_;
int y_;
int a[500][500] = { 0 };
int vis[500][500] = { 0 };
int dir[8][2] = { {2,1},{1,2},{-1,2},{-2,1},{-2,-1},{-1,-2},{1,-2},{2,-1} };//记录马走的方向
struct node {
	int x;
	int y;
};

void bfs() {
	node start;
	start.x = x_;
	start.y = y_;
	queue<node> q;
	q.push(start);

	while (!q.empty()) {
		node now = q.front();
		q.pop();
		for (int i = 0; i < 8; i++)
		{
			node next;
			next.x = now.x + dir[i][0];
			next.y = now.y + dir[i][1];
			if (next.x<1 || next.x>n || next.y<1 || next.y>m||vis[next.x][next.y]==1)
				continue;
			if (a[next.x][next.y] == 0)
				a[next.x][next.y] = a[now.x][now.y]+1;
			vis[next.x][next.y] = 1;
			q.push(next);
		}
	}
}
//把除了起点以外，搜索过后依旧为0的元素赋为-1 
void search(int a[500][500]) {
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			if (a[i][j] == 0)
				a[i][j] = -1;
		}
	}
}

int main() {
	cin >> n>> m >> x_ >> y_;
	bfs();
	search(a);
	a[x_][y_] = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			printf("%-5d", a[i][j]);
		}
		cout << endl;
	}
}