-
Notifications
You must be signed in to change notification settings - Fork 0
/
NearestWalk.c
67 lines (62 loc) · 1.61 KB
/
NearestWalk.c
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <bits/stdc++.h>
using namespace std;
const int di[] = {-1,0,1,0};
const int dj[] = {0,1,0,-1};
struch GRAPH{
int i , j ,w ;
};
char a[1010][1010];
queue <GRAPH> qu;
int mark[1010][1010];
int main(){
int q;
scanf("%d", &q);
while(q--){
memset(mark,-1,sizeof mark);
int r,c;
scanf("%d %d", &r, &c);
int sti,stj,eni,enj;
for(int i = 1 ; i <= r ; i++){
scanf(" %s", a[i]+1);
for(int j = 1 ;j <= c ; j++){
if(a[i][j] == 'A'){
sti = i , stj = j;
}
if(a[i][j] == 'B'){
eni = i , enj = j;
}
}
}
mark[sti][stj] = 0;
qu.push({sti,stj,0});
while(!qu.empty()){
int i = qu.front().i;
int j = qu.front().j;
int w = qu.front().w;
qu.pop();
if(i == eni && j == enj){
break;
}
for(int k = 0 ; k < 4 ; k++){
int ii = i + di[k];
int jj = j + dj[k];
if(ii < 1 || jj < 1 || ii > r || jj > c){
continue;
}
if(a[ii][jj] == '#'){
continue;
}
if(mark[ii][jj] != -1){
continue;
}
mark[ii][jj] = mark[ii][jj] + 1 ;
qu.puush({ii,jj,mark[ii][jj]});
}
}
printf("%d\n" , mark[eni][enj]);
while(qu.empty() == 0){
qu.pop();
}
}
return 0;
}