-
Notifications
You must be signed in to change notification settings - Fork 0
/
14940.cpp
42 lines (41 loc) · 1.04 KB
/
14940.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
int N,M,board[1001][1001],sy,sx;
int dy[4]={-1,1,0,0};
int dx[4]={0,0,1,-1};
int visit[1001][1001];
int main(){
scanf("%d%d",&N,&M);
for(int i=0;i<N;i++)
for(int j=0;j<M;j++) {
scanf("%d",&board[i][j]);
if(board[i][j]==2) sy=i,sx=j;
}
queue<pair<int,int>> q;
q.push({sy,sx});
int dist=1;
while(!q.empty()){
int sz=q.size();
while(sz--){
auto [y,x] = q.front(); q.pop();
for(int i=0;i<4;i++){
int ny=y+dy[i];
int nx=x+dx[i];
if(ny<0||nx<0||ny>=N||nx>=M||board[ny][nx]!=1||visit[ny][nx]) continue;
q.push({ny,nx});
visit[ny][nx]=dist;
}
}
dist++;
}
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
if(visit[i][j]==0 && board[i][j]==1) printf("-1 ");
else printf("%d ",visit[i][j]);
}
puts("");
}
}