第十一届蓝桥杯决赛（国赛）扩散（二维数组+bfs）

思路：将这4个坐标点的横纵坐标都加3000，用二维数组进行广度优先搜索，没加3000的话算不了负的坐标系。

#include <bits/stdc++.h>
using namespace std;

int grid[15010][15010],book[15010][15010],dir[4][2] = {1,0,-1,0,0,1,0,-1},res = 4,cnt=0;
int main(){
	queue<pair<int,int> > q,q2;
	grid[3000][3000] = grid[5020][3011] = grid[3011][3014] = grid[5000][5000] = 1;
	book[3000][3000] = book[5020][3011] = book[3011][3014] = book[5000][5000] = 1;
	q.push({3000,3000});q.push({5020,3011});q.push({3011,3014});q.push({5000,5000});
	while(cnt!=2020){			
		while(!q.empty()){
			pair<int,int> p = q.front();
			q.pop();
			int x = p.first;
			int y = p.second;
			for(int i = 0;i < 4;i++)
			{
				int xa = x + dir[i][0];
				int ya = y + dir[i][1];
				//没加小于0的判断，运行得了说明没有出现负数
				if(book[xa][ya] == 1 || grid[xa][ya] == 1) continue;
				book[xa][ya] = 1;
				grid[xa][ya] = 1;
				res++;
				q2.push({xa,ya});
			}
		}
		while(!q2.empty()){
			pair<int,int> p = q2.front();
			q2.pop();
			q.push(p);
		}
		cnt++;
	}
	cout<<res<<endl;
	return 0;
}