bfs CE 悬一关

#include<bits/stdc++.h>
using namespace std;
int a[40010][40010], f[40010][40010];
int k=0,as=1000000005, sang=0;//sang是根号10^9，k用来暴力
int n,m,ans;
struct st {
	int x,y;
};
queue<st>Q;
void bfs () {
	while(!Q.empty()){
		st q=Q.front();
		if(a[q.x][q.y]==n+m){ans=a[q.x][q.y];break;}//找到了答案
		if(q.x>sang||q.y>sang){Q.pop();continue;}//判断越界
		if(f[q.x][q.y]==1){Q.pop();continue;}//剪枝
		f[q.x][q.y]=1;
		Q.push({q.x+1,q.y});
		Q.push({q.x,q.y+1});
		Q.pop();
	}
}
int main () {
	for (sang=0; sang*sang<as; sang++) {sang+=0;}
	cout << sang;
	for (int i = 0; i < sang; i++) {//<=测试平方
		for (int j = 0; j < sang; j++) {
			a[i][j]=k++;//<=录入暴力数据
		}
	}
	cin >> n >> m;
	Q.push({0,0});
	bfs();
	cout << ans << endl;
	return 0;
}