T2074.迷宫寻宝路线
2023-08-07 14:38:09
发布于:浙江
#include<bits/stdc++.h>
using namespace std;
int n,g[110][110],v[110][110],dx[4] = {-1,1,0,0},dy[4] = {0,0,-1,1};
struct node{int x,y;};
void f(){
queue<node> q;
q.push({1,1});
cout<<g[1][1]<<" ";
v[1][1] = 1;
while(!q.empty()){
node head = q.front();
q.pop();
for(int i = 0;i < 4;i++){
int tx = head.x + dx[i];
int ty = head.y + dy[i];
if(!v[tx][ty] && tx >= 1 && tx <= n && ty >= 1 && ty <= n){
v[tx][ty] = 1;
q.push({tx,ty});
cout<<g[tx][ty]<<" ";
}
}
}
}
int main(){
cin>>n;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
cin>>g[i][j];
}
}
f();
return 0;
}
这里空空如也
有帮助,赞一个