-
Notifications
You must be signed in to change notification settings - Fork 0
/
bfs_grid.cpp
67 lines (58 loc) · 1.57 KB
/
bfs_grid.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
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;
int x[4] = {-1,0,1,0};
int y[4] = {0,-1,0,1};
int main() {
int r , c;
cin>>r>>c;
pair<int,int> st , end;
bool arr[r][c];
for(int i = 0 ; i < r ; i++){
for(int j = 0 ; j < c ; j++){
char ch;
cin>>ch;
if(ch == 's' || ch == '#') {
arr[i][j] = false;
}else{
arr[i][j] = true;
}
if(ch == '@'){
st.first = i;
st.second = j;
}
if(ch == 'x'){
end.first = i;
end.second = j;
}
}
}
{
queue< pair<int,int> > q;
q.push(st);
arr[st.first][st.second] = false;
while(!q.empty()) {
pair<int,int> v = q.front();
q.pop();
int row , col;
row = v.first;
col = v.second;
for(int i = 0 ; i < 4 ; i++){
int a , b;
a = row + x[i];
b = col + y[i];
if(a >= 0 && a < r && b >= 0 && b < c) {
if(arr[a][b] == true){
cout<<a<<b<<endl;
arr[a][b] = false;
q.push({a,b});
}
}
}
}
}
if(arr[end.first][end.second] == false) {
cout<<"possible";
}else{
cout<<"impossible";
}
}