ამ გვერდზე თქვენ იხილავთ გაგზავნილი ამოხსნების სტატუსს.
გაგზავნის თარიღი: 06.04.2021 19:49:45
ამოცანა: ბუბა და ლაბირინთი
მომხმარებელი: jumbera0000
ვერდიქტი: სრული ამოხსნა
შეფასება: 100.0 ქულა
#include <iostream>
using namespace std;
int n, m, sx, sy, K;
string s;
char arr[43][43];
int bordgiali(int x, int y){
arr[x][y] = '#';
if(arr[x][y-1] == '_' || arr[x][y+1]=='_' || arr[x-1][y]=='_' || arr[x+1][y]=='_'){
cout<<x<<" "<<y<<endl;
K++;
return 0;
}else{
if(arr[x][y-1] == '.')bordgiali(x, y-1);
if(arr[x][y+1] == '.')bordgiali(x, y+1);
if(arr[x-1][y] == '.')bordgiali(x-1, y);
if(arr[x+1][y] == '.')bordgiali(x+1, y);
}
}
main(){
cin>>n>>m;
for(int i=0; i<=n+1; i++){
for(int j=0; j<=m+1; j++){
arr[i][j] = '_';
}
}
for(int i=1; i<n+1; i++){
cin>>s;
for(int j=1; j<m+1; j++){
arr[i][j] = s[j-1];
}
}
cin>>sx>>sy;
bordgiali(sx, sy);
if(K==0) cout<<"NO";
}
6 7 ####### ####..# #..#.## ##...## ##.#### ##.#### 2 5
6 3
6 3
YES
6 7 ####### #.....# #..#.## #....## ####### ####### 2 5
NO
NO
YES
12 14 ###########.## #..#.####...## ##.######.#### ##.######....# #..#.####...## ##.######...## ##.########..# #....####...## ##.#......#### ####.######..# #....####...## ############## 11 3
1 12
1 12
YES
12 14 ############## #..#.####...## ##.######.#### ##.######....# #..#.####...## ##.######...## ##.########..# .....####...## ##.#......#### ####.######..# #....####...## ############## 8 1
8 1
8 1
YES
31 28 ############################ ##.######.######.######....# #..#.####...####.######...## ##.########...............## ##.#.........#####.######..# #....####...################ ##.######.######.######....# #..#.####...####.######...## ##.########..........
31 12
31 12
YES
31 28 ############################ ##.######.######.######....# #..#.####...####.######...## ##.########...............## ##.#.........#####.######..# #....####...################ ##.######.######.######....# #..#.####...####.######...## ##.########..........
25 28
25 28
YES
31 28 ############################ ##.######.######.######....# #..#.####...####.######...## ##.########...............## ##.#.........#####.######..# #....####...################ ##.######.######.######....# #..#.####...####.######...## ##.########..........
NO
NO
YES
40 40 ##.##################################### ##.######.###############....######....# #..#.####...####.######...##.######....# ##.########...............##.######....# ##.#.........#####.######..#.######....# #....####...################.######....# ##.#...
1 3
1 3
YES
40 40 ######################################## ##.######.###############....######....# #..#.####...####.######...##.######....# ##.########...............##.######....# ##.#.........#####.######..#.######....# #....####...################.######....# ##.#...
39 40
39 40
YES
40 40 ######################################## ##.######.###############....######....# #..#.####...####.######...##.######....# ##.########...............##.######....# ##.#.........#####.######..#.######....# #....####...################.######....# ##.#...
NO
NO
YES