文章
0
粉丝
0
获赞
0
访问
3315
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
const int N = 100 + 5;
typedef pair<int, int> PII;
char g[N][N];
int d[N][N];
int dx[4] = {-1,0,1,0}, dy[4] = {0,-1,0,1};
int h, m;
int bfs(int sx, int sy)
{
queue<PII> q;
d[sx][sy] = 0;
q.push({sx, sy});
while(q.size())
{
auto t = q.front();
q.pop();
if(g[t.x][t.y] == 'E')
{
return d[t.x][t.y];
}
for(int i = 0; i < 4; i++)
{
...
登录后发布评论
暂无评论,来抢沙发